A fully general, exact algorithm for nesting irregular shapes

Journal of Global Optimization

Volumn 59, Issue 2-3, 2014, Pages 367-404

  Jones, Donald R ^a  

^a GENERAL MOTORS CORPORATION   (United States)

Author keywords

Cutting and packing; Fabric nesting; Global optimization; Guaranteed optimality; Inner approximation; Inscribed circle; Irregular shape; Leather nesting; Nonconvex polygon; Quadratic programming; Rotation; Translation

Indexed keywords

BRANCH AND BOUND METHOD; GEOMETRY; GLOBAL OPTIMIZATION; PROGRAM TRANSLATORS; QUADRATIC PROGRAMMING; ROTATION; TRANSLATION (LANGUAGES);

CUTTING AND PACKING; INNER APPROXIMATION; INSCRIBED CIRCLES; IRREGULAR SHAPE; LEATHER NESTING; NONCONVEX POLYGONS; OPTIMALITY;

ALGORITHMS;

EID: 84903193011     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-013-0129-z     Document Type: Article

References (27)

1. Albano, A., Sapuppo, G.: Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Syst. Cybern. SMC-10(5), 242-248 (1980)
2. Avnaim, F., Boissonnat, J.: Polygon placement under translation and rotation. Informatique theorique et applications 23(1), 5-28 (1989)
3. Bennel, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60(1), 93-105 (2009)
4. Burke, E., Hellier, R., Kendall, G., Whitwell, G.: A new bottom-left-fill heuristic algorithm for the twodimensional irregular packing problem. Oper. Res. 54(3), 587-601 (2006)
5. Burke, E., Hellier, R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 279, 27-49 (2007)
6. Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discret. Comput. Geomet. 99(3), 382-391 (1995)
7. Costa, M.T.,Gomes, A.M., Oliveira, J.F.:Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet. Eur. J. Oper. Res. 192, 29-40 (2009)
8. Daniels, K., Milenkovic, V.: Multiple translational containment: approximate and exact algorithms. In: Clarkson, K. (ed.) Proceedings of the 6th AnnualACM-SIAM Symposium onDiscrete Algorithms (1995)
9. Daniels, K., Milenkovic, V.: Column-based strip packing using ordered and compliant containment. In: Lin, M.C., Manocha, D. (eds.) Proceedings of the First ACM Workshop on Applied Computational Geometry (WACG), pp. 33-38 (1996)
10. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)
11. Dowsland, K., Dowsland, W.: Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506-521 (1995)
12. Farley, A.A.: Mathematical models for cutting-stock problems in the clothing industry. J. Oper. Res. Soc. 39(1), 41-53 (1988)
13. Floudas, C.A., Visweswaran, V.: Handbook of Global Optimization, chap. Quadratic Optimization, pp. 217-270. Kluwer, Berlin (1995)
14. Heistermann, J., Lengauer, T.: Efficient automatic part nesting on irregular and inhomogeneous surfaces. In: Ramachandran, V. (ed.) Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 251-259 (1993)
15. Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim. 43, 299-328 (2009)
16. Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. (2013). doi:10.1007/s10898-013-0125-3
17. Lamousin, H.,Waggenspack Jr,W.N.: Nesting of two-dimensional irregular parts using a shape reasoning heuristic. Comput. Aided Des. 29(3), 221-238 (1997)
18. Lasserrre, J.B.: An analytical expression and an algorithm for the volume of a convex polyhedron in Rn. J. Optim. Theory Appl. 39, 363-377 (1983)
19. Li, Z.: Compaction algorithms for non-convex polygons and their applications. Ph.D. thesis, Harvard University, Department of Computer Science (1994)
20. Li, Z., Milenkovic, V.: Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84, 539-561 (1995)
21. Milenkovic, V.: Rotational polygon containment and minimum enclosure using only robust 2d constructions. Comput. Geom. 13, 3-19 (1999)
22. Milenkovic, V.: Densest translational lattice packing of non-convex polygons. Comput. Geom. 22, 205- 222 (2002)
23. Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57, 3-50 (2013)
24. O'Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (2001)
25. Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Berlin (1985)
26. Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201-205 (1996)
27. Verkhoturov, M.A., Sergeyeva, O.Y.: The sequential value correction method for the two-dimensional irregular cutting stock problem. Pesquisa Operacional 20(2), 233-246 (2000)