Nesting Algorithms for Placement of Regular & Irregular Shaped Parts: A Review

Nesting problem is of great interest to garment, paper, furniture, marble tiles, glass, ship building and sheet metal industries since small improvement of layout can lead to large savings in material. Many effective solutions have been proposed for the case when pieces and containing region are both rectangular. Two dimensional irregular-shaped nesting problems is the problem of finding an efficient arrangement for pieces in a containing region without overlapping, and is aimed at maximizing use of material. This paper systematically reviews the nesting algorithms that were developed to perform various 2-dimensional nesting tasks, and attacks the regular and irregular part nesting problem.

[1]  Jeffrey W. Herrmann,et al.  Evaluating Sheet Metal Nesting Decisions , 1998 .

[2]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[3]  T. J. Nye.  Stamping strip layout for optimal raw material utilization , 2000 .

[4]  S. Kumar,et al.  Automation of strip-layout design for sheet metal work on progressive die , 2008 .

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

[6]  Y. K. D. V. Prasad.  A set of heuristic algorithms for optimal nesting of two-dimensional irregularly shaped sheet-metal blanks , 1994 .

[7]  William W. Chow.  Nesting of a single shape on a strip , 1979 .

[8]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[9]  T. J. Nye.  Optimal nesting of irregular convex blanks in strips via an exact algorithm , 2001 .

[10]  Cihan H. Daǧli,et al.  Knowledge-based systems for cutting stock problems , 1990 .

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

[12]  E. Goodman,et al.  Nesting of Irregular Shapes Using Feature Matching and Parallel Genetic Algorithms , 2001 .

[13]  Yaodong Cui.  Exact algorithm for generating two-segment cutting patterns of punched strips , 2007 .

[14]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[15]  Wen-Chen Lee,et al.  A heuristic for nesting problems of irregular shapes , 2008, Comput. Aided Des..

[16]  Yaodong Cui,et al.  Heuristic algorithm for a cutting stock problem in the steel bridge construction , 2009, Comput. Oper. Res..

[17]  Antonio Albano,et al.  NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES , 1976 .

[18]  Henry J. Lamousin,et al.  Nesting of two-dimensional irregular parts using a shape reasoning heuristic , 1997, Comput. Aided Des..

[19]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[20]  Antonio Albano,et al.  Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

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

[22]  Renzo Orsini,et al.  A Tree Search Approach to the M-Partition and Knapsack Problems , 1980, Comput. J..

[23]  Antonio Albano.  A method to improve two-dimensional layout , 1977 .

[24]  Renzo Orsini,et al.  A Heuristic Solution of the Rectangular Cutting Stock Problem , 1980, Comput. J..

[25]  J. Beasley.  Bounds for Two-Dimensional Cutting , 1985 .

[26]  Antonio Albano,et al.  A Two-stage Solution of the Cutting-stock Problem , 1971, IFIP Congress.

[27]  K. Dowsland,et al.  A tabu thresholding implementation for the irregular stock cutting problem , 1999 .

[28]  Kathryn A. Dowsland,et al.  An algorithm for polygon placement using a bottom-left strategy , 2002, Eur. J. Oper. Res..

[29]  S. Q. Xie,et al.  Nesting of two-dimensional irregular parts: an integrated approach , 2007, Int. J. Comput. Integr. Manuf..

[30]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[31]  Kikuo Fujita,et al.  Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm , 1998 .

[32]  Graham Kendall,et al.  A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem , 2006, Oper. Res..

[33]  Antonio Albano,et al.  A Solution of the Rectangular Cutting-Stock Problem , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[34]  Composite stock cutting through simulated annealing , 1992 .

[35]  Benny K. Nielsen.  An efficient solution method for relaxed variants of the nesting problem , 2007, CATS.

[36]  Liu Hu-yao,et al.  Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle , 2006 .

[37]  Y. Rao,et al.  An integrated knowledge based system for sheet metal cutting-punching combination processing , 2009, Knowl. Based Syst..