A Rotatable Placement Algorithm and GA to the Nesting Problem

The objective of two-dimensional optimal nesting problem is to place the same or different pieces of the fixed quantity on the sheet in this paper. What we want to do is increase the rate of utility and decrease the waste of panel. Generally, determine the quality of the nesting results; it can briefly be divided into two factors: placement algorithm and permutation. Placement algorithm means to decide the positions where the pieces place into the sheet. And permutation is the placing sequence order of pieces. If the sequence of permutation is available and the placement rule also meets the demand of packing, then the exact or optimal solutions could be found.  This research provides a new placement algorithm rule "Area-Decomposition" method. This combines the rotation function for each piece and genetic algorithm. A comparison of nesting with literature and commercial software shows the results. This research can really acquire good results of nesting according to the demand of different situations in interest.

[1]  Nicos Christofides,et al.  An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .

[2]  J.J.S. Sentieiro,et al.  A system for the compaction of two-dimensional irregular shapes based on simulated annealing , 1991, Proceedings IECON '91: 1991 International Conference on Industrial Electronics, Control and Instrumentation.

[3]  J. Błażewicz,et al.  A local search approach for two-dimensional irregular cutting , 1995 .

[4]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

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

[6]  Zafer Bingul,et al.  Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems , 2006, Eng. Appl. Artif. Intell..

[7]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

[8]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[10]  Kamineni Pitcheswara Rao,et al.  Large-scale nesting of irregular patterns using compact neighborhood algorithm , 2000 .

[11]  Ansheng Deng,et al.  A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..

[12]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[13]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[14]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[15]  Soundar R. T. Kumara,et al.  A scheme integrating neural networks for real-time robotic collision detection , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[16]  A. Ramesh Babu,et al.  A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms , 2001, Comput. Aided Des..