Irregular packing: MILP model based on a polygonal enclosure

Miguel Santoro () and Felipe Lemos ()

Annals of Operations Research, 2015, vol. 235, issue 1, 693-707

Abstract: This paper addresses the two-dimensional irregular packing problem, also known as the nesting problem. This is a subset of cutting and packing problems of renowned practical and theoretical relevance. A mixed integer-linear programming formulation is proposed to optimize the packing of particular polygonal shapes, convex forms with 3–8 sides, since their opposite sides are parallel. The model can be used to pack enclosures of general irregular shapes, generating upper bounds to the optimal solutions. The model was tested with 270 mass generated instances of small dimensions. Copyright Springer Science+Business Media New York 2015

Keywords: Strip packing; Polygonal packing; Two-dimensional packing; Mixed integer-linear programming; Disjunctive formulation; Nesting; Cutting and packing (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-1971-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:235:y:2015:i:1:p:693-707:10.1007/s10479-015-1971-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-1971-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().