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.

RIS

@ARTICLE{Hemmelmayr2012,
title = {Variable neighbourhood search for the variable sized bin packing problem},
author = {Vera Hemmelmayr and Verena Schmid and Christian Blum},
year = {2012},
doi = {http://dx.doi.org/10.1016/j.cor.2011.07.003},
url = {http://www.sciencedirect.com/science/article/pii/S0305054811001961},
volume = {39},
number = {5},
language = {EN},
pages = {1097-1180},
journal = {Computers and Operations Research},
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.},
}