Abstract
Several industrial problems involve placing objects into a container without overlap, with the goal of minimizing a certain objective function. These problems arise in many industrial fields such as apparel manufacturing, sheet metal layout, shoe manufacturing, VLSI layout, furniture layout, etc., and are known by a variety of names: layout, packing, nesting, loading, placement, marker making, etc. When the 2-dimensional objects to be packed are non-rectangular the problem is known as the nesting problem. The nesting problem is strongly NP-hard. Furthermore, the geometrical aspects of this problem make it really hard to solve in practice.
In this paper we describe a Mixed-Integer Programming (MIP) model for the nesting problem based on an earlier proposal of Daniels, Li and Milenkovic, and analyze it computationally. We also introduce a new MIP model for a subproblem arising in the construction of nesting solutions, called the multiple containment problem, and show its potentials in finding improved solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blazewicz, J., Moret-Salvador, A., Walkowiak, R.: Parallel tabu search approaches for two-dimensional cutting. Parallel Process. Lett. 14(1), 23–32 (2004)
Burke, E.K., Hellier, R.S.R., Kendall, G., Whitwell, G.: A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. 54(3), 587–601 (2006)
Daniels, K.M.: Containment algorithms for nonconvex polygons with applications to layout. Ph.D. Thesis, Center for Research in Computing Technology, Harvard University, Cambridge, MA (1995)
Daniels, K.K., Milenkovic, V.J., Li, Z.: Multiple containment methods. Technical Report 12–94, Center for Research in Computing Technology, Harvard University, Cambridge, MA (1994)
Dowsland, K.A., Dowsland, W.B.: Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506–521 (1995)
Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighborhood search for two- and three-dimensional nesting problems. Eur. J. Oper. Res. 183(3), 1249–1266 (2007)
Gomes, A.M., Oliveira, J.F.: Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171(3), 811–829 (2006)
Grinde, R.B., Daniels, K.M.: Exact and heuristic approaches for assignment in multiple-container packing. Boston College Technical Report BCCS-97-02 (1997)
Li, Z.: Compaction algorithms for non-convex polygons and their applications. Ph.D. dissertation, Harvard University, Cambridge (1994)
Li, Z., Milenkovic, V.J.: Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84, 539–561 (1995)
Luzzi, I.: Exact and heuristic methods for nesting problems, PhD dissertation, Dipartimento di Metodi Quantitativi, University of Padova (2003); available at http://www.dei.unipd.it/~fisch/ricop/tesi/tesi_dottorato_Luzzi_2002.ps
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Interscience (1988)
Padberg, M.: Packing small boxes into a big box. Math. Methods Oper. Res. 52, 1–21 (2000)
Queyranne, M., Schulz, A.S.: Polyhedral approaches to machine scheduling. Technical Report 408/1994, Technical University of Berlin (1994)
Umetani, S., Yagiura, M., Imamichi, T., Imahori, S., Nonobe, K., Ibaraki, T.: A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem. In: Proceedings of International Symposium on Scheduling (ISS2006), pp. 126–131, Tokyo, July 18–20, 2006
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fischetti, M., Luzzi, I. Mixed-integer programming models for nesting problems. J Heuristics 15, 201–226 (2009). https://doi.org/10.1007/s10732-008-9088-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-008-9088-9