Yaodong Cui

Yaodong Cui

Auto-generated profile, based on publicly available information

Yaodong Cui

School of Computer, Electronics and Information , Guangxi University , Nanning, 530004, China

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2011 in Optimization Methods and Software
Verified
Journal Article
Closed access
YCYaodong Cui
Yaodong Cui
ZLZhiyong Liu
Zhiyong Liu
This paper presents a sequential heuristic procedure (SHP) for the 1D cutting stock problem with pattern reduction, where a set of items are cut from stock bars of the same length to minimize the bar cost, with a secondary objective being to reduce the pattern count of the cutting plan. The SHP generates the current pattern to produce some items, and continues until all items are fulfilled. The algorithm uses two candidate sets (C-Sets). The first is the set of the candidate items for generating the current pattern. The second is the set of candidate patterns from which the current pattern is selected. The algorithm generates candidate patterns using the candidate items, determines the estimated cutting-plan cost (ECP-cost) of each pattern using a look-ahead strategy, and selects the pattern of the minimum ECP-cost as the current pattern. The computational results indicate that the algorithm is efficient.

9 February 2017 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
YCYan Chen
Yan Chen
XSXiang Song
Xiang Song
DODjamila Ouelhadj
Djamila Ouelhadj
YCYaodong Cui
Yaodong Cui

1 March 2017 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
PDF file
YCYaodong Cui
Yaodong Cui
XSXiang Song
Xiang Song
YCYan Chen
Yan Chen
YCYi-Ping Cui
Yi-Ping Cui

30 November 2005 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
YCYaodong Cui
Yaodong Cui

16 February 2006 in European Journal of Operational Research
Verified
Journal Article
Closed access
YCYaodong Cui
Yaodong Cui

2 September 2014 in Engineering Optimization
Verified
Journal Article
Closed access
YCYaodong Cui
Yaodong Cui
YCYi-Ping Cui
Yi-Ping Cui
ZZZhigang Zhao
Zhigang Zhao
A pattern-set generation algorithm (PSG) for the one-dimensional multiple stock sizes cutting stock problem (1DMSSCSP) is presented. The solution process contains two stages. In the first stage, the PSG solves the residual problems repeatedly to generate the patterns in the pattern set, where each residual problem is solved by the column-generation approach, and each pattern is generated by solving a single large object placement problem. In the second stage, the integer linear programming model of the 1DMSSCSP is solved using a commercial solver, where only the patterns in the pattern set are considered. The computational results of benchmark instances indicate that the PSG outperforms existing heuristic algorithms and rivals the exact algorithm in solution quality.