An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms

The two-dimensional stock cutting problem is well known and often studied. A genetic algorithm approach to the problem is developed that is capable of handling some of the more intractable forms of the problem: nonconvex parts; nonconvex sheets; multiple irregularly shaped sheets; and so on. An integrated system is developed that incorporates a machine vision module for acquiring the images of irregular (nonconvex) parts and sheets, polygonalizing them, and storing them in a database of parts and sheets. Using the polygonal images as well as the manufacturing schedules and priorities as input, a genetic algorithm is used to generate part layouts that satisfy the manufacturing constraints. The significant features of this approach are (1) the integration of all aspects of the layout process and (2) the flexibility of the genetic algorithm approach, which allows it to be adapted to fit the special requirements of different problems. The proposed methods can be particularly useful in the leather and apparel industries, where nonconvex parts and sheets are commonly used.

[1]  Henry J. Lamousin,et al.  Nesting of Complex 2-D Parts Within Irregular Boundaries , 1996 .

[2]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[3]  B. Kröger.  Guillotineable bin packing: A genetic approach , 1995 .

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

[5]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[6]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

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

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

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

[10]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

[11]  Jack Sklansky,et al.  Minimum-Perimeter Polygons of Digitized Silhouettes , 1972, IEEE Transactions on Computers.

[12]  P. K. Agrawal,et al.  Minimising trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts , 1993 .

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

[14]  Solly Andy Segenreich,et al.  Optimal nesting of general plane figures: A Monte Carlo heuristical approach , 1986, Comput. Graph..

[15]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[16]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[17]  K. Dowsland,et al.  Solution approaches to irregular nesting problems , 1995 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Thomas Lengauer,et al.  Efficient automatic part nesting on irregular and inhomogeneous surfaces , 1993, SODA '93.

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

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

[22]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

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

[24]  J. C. Herz,et al.  Recursive computational procedure for two-dimensional stock cutting , 1972 .

[25]  Susan G. Hahn.  On the Optimal Cutting of Defective Sheets , 1968, Oper. Res..

[26]  Jerry L. Sanders,et al.  A nesting algorithm for irregular parts and factors affecting trim losses , 1987 .

[27]  Andrew Y. C. Nee,et al.  Designing Algorithm for Nesting Irregular Shapes With and Without Boundary Constraints , 1986 .

[28]  Cihan H. Dagli,et al.  Simulated annealing approach for solving stock cutting problem , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

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

[30]  Cihan H. Dagli,et al.  An approach to two-dimensional cutting stock problems , 1987 .