Hemmelmayr, Vera, Schmid, Verena, Blum, Christian. 2012. Variable neighbourhood search for the variable sized bin packing problem. Computers and Operations Research 39 (5), 1097-1180.
BibTeX
Abstract
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing problem. Given is a set of weighted items, which must be packed into a minimum-cost set of bins of variable sizes and costs. This problem has practical applications, for example, in packing, transportation planning, and cutting. In this work we propose a variable neighbourhood search metaheuristic for tackling the variable sized bin packing problem. The presented algorithm can be seen as a hybrid metaheuristic, because it makes use of lower bounding techniques and dynamic programming in various algorithmic components. An extensive experimentation on a diverse set of problem instances shows that the proposed algorithm is very competitive with current state-of-the-art approaches.
Tags
Press 'enter' for creating the tagPublication's profile
Status of publication | Published |
---|---|
Affiliation | WU |
Type of publication | Journal article |
Journal | Computers and Operations Research |
Citation Index | SCI |
WU Journalrating 2009 | A |
WU-Journal-Rating new | FIN-A, INF-A, STRAT-B, WH-B |
Language | English |
Title | Variable neighbourhood search for the variable sized bin packing problem |
Volume | 39 |
Number | 5 |
Year | 2012 |
Page from | 1097 |
Page to | 1180 |
Reviewed? | Y |
URL | http://www.sciencedirect.com/science/article/pii/S0305054811001961 |
DOI | http://dx.doi.org/10.1016/j.cor.2011.07.003 |
Associations
- People
- Hemmelmayr, Vera (Details)
- External
- Blum, Christian
- Schmid, Verena
- Organization
- Institute for Transport and Logistics Management (Details)