Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem

References

• Alves, C., and J. M. Valério de Carvalho. 2007. “Accelerating Column Generation for Variable Sized Bin-Packing Problems.” European Journal of Operational Research 183 (3): 1333–1352. doi: 10.1016/j.ejor.2005.07.033
   Web of Science ®Google Scholar
• Alves, C., and J. M. Valério de Carvalho. 2008. “A Stabilized Branch-and-Price-and-Cut Algorithm for the Multiple Length Cutting Stock Problem.” Computers & Operations Research 35 (4): 1315–1328. doi: 10.1016/j.cor.2006.08.014
   Web of Science ®Google Scholar
• Araujo, S. A., A. A. Constantino, and K. C. Poldi. 2010. “An Evolutionary Algorithm for the One-Dimensional Cutting Stock Problem.” International Transactions in Operational Research 18 (1): 115–127. doi: 10.1111/j.1475-3995.2009.00760.x
   Google Scholar
• Belov, G. , and G. Scheithauer. 2002. “A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths.” European Journal of Operational Research 141 (2): 274–294. doi: 10.1016/S0377-2217(02)00125-X
   Web of Science ®Google Scholar
• Chen, J. and Y. Tang. 2014. “Sequential Algorithms for Structural Design Optimization Under Tolerance Conditions.” Engineering Optimization 46 (9): 1183–1199. doi: 10.1080/0305215X.2013.832236
   Web of Science ®Google Scholar
• Cui, Y., and Y. Yang. 2010. “A Heuristic for the One-Dimensional Cutting Stock Problem with Usable Leftover." European Journal of Operational Research 204 (2): 245–250. doi: 10.1016/j.ejor.2009.10.028
   Web of Science ®Google Scholar
• Cui, Y-P., and T. Tang. 2014. “Parallelized Sequential Value Correction Procedure for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths.” Engineering Optimization 46 (10): 1352–1368. doi: 10.1080/0305215X.2013.841903
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1963. “A Linear Programming Approach to the Cutting Stock Problem—Part II.” Operations Research 11 (6): 863–888. doi: 10.1287/opre.11.6.863
   Web of Science ®Google Scholar
• Gracia, C., C. Andrés, and L. Gracia. 2013. “A Hybrid Approach Based on Genetic Algorithms to Solve the Problem of Cutting Structural Beams in a Metalwork Company.” Journal of Heuristics 19 (2): 253–273. doi: 10.1007/s10732-011-9187-x
   Web of Science ®Google Scholar
• Gradisar, M., and P. Trkman. 2005. “A Combined Approach to the Solution to the General One-Dimensional Cutting Stock Problem.” Computers & Operations Research 32 (7): 1793–1807. doi: 10.1016/j.cor.2003.11.028
   Web of Science ®Google Scholar
• Hamza, K. and M. Shalaby. 2014. “A Framework for Parallelized Efficient Global Optimization with Application to Vehicle Crashworthiness Optimization.” Engineering Optimization 46 (9): 1200–1221. doi: 10.1080/0305215X.2013.827672
   Web of Science ®Google Scholar
• Han, Y-Y., D. Gong, and X. Sun. 2014. “A Discrete Artificial Bee Colony Algorithm Incorporating Differential Evolution for the Flow-Shop Scheduling Problem with Blocking.” Engineering Optimization. doi:10.1080/0305215X.2014.928817
   Web of Science ®Google Scholar
• Holthaus, O. 2002. “Decomposition Approaches for Solving the Integer One-Dimensional Cutting Stock Problem with Different Types of Standard Lengths.” European Journal of Operational Research 141 (2): 295–312. doi: 10.1016/S0377-2217(02)00126-1
   Web of Science ®Google Scholar
• Kulturel-Konak, S., and A. Konak. 2014. “A Large-Scale Hybrid Simulated Annealing Algorithm for Cyclic Facility Layout Problems.” Engineering Optimization, 1–16. doi:10.1080/0305215X.2014.933825 doi: 10.1080/0305215X.2014.933825
   Web of Science ®Google Scholar
• Poldi, C. K., and N. M. Arenales. 2009. “Heuristics for the One-Dimensional Cutting Stock Problem with Limited Multiple Lengths.” Computers & Operations Research 36 (6): 2074–2081. doi: 10.1016/j.cor.2008.07.001
   Web of Science ®Google Scholar
• Salem, O., A. Shahin, and Y. Khalifa. 2007. “Minimizing Cutting Wastes of Reinforcement Steel Bars Using Genetic Algorithms and Integer Programming Models.” Journal of Construction Engineering and Management 133 (12): 982–992. doi: 10.1061/(ASCE)0733-9364(2007)133:12(982)
   Web of Science ®Google Scholar
• Scheithauer, G., and J. Terno. 1995. “The Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem.” European Journal of Operational Research 84 (3): 562–571. doi: 10.1016/0377-2217(95)00022-I
   Web of Science ®Google Scholar