Skip to main content
SpringerLink
Log in

Packing of Polygonal Pieces

  • Chapter
  • First Online:
Introduction to Cutting and Packing Optimization

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 263))

  • 1471 Accesses

Abstract

Besides problems of optimal packing rectangular-shaped objects, as considered in previous chapters, the optimal arrangement of non-rectangular pieces is frequently of interest. Here we address aspects concerning the mutual position of polygonal pieces and the containment within a polygonal region. Moreover, we discuss the basic principles of heuristic solution approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A. Albano, G. Sapuppo, Optimal allocation of two–dimensional irregular shapes using heuristic search methods. IEEE Trans. Syst. Man Cybern. 10(5), 242–248 (1980)

    Article  Google Scholar 

  2. G. Amaral, J. Bernardo, J. Jorge, Marker-making using automatic placement of irregular shapes for the garment industry. Comput. Graph. 14, 41–46 (1990)

    Article  Google Scholar 

  3. R.C. Art, An approach to the two dimensional, irregular cutting stock problem. Technical report, IBM Cambridge Scientific Center Report (1966)

    Google Scholar 

  4. J.A. Bennell, J.F. Oliveira, The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184, 397–415 (2008)

    Article  Google Scholar 

  5. J.A. Bennell, G. Scheithauer, Y. Stoyan, T. Romanova, Tools of mathematical modeling of arbitrary object packing problems. Ann. OR 179, 343–368 (2010)

    Article  Google Scholar 

  6. J.A. Bennell, G. Scheithauer, Y. Stoyan, T. Romanova, A. Pankratov, Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3), 497–524 (2014)

    Article  Google Scholar 

  7. J. Blazewicz, M. Drozdowski, B. Soniewicki, R. Walkowiak, Two-dimensional cutting problem. basic complexity results and algorithms for irregular shapes. Found. Cont. Eng. 14(4), 137–160 (1989)

    Google Scholar 

  8. J. Blazewicz, P. Hawryluk, R. Walkowiak, Using a tabu search approach for solving the two-dimensional irregular cutting problem. Ann. OR 41(1–4), 313–325 (1993)

    Article  Google Scholar 

  9. E.K. Burke, R.S.R. Hellier, G. Kendall, G. Whitwell, Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27–49 (2007)

    Article  Google Scholar 

  10. A. Casotto, F. Romeo, A. Sangiovanni-Vincentelli, A parallel simulated anncaling algorithm for the placement of macro-cells. IEEE Trans. Comput. 6, 838–847 (1987)

    Article  Google Scholar 

  11. Y. Cui, Dynamic programming algorithms for the optimal cutting of equal rectangles. Appl. Math. Model. 29(11), 1040–1053 (2005)

    Article  Google Scholar 

  12. K.A. Dowsland, Some experiments with simulated annealing techniques for packing problems. Europ. J. Oper. Res. 68, 389–399 (1993)

    Article  Google Scholar 

  13. K.A. Dowsland, W.B. Dowsland, Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506–521 (1995)

    Article  Google Scholar 

  14. H. Dyckhoff, G. Scheithauer, J. Terno, Cutting and packing, Chap. 22, in Annotated Bibliographies in Combinatorial Optimization, ed. by M. Dell’Amico, F. Maffioli, S. Martello (Wiley, Chichester, 1997), pp. 393–412

    Google Scholar 

  15. G. Fasano, A global optimization point of view to handle non-standard object packing problems. J. Glob. Optim. 55, 279–299 (2013)

    Article  Google Scholar 

  16. M. Fischetti, I. Luzzi, Mixed-integer programming models for nesting problems. J. Heuristics 15(3), 201–226 (2009)

    Article  Google Scholar 

  17. R.B. Grinde, T.M. Cavalier, A new algorithm for the minimum-area convex enclosing problem. Eur. J. Oper. Res. 84, 522–538 (1995)

    Article  Google Scholar 

  18. R.B. Grinde, T.M. Cavalier, Containment of a single polygon using mathematical programming. Europ. J. Oper. Res. 92, 368–386 (1996)

    Article  Google Scholar 

  19. R.B. Grinde, T.M. Cavalier, A new algorithm for the two-polygon containment problem. Comput. Oper. Res. 24, 231–251 (1997)

    Article  Google Scholar 

  20. R. Heckmann, T. Lengauer, Computing closely matching upper and lower bounds on textile nesting problems. Eur. J. Oper. Res. 108, 473–489 (1998)

    Article  Google Scholar 

  21. T. Imamichia, M. Yagiura, H. Nagamochia, An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim. 6, 345–361 (2009)

    Article  Google Scholar 

  22. Z. Li, V. Milenkovic, The complexity of the compaction problem, in 5th Canadian Conf. On Comp. Geom., Univ. Waterloo (1993)

    Google Scholar 

  23. V.M.M. Marques, C.F.G. Bispo, J.J.S. Sentieiro, A system for the compactation of two-dimensional irregular shapes based on simulated annealing, in IECON-91 (IEEE) (1991), pp. 1911–1916

    Google Scholar 

  24. T.C. Martins, M.S.G. Tsuzuki, Rotational placement of irregular polygons over containers with fixed dimensions using simulated annealing and no-fit polygons. J. Braz. Soc. Mech. Sci. Eng. 30(3), 205–212 (2008)

    Article  Google Scholar 

  25. V.J. Milenkovic, Rotational polygon containment and minimum enclosure using only robust 2d constructions. Comput. Geom. 13(1), 3–19 (1999)

    Article  Google Scholar 

  26. V.J. Milenkovic, Densest translational lattice packing of non-convex polygons. Comput. Geom. 22(1–3), 205–222 (2002)

    Article  Google Scholar 

  27. V.J. Milenkovic, K. Daniels, Translational polygon containment and minimal enclosure using mathematical programming. Int. Trans. Oper. Res. 6(5), 525–554 (1999)

    Article  Google Scholar 

  28. V.J. Milenkovic, K. Daniels, Z. Li, Placement and compaction of nonconvex polygons for clothing manufacture, in 4th Canadian Conf. On Comp. Geom., St. John’s (1992)

    Google Scholar 

  29. V. Mornar, A procedure to optimize the raw material usage in printed wired boards production. Automatika 32(5–6), 173–176 (1991)

    Google Scholar 

  30. I. Mukherjee, P.K. Ray, A review of optimization techniques in metal cutting processes. Comput. Ind. Eng. 50(1–2), 15–34 (2006)

    Article  Google Scholar 

  31. J.F. Oliveira, J.S. Ferreira, A application of simulated annealing to the nesting problem, in Paper Presented at the 34th ORSA/TIMS Joint National Meeting, San Francisco, CA (1992)

    Google Scholar 

  32. O.Y. Sergeyeva, G. Scheithauer, J. Terno, The value correction method for packing of irregular shapes, in Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) (Ufa State Aviation Technical University, Ufa, 1997), pp. 261–269

    Google Scholar 

  33. M. Sharir, S. Toledo, Extremal polygon containment problems. Comput. Geom. 4(2), 99–118 (1994)

    Article  Google Scholar 

  34. Y.G. Stoyan, Mathematical methods for geometric design, in Advances in CAD/CAM, Proceedings of PROLAMAT 82, Leningrad, Amsterdam, ed. by T.M.R. Ellis, O.J. Semenkoc (1983), pp. 67–86

    Google Scholar 

  35. Y.G. Stoyan, ϕ-function of non-convex polygons with rotations. J. Mech. Eng. 6(1), 74–86 (2003)

    Google Scholar 

  36. Y.G. Stoyan, G.N. Yaskov, Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Oper. Res. 5(1), 45–57 (1998)

    Article  Google Scholar 

  37. Y.G. Stoyan, M.V. Novozhilova, A.V. Kartashov, Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. Eur. J. Oper. Res. 92, 193–210 (1996)

    Article  Google Scholar 

  38. Y.G. Stoyan, A.V. Pankratov, Regular packing of congruent polygons on the rectangular sheet. Eur. J. Oper. Res. 113(3), 653–675 (1999)

    Article  Google Scholar 

  39. Y.G. Stoyan, V.N. Patsuk, A method of optimal lattice packing of congruent oriented polygons in the plane. Eur. J. Oper. Res. 124(1), 204–216 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Numerical Mathematics, TU Dresden, Dresden, Germany

    Guntram Scheithauer

Authors
  1. Guntram Scheithauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Scheithauer, G. (2018). Packing of Polygonal Pieces. In: Introduction to Cutting and Packing Optimization. International Series in Operations Research & Management Science, vol 263. Springer, Cham. https://doi.org/10.1007/978-3-319-64403-5_12

Download citation

Publish with us

Policies and ethics

Search

Navigation