Mathematical model and efficient algorithms for object packing problem

Computational Geometry: Theory and Applications

Volumn 43, Issue 5, 2010, Pages 535-553

  Chernov, N ^a   Stoyan, Yu ^b   Romanova, T ^b  

^a UNIVERSITY OF ALABAMA AT BIRMINGHAM   (United States)

^b Institute of Mechanical Engineering Problems   (Ukraine)

Author keywords

Cutting and packing; Mathematical modeling; No Fit Polygon; Optimization; Phi function

Indexed keywords

EID: 84868117888     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2009.12.003     Document Type: Article

References (36)

1. P.K. Agarwal E. Flato D. Halperin Polygon decomposition for efficient construction of Minkowski sums Comput. Geom. Theory Appl. 21 2002 29 61
2. A. Albano G. Sapuppo Optimal allocation of two-dimensional irregular shapes using heuristic search methods IEEE Transl. System Man Cybernetics 10 1980 242 248
3. R.C. Art, An approach to the two-dimensional irregular cutting stock problem, Tech. Report 36.Y08, IBM Cambridge Scientific Centre, 1966
4. J.A. Bennell K.A. Dowsland Hybridising tabu search with optimisation techniques for irregular stock cutting Management Sci. 47 2001 1160 1172
5. J.A. Bennell J.F. Oliveira The geometry of nesting problems: A tutorial European J. Oper. Res. 184 2008 397 415
6. J. Bennell, G. Scheithauer, Yu. Stoyan, T. Romanova, Tools of mathematical modelling of arbitrary object packing problems, Ann. Oper. Res., doi:10.1007/s10479-008-0456-5
7. J.A. Bennell X. Song A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums Comput. Oper. Res. 35 2008 267 281
8. E.G. Birgin J.M. Martinez F.H. Nishihara D.P. Ronconi Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization Comput. Oper. Res. 33 2006 3535 3548
9. E. Burke R. Hellier G. Kendall G. Whitwell A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem Oper. Res. 54 2006 587 601
10. R. Dighe M.J. Jakiela Solving pattern nesting problems with genetic algorithms employing task decomposition and contact Evol. Comput. 3 1996 239 266
11. M. Gan N. Gopinathan X. Jia R.A. Williams Predicting packing characteristics of particles of arbitrary shapes KONA 22 2004 82 93
12. P.K. Ghosh An algebra of polygons through the notion of negative shapes CVGIP: Image Understanding 54 1991 119 144
13. P.E. Gill W. Murray M.G.H. Wright Practical Optimization 1981 Acad. Press
14. A.M. Gomes J.F. Oliveira A 2-exchange heuristic for nesting problems European J. Oper. Res. 141 2002 359 370
15. A.M. Gomes J.F. Oliveira Solving irregular strip packing problems by hybridising simulated annealing and linear programming European J. Oper. Res. 171 2006 811 829
16. Z. Li V. Milenkovic Compaction and separation algorithms for non-convex polygons and their applications European J. Oper. Res. 84 1995 539 561
17. D.A. Mahadevan, Optimization in computer-aided pattern packing, Ph.D. Thesis, North Carolina State University, 1984
18. V. Milenkovic Rotational polygon overlap minimization and compaction Comput. Geom. 10 1998 305 318
19. V. Milenkovic Rotational polygon containment and minimum enclosure using only robust 2D constructions Comput. Geom. 13 1999 3 19
20. V.J. Milenkovic K. Daniels Translational polygon containment and minimal enclosure using mathematical programming Int. Trans. Oper. Res. 6 1999 525 554
21. J.F. Oliveira J.S. Ferreira Algorithms for nesting problems, applied simulated annealing R. Vidal Lecture Notes in Econom. and Math. Systems vol. 396 1993 Springer-Verlag 255 274
22. A.V. Pankratov Y. Stoyan Placement of non-convex polygons with rotations into a non-convex polygon Proc. Workshop Cutting Stock Problems 2005 WSCSP2005, Miercurea-Ciuc, Romania, Sep. 15–18, 2005 2006 Alutus Miercurea-Ciuc, Romania 29 36
23. G. Scheithauer, Y.G. Stoyan, T. Romanova, A. Krivulya, Covering a polygonal region by rectangles, Comput. Optimiz. Appl., doi:10.1007/s10589-009-9258-1
24. Yu. Stoyan Mathematical methods for geometric design Advances in CAD/CAM, Proceedings of PROLAMAT82 Leningrad, USSR, May 1982 1983 North-Holland Amsterdam 67 86
25. Y.G. Stoyan A. Chugay Packing cylinders and rectangular parallelepipeds with distances between them European J. Oper. Res. 197 2008 446 455
26. G. Scheithauer Yu.G. Stoyan T.Ye. Romanova Mathematical modeling of interactions of primary geometric 3D objects Cybernet. Systems Anal. 41 2005 332 342
27. Y.G. Stoyan L.D. Ponomarenko Minkowski sum and hodograph of the dense placement vector function Rep. Ukrainian SSR Acad. Sci., Ser. A 10 1977
28. Y. Stoyan M. Gil J. Terno T. Romanova G. Scheithauer Construction of a phi-function for two convex polytopes Appl. Math. 2 2002 199 218
29. Y. Stoyan G. Scheithauer N. Gil T. Romanova Φ -functions for complex 2D-objects 4OR: Quarterly J. Belgian, French and Italian Operations Research Soc. 2 2004 69 84
30. Yu. Stoyan J. Terno G. Scheithauer N. Gil T. Romanova Phi-functions for primary 2D-objects Studia Informatica Universalis 2 2001 1 32
31. An efficient algorithm for the regular W1 packing of polygons in the infinite plane
32. G. Zoutendijk Methods of Feasible Directions A Study in Linear and Non-linear Programming 1960 Elsevier New York
33. G. Zoutendijk Nonlinear Programming, Computational Methods Integer and Nonlinear Programming 1970 North-Holland Pub. Co. Amsterdam
34. http://paginas.fe.up.pt/~esicup/tiki-index.php
35. http://smartimtech.com
36. http://www.math.uab.edu/chernov/CP