Complete and robust no-fit polygon generation for the irregular stock cutting problem

European Journal of Operational Research

Volumn 179, Issue 1, 2007, Pages 27-49

  Burke, E K ^a   Hellier, R S R ^a   Kendall, G ^a   Whitwell, G ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Cutting; No fit polygon; Orbital approach; Packing

Indexed keywords

BENCHMARKING; CUTTING; DATABASE SYSTEMS; OPERATIONS RESEARCH; PACKING;

DATASETS; NO-FIT POLYGON; ORBITAL APPROACH;

PROBLEM SOLVING;

EID: 33751335925     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.011     Document Type: Article

References (34)

1. Adamowicz M., and Albano A. Nesting two dimensional shapes in rectangular modules. Computer Aided Design 8 1 (1976) 27-33
2. Agarwal P.K., Flato E., and Halperin D. Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry Theory and Applications 21 (2002) 39-61
3. Amenta N. Computational geometry software. In: Goodman J.E., and O'Rouke J. (Eds). Handbook of Discrete and Computational Geometry (1997), CRC Press LLC, Boca Raton 951-960 (Chapter 52)
4. Art, R.C., 1966. An approach to the two dimensional irregular cutting stock problem. IBM Cambridge Scientific Centre, Report 36-Y08.
5. Avnaim, F., Boissonnat, J.D., 1987. Simultaneous containment of several polygons. In: Proceedings of the 3rd Annual ACM Symposium on Computational Geometry, pp. 242-250.
6. Avnaim F., and Boissonnat J.D. Polygon placement under translation and rotation. Lecture Notes in Computer Science 294 (1988) 323-333
7. Bennell J.A., Dowsland K.A., and Dowsland W.B. The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Computers and Operations Research 28 (2001) 271-287
8. Burke, E.K., Hellier, R.S.R., Kendall, G., Whitwell, G., in press. A new bottom-left-fill algorithm for the two-dimensional irregular packing problem, Operations Research.
9. Chazelle B., and Dobkin D.P. Optimal convex decompositions. In: Toussaint G.T. (Ed). Computational Geometry (1985), North-Holland, Amsterdam 63-133
10. Cheng S.K., and Rao K.P. Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effect. Computers and Industrial Engineering 33 3-4 (1997) 485-488
11. Cuninghame-Green, R., 1989. Geometry, shoemaking and the milk tray problem. New Scientist 12th August 1989, no. 1677, pp. 50-53.
12. Cuninghame-Green R. Cut out waste!. O.R. Insight 5 3 (1992) 4-7
13. Dowsland K.A., and Dowsland W.B. Packing problems. European Journal of Operations Research 56 (1992) 2-14
14. Dowsland K.A., Dowsland W.B., and Bennell J.A. Jostling for position: Local improvement for irregular cutting patterns. Journal of the Operational Research Society 49 (1998) 647-658
15. Dowsland K.A., Vaid S., and Dowsland W.B. An algorithm for polygon placement using a bottom-left strategy. European Journal of Operational Research 141 (2002) 371-381
16. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
17. Garey M.R., and Johnson D.S. Computers and Intractability: A guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, San Francisco
18. Ghosh P.K. An algebra of polygons through the notion of negative shapes. CVGIP: Image Understanding 54 1 (1991) 119-144
19. Ghosh P.K. A unified computational framework for Minkowski operations. Computers and Graphics 17 4 (1993) 357-378
20. Gomes A.M., and Oliveira J.F. A 2-exchange heuristic for nesting problems. European Journal of Operational Research 141 (2002) 359-370
21. Grinde R.B., and Cavalier T.M. A new algorithm for the minimal-area convex enclosure problem. European Journal of Operations Research 84 (1995) 522-538
22. Hertel S., and Mehlhorn K. Fast triangulation of simple polygons. Proceedings of the 4th International Conference, in Foundations of Computational Theory. Lecture Notes in Computer Science 158 (1983), Springer-Verlag, Berlin 207-218
23. Konopasek, M., 1981. Mathematical treatment of some apparel marking and cutting problems. US Department of Commerce Report, 99-26-90857-10.
24. Li Z., and Milenkovic V.J. Compaction and separation algorithms for non-convex polygons and their applications. European Journal of Operational Research 84 (1995) 539-561
25. Mahadevan, A., 1984. Optimisation in computer aided pattern packing, Ph.D. thesis, North Carolina State University.
26. Milenkovic V.J. Rotational polygon containment and minimum enclosure using only robust 2D constructions. Computational Geometry 13 (1999) 3-19
27. O'Rourke J. Computational Geometry in C. second ed. (1998), Cambridge University Press. 0-521-64976-5
28. Ramkumar, G.D., 1996. An algorithm to compute the Minkowski sum outer-face of two simple polygons. In: Proceedings of the 12th Annual Symposium on Computational Geometry, pp. 234-241.
29. Scheithauer G., and Terno J. Modeling of packing problems. Optimization 28 (1993) 63-84
30. Seidel R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry Theory and Applications 1 (1991) 51-64
31. Stoyan, Y., Ponomarenko, L.D., 1977. Minkowski sum and hodograph of the dense placement vector function, SER. A10, Technical Report, SER. A10, Reports of the SSR Academy of Science.
32. Stoyan Y., Terno J., Scheithauer G., Gil N., and Romanova T. Phi-functions for primary 2D-objects. Studia Informatica Universalis 2 1 (2001) 1-32
33. Stoyan, Y., Scheithauer, G., Gil, N., Romanova, T., 2002. Phi-functions for complex 2D-objects, Technical Report, MATH-NM-2-2002. April 2002, Technische Universitat Dresden.
34. Sweeney P.E., and Paternoster E.R. Cutting and packing problems: A categorized application-orientated research bibliography. Journal of the Operational Research Society 43 7 (1992) 691-706