Nesting of two-dimensional irregular parts: An integrated approach

International Journal of Computer Integrated Manufacturing

Volumn 20, Issue 8, 2007, Pages 741-756

  Xie, S Q ^a   Wang, G G ^a   Liu, Y ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Heuristic algorithms; Irregular parts; Nesting algorithms; No fit polygon (NFP)

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; METAL CUTTING; PROBLEM SOLVING; SHEET METAL;

IRREGULAR PARTS; NESTING ALGORITHMS; NO FIT POLYGON (NFP);

INTELLIGENT SYSTEMS;

EID: 35449003955     PISSN: 0951192X     EISSN: 13623052     Source Type: Journal    
DOI: 10.1080/09511920600996401     Document Type: Article

References (39)

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