Mixed-integer programming models for nesting problems

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.

[1]  Kathryn A. Dowsland,et al.  An algorithm for polygon placement using a bottom-left strategy , 2002, Eur. J. Oper. Res..

[2]  Karen L. Daniels.  Exact and Heuristic Approaches for Assignment in Multiple-Container Packing , 1997 .

[3]  Victor J. Milenkovic,et al.  Limited Gaps , 1994, CCCG.

[4]  T. Ibaraki,et al.  A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM , 2006 .

[5]  Jason Chung,et al.  Intelligent nesting system on 2-D highly irregular resources , 1990, Defense, Security, and Sensing.

[6]  Victor Milenkovic,et al.  Containment algorithms for nonconvex polygons with applications to layout , 1995 .

[7]  K. Dowsland,et al.  Solution approaches to irregular nesting problems , 1995 .

[8]  Victor J. Milenkovic,et al.  Multiple translational containment: approximate and exact algorithms , 1995, SODA '95.

[9]  K. A. Dowsland,et al.  Jostling for position: local improvement for irregular cutting patterns , 1998, J. Oper. Res. Soc..

[10]  Antonio Albano,et al.  Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Zhenyu Li,et al.  Multiple Containment Methods , 1994 .

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[13]  José Fernando Oliveira,et al.  A 2-exchange heuristic for nesting problems , 2002, Eur. J. Oper. Res..

[14]  Jacek Blazewicz,et al.  Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..

[15]  Antonio Albano,et al.  A Two-stage Solution of the Cutting-stock Problem , 1971, IFIP Congress.

[16]  José Fernando Oliveira,et al.  Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming , 2006, Eur. J. Oper. Res..

[17]  A. Mahadevan.  Optimization in computer-aided pattern packing (marking, envelopes) , 1984 .

[18]  Richard Carl Art.  An approach to the two dimensional irregular cutting stock problem. , 1966 .

[19]  José Fernando Oliveira,et al.  TOPOS – A new constructive algorithm for nesting problems , 2000, OR Spectr..

[20]  V. Milenkovic,et al.  Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .

[21]  Jens Egeblad,et al.  Fast neighborhood search for two- and three-dimensional nesting problems , 2007, Eur. J. Oper. Res..

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  E. Tsang,et al.  Guided Local Search , 2010 .

[24]  Graham Kendall,et al.  A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem , 2006, Oper. Res..

[25]  Maurice Queyranne,et al.  Polyhedral Approaches to Machine Scheduling , 2008 .

[26]  José Fernando Oliveira,et al.  Algorithms for Nesting Problems , 1993 .

[27]  Manfred W. Padberg,et al.  Packing small boxes into a big box , 2000, Math. Methods Oper. Res..

[28]  Thomas Lengauer,et al.  Computing closely matching upper and lower bounds on textile nesting problems , 1998, Eur. J. Oper. Res..

[29]  Kathryn A. Dowsland,et al.  Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting , 2001, Manag. Sci..

[30]  Jacek Blazewicz,et al.  Parallel Tabu Search Approaches For Two-Dimensional Cutting , 2004, Parallel Process. Lett..

[31]  Zhenyu Li,et al.  Compaction algorithms for non-convex polygons and their applications , 1995 .

[32]  Toshihide Ibaraki,et al.  5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) , 2006 .