Heuristics for the variable sized bin-packing problem
Type :
Article
Publication Status :
published
Access :
restrictedAccess
Abstract
We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this problem are presented and compared. We analyze their empirical performance on a large set of randomly generated test instances with up to 2000 items and seven bin types. The first contribution of this paper is to provide evidence that a set covering heuristic proves to be highly effective and capable of delivering very-high quality solutions within short CPU times. In addition, we found that a simple subset-sum problem-based heuristic consistently outperforms heuristics from the literature while requir- ing extremely short CPU times.
Source :
Computers & Operations Research
Date :
2009-10
Volume :
36
Issue :
10
Publisher :
Elsevier
URI
http://hdl.handle.net/10679/189http://www.sciencedirect.com/science/article/pii/S0305054808002748
Collections
Share this page