Nesting of two-dimensional irregular parts: an integrated approach

References

• Alves , J. C. , Ferreira , J. C. , Oliveira , J. F. , Ferreira , J. S. , Matos , J. S. and Albuquerque , C. 1999 . Fafner – accelerating nesting problems with FPGAs . Proceedings of the 7th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCMM 1999) . April 21–23 1999 , Napa Valley, CA, United States. pp. 168 – 177 .
   Google Scholar
• Arvanitis , K. G. 1999 . An algorithm for adaptive pole placement control of linear systems based on generalized sampled-data hold functions . J. Franklin Inst , 336 : 503 – 521 .
   Web of Science ®Google Scholar
• Balas , E. and Perregaard , M. 2002 . Lift-and-project for mixed 0-1 programming: recent progress . Discrete Appl. Math. , 123 : 129 – 154 .
   Web of Science ®Google Scholar
• Bhadury , J. and Chandrasekaran , R. 1996 . Stock cutting to minimize cutting length . Eur. J. Opl Res , 88 : 69 – 87 .
   Web of Science ®Google Scholar
• Bruss , F. T. and Delbaen , F. 2001 . Optimal rules for the sequential selection of monotone subsequences of maximum expected length . Stoch. Proc. Appl , 96 : 313 – 342 .
   Web of Science ®Google Scholar
• Caroe , C. C. and Tind , J. 1997 . Cutting-plane approach to mixed 0-1 stochastic integer programs . Eur. J. Opl Res , 101 : 306 – 316 .
   Web of Science ®Google Scholar
• Chen , Y. , Tang , M. , Tong , R. and Dong , J. 2003 . Packing of polygons using genetic simulated annealing algorithm . Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/J. Comput-Aided Des. Comput. Graphics , 15 : 598 – 603 .
   Google Scholar
• Cheng , S. K. and Rao , K. P. 1999 . Concepts of neighbourhood and universal compact yield towards achieving best pattern layouts . Int. J. Prod. Res , 37 : 3643 – 3658 .
   Web of Science ®Google Scholar
• Cheng , S. K. and Rao , K. P. 2000 . Large-scale nesting of irregular patterns using compact neighborhood algorithm . J. Mater. Process. Technol , 103 : 135 – 140 .
   Web of Science ®Google Scholar
• Cheng , Y. F. , Guo , S. J. and Lai , H. Y. 2000 . Dynamic simulation of random packing of spherical particles . Powder Technol , 107 : 123 – 130 .
   Web of Science ®Google Scholar
• Dowsland , K. A. , Vaid , S. and Dowsland , W. B. 2002 . An algorithm for polygon placement using a bottom-left strategy . Eur. J. Opl Res , 141 : 371 – 381 .
   Web of Science ®Google Scholar
• Dufour , J. , McBride , R. , Zhang , P. and Cheng , C. K. 1997 . Building block placement tool . Proceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC . January 28–31 1997 , Chiba, Japan. pp. 271 – 276 .
   Google Scholar
• Dumitrescu , A. 1998 . An approximation algorithm for cutting out convex polygons . Configurable Computing: Technology and Applications . November 2–3 1998 , Boston, MA, United States. pp. 823 – 827 .
   Google Scholar
• Freeman , H. and Shapira , R. 1975 . Determining the minimum-area encasing rectangle for an arbitrary closed curve . Commun. ACM 18 , 7 : 409 – 413 .
   Google Scholar
• Grinde , R. B. and Cavalier , T. M. 1995 . New algorithm for the minimal-area convex enclosure problem . Eur. J. Opl Res , 84 : 522 – 538 .
   Web of Science ®Google Scholar
• Grinde , R. B. and Cavalier , T. M. 1996 . Containment of a single polygon using mathematical programming . Eur. J. Opl Res , 92 : 368 – 386 .
   Web of Science ®Google Scholar
• Heckmann , R. and Lengauer , T. 1998 . Computing closely matching upper and lower bounds on textile nesting problems . Eur. J. Opl Res , 108 : 473 – 489 .
   Web of Science ®Google Scholar
• Hopper , E. and Turton , B. 1999 . A genetic algorithm for a 2D industrial packing problem . Comput. Ind. Engng , 37 : 375 – 378 .
   Web of Science ®Google Scholar
• Hopper , E. and Turton , B. C.H. 2001 . An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem . Eur. J. Opl Res , 128 : 34 – 57 .
   Web of Science ®Google Scholar
• Kaufmann , M. 1990 . Linear-time algorithm for routing in a convex grid . IEEE Trans Comput-Aided Des. Integr. Circuits Systems , 9 : 180 – 184 .
   Web of Science ®Google Scholar
