%0 Journal Article %A WANG Yanxin %A CUI Yaodong %A LI Hua %T Algorithm for two-dimensional cutting stock problem with exact two-staged patterns %D 2017 %R 10.3778/j.issn.1002-8331.1507-0308 %J Computer Engineering and Applications %P 236-240 %V 53 %N 5 %X The two-dimensional cutting stock problem with exact two-staged patterns is solved to minimize the plate cost to meet the blank demands. The approach combines the sequential heuristic procedure and a pattern-generation algorithm to generate the patterns of the cutting plan sequentially. It uses the value-correction strategy to adjust the values of the included blanks after each pattern is generated. Multiple cutting plans are generated through iteration, and the best of them is selected. Experiments are carried out to compare the proposed approach with both commercial stock-cutting software package and published algorithms. The results show that the proposed approach is most effective to reduce plate cost. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1507-0308