Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

Two-dimensional bin packing problems consist of allocating, without overlapping, a given set of small rectangles (items) to a minimum number of large identical rectangles (bins), with the edges of the items parallel to those of the bins. According to the specific application, the items may either have a fixed orientation or they can be rotated by 90°. In addition, it may or not be imposed that the items are obtained through a sequence of edge-to-edge cuts parallel to the edges of the bin. In this article, we consider the class of problems arising from all combinations of the above requirements. We introduce a new heuristic algorithm for each problem in the class, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood. The average performance of the single heuristics and of the tabu search are evaluated through extensive computational experiments.

[1]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[2]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[3]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[4]  Bengt-Erik Bengtsson,et al.  Packing Rectangular Pieces - A Heuristic Approach , 1982, Comput. J..

[5]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[6]  Francis J. Vasko,et al.  A practical solution to a fuzzy two-dimensional cutting stock problem , 1989 .

[7]  Daniele Vigo,et al.  Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..

[8]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[9]  Attahiru Sule Alfa,et al.  A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem , 1994 .

[10]  William B. Dowsland.  On a Research Bibliography for Cutting and Packing Problems , 1992 .

[11]  Krista Lagus,et al.  Paginating the Generalized Newspaper - A Comparison of Simulated Annealing and a Heuristic Method , 1996, PPSN.

[12]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[13]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[14]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[15]  Daniele Vigo,et al.  Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem , 1999 .

[16]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[17]  W. Schneider.  Trim-loss minimization in a crepe-rubber mill; optimal solution versus heuristic in the 2 (3) - dimensional case , 1988 .