• Lee , H. C. and Woo , T. C. 1985 . Determining in linear time the minimum area convex hull of two polygons . IIE Trans , 20 : 338 – 345 .
   Google Scholar
• Lutfiyya , H. , McMillin , B. , Poshyanonda , P. and Dagli , C. 1992 . Composite stock cutting through simulated annealing.’ . Math. Comput. Modelling , 16 : 57 – 74 .
   Google Scholar
• MacLeod , B. , Moll , R. , Girkar , M. and Hanifi , N. 1993 . An algorithm for the 2D guillotine cutting stock problem . Eur. J. Opl Res , 68 : 400 – 412 .
   Web of Science ®Google Scholar
• Martini , H. and Soltan , V. 1998 . Minimum Convex partition of polygonal domains by guillotine cuts . Discrete Comput. Geom , 19 : 291
   Web of Science ®Google Scholar
• Milenkovic , V. J. and Daniels , K. 1999 . Translational polygon containment and minimal enclosure using mathematical programming*1 . Int. Trans. Opl Res , 6 : 525 – 554 .
   Google Scholar
• Mishra , V. N. , Singh , V. , Prasad , B. and Ojha , S. P. 1999 . Optical dispersion curves of a light waveguide with a guiding region cross-section resembling a double convex lens . Optik (Jena) , 110 : 397 – 399 .
   Web of Science ®Google Scholar
• Murty , R. L. , Reddy , P. J. and Prasad , A. S. 1983 . Mechanics of Wobble Broaching , 2 : 123 – 131 .
   Google Scholar
• Nandy , S. C. and Bhattacharya , B. B. 2003 . On finding an empty staircase polygon of largest area (width) in a planar point-set . Comput. Geom.: Theory and Applications , 26 : 143 – 171 .
   Web of Science ®Google Scholar
• Nee , A. Y.C. , Seow , K. W. and Long , S. L. 1986 . Designing Algorithm for nesting irregular shapes with and without boundary constraints . CIRP Annls 1986: Mf Technol., Annls Int. Instn Prod. Engng Res , : 107 – 110 .
   Google Scholar
• Peach , R. C. 1988 . Rigorous two-dimensional equations for the analysis of contoured crystal resonators . Proceedings of the Annual Frequency Control Symposium . June 1–3 1988 , Baltimore, MD, USA. pp. 38 – 44 .
   Google Scholar
• Ramesh Babu , A. and Ramesh Babu , N. 2001 . A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms . Comput.-Aided Des , 33 : 879 – 891 .
   Web of Science ®Google Scholar
• Roth , J. , Hashimshony , R. and Wachman , A. 1985 . Generating layouts with non-convex envelopes . Build. Environ , 20 : 211 – 219 .
   Web of Science ®Google Scholar
• Roy , U. and Dasari , V. R. 1998 . Implementation of a polygonal algorithm for surface-surface intersections . Comput. Ind. Engng , 34 : 399 – 412 .
   Web of Science ®Google Scholar
• Shang , K. H. and Song , J. S. 2003 . Newsvendor bounds and heuristic for optimal policies in serial supply chains . Mgmt Sci , 49 : 618 – 638 .
   Web of Science ®Google Scholar
• Takahara , S. , Kusomoto , Y. and Miyamoto , S. 2001 . An adaptive meta-heuristic approach using partial optimization to non-convex polygons allocation problem . 10th IEEE International Conference on Fuzzy Systems . December 2–5 2001 , Melbourne, Australia. pp. 1191 – 1194 .
   Google Scholar
• Tay , F. E.H. , Chong , T. Y. and Lee , F. C. 2002 . Pattern nesting on irregular-shaped stock using Genetic Algorithms . Engineering Applications of Artificial Intelligence , 15 : 551 – 558 .
   Web of Science ®Google Scholar
• Toh , S. K.H. , Loh , H. T. , Nee , A. Y.C. and Lee , K. S. 1995 . A feature-based flat pattern development system for sheet metal parts . J. Mater. Process.Technol , 48 : 89 – 95 .
   Web of Science ®Google Scholar
• Wu , S. Y. 2001 . A cutting plane approach to solving quadratic infinite programs on measure spaces . J. Global Optim , 21 : 67 – 87 .
   Web of Science ®Google Scholar
• Xie , S. Q. , Tu , Y. L. , Liu , J. Q. and Zhou , Z. D. 2001 . An integrated and concurrent approach for compound sheet metal cutting and punching . Int. J. Prod. Res , 39 : 1095 – 1112 .
   Web of Science ®Google Scholar