Applying an Enhanced Heuristic Algorithm to a Constrained Two-Dimensional Cutting Stock Problem

This study focuses on developing fully functional cutting stock software by utilizing an improved multi-phase heuristic algorithm to find the optimal solution for the cutting materi al. Issues which commonly appear in real-world cutting stock applications are also discussed

[1]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[2]  José Fernando Gonçalves,et al.  A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem , 2007, Eur. J. Oper. Res..

[3]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998, Comput. Oper. Res..

[4]  Stefan Tschöke,et al.  A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem , 1995, IRREGULAR.

[5]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[6]  Tzu-Yi Yu,et al.  Applying simulation optimization to the asset allocation of a property-casualty insurer , 2010, Eur. J. Oper. Res..

[7]  Chun-Cheng Lin,et al.  A Heuristic Algorithm for the Three-Dimensional Container Packing Problem with Zero Unloading Cost Constraint , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[8]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[9]  A. Bahnasawi,et al.  Genetic algorithms for solving 2D cutting stock problem , 2003, 2003 46th Midwest Symposium on Circuits and Systems.

[10]  A. Bagchi,et al.  Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..

[11]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems , 2002, Comput. Oper. Res..

[12]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[13]  Antonio Parajón,et al.  GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem , 2007, INFORMS J. Comput..

[14]  Mhand Hifi,et al.  Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates , 1997 .

[15]  Manuel Iori,et al.  A hybrid genetic algorithm for the two-dimensional single large object placement problem , 2007, Eur. J. Oper. Res..

[16]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[17]  Loris Faina,et al.  An application of simulated annealing to the cutting stock problem , 1999, Eur. J. Oper. Res..

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[19]  Francis J. Vasko.  A computational improvement to Wang's two-dimensional cutting stock algorithm , 1989 .

[20]  K. Lai,et al.  Developing a simulated annealing algorithm for the cutting stock problem , 1997 .

[21]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[22]  JoséFernando Oliveira,et al.  An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .

[23]  A. Ramesh Babu,et al.  Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms , 1999 .

[24]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[25]  László Pál,et al.  A genetic algorithm for the two-dimensional Single Large Object Placement Problem , 2006 .

[26]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[27]  Mhand Hifi.  An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock , 1997, Comput. Oper. Res..

[28]  Rong Long Wang,et al.  An improved genetic algorithm with conditional genetic operators and its application to set-covering problem , 2007, Soft Comput..