Solving the two-dimensional bin-packing problem with variable bin sizes by greedy randomized adaptive search procedures and variable neighborhood search

Authors:
Andreas M. Chwatal;Sandro Pirkwieser
Affiliations:
Destion --- IT Consulting OG, Vienna, Austria;Destion --- IT Consulting OG, Vienna, Austria
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Year:
2011

Citing 5
Cited 0

Variable neighborhood search

Computers and Operations Research
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present new metaheuristic algorithms to a special variant of the two-dimensional bin-packing, or cutting-stock problem, where a given set of rectangular items (demand) must be produced out of heterogeneous stock items (bins). The items can optionally be rotated, guillotine-cuttable and free layouts are considered. The proposed algorithms use various packing-heuristics which are embedded in a greedy randomized adaptive search procedure (GRASP) and variable neighborhood search (VNS) framework. Our results for existing benchmark-instances show the superior performance of our algorithms, in particular the VNS, with respect to previous approaches.