Hybrid algorithms for the variable sized bin packing problem

Authors:
Christian Blum;Vera Hemmelmayr;Hugo Hernández;Verena Schmid
Affiliations:
ALBCOM Research Group, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Business Administration, Universität Wien, Vienna, Austria;ALBCOM Research Group, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Business Administration, Universität Wien, Vienna, Austria
Venue:
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Year:
2010

Citing 5
Cited 1

Variable sized bin packing

SIAM Journal on Computing
Variable neighborhood search

Computers and Operations Research
Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms

SIAM Journal on Computing
Heuristics for the variable sized bin-packing problem

Computers and Operations Research
Relaxations and exact solution of the variable sized bin packing problem

Computational Optimization and Applications

Variable neighbourhood search for the variable sized bin packing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the so-called variable sized bin packing problem, which is a generalization of the one-dimensional bin packing problem in which a set of items with given weights have to be packed into a minimum-cost set of bins of variable sizes and costs. First we propose a heuristic and a beam search approach. Both algorithms are strongly based on dynamic programming procedures and lower bounding techniques. Second, we propose a variable neighborhood search approach where some neighborhoods are also based on dynamic programming. The best results are obtained by using the solutions provided by the proposed heuristic as starting solutions for variable neighborhood search. The results show that this algorithm is very competitive with current state-of-the-art approaches.