Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Variable neighbourhood search for the variable sized bin packing problem

Autor
Hemmelmayr, V.; Schmid, V.; Blum, C.
Tipus d'activitat
Article en revista
Revista
Computers & operations research
Data de publicació
2012-05
Volum
39
Número
5
Pàgina inicial
1097
Pàgina final
1108
DOI
https://doi.org/10.1016/j.cor.2011.07.003 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/13560 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0305054811001961 Obrir en finestra nova
Resum
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 metahe...
Citació
Hemmelmayr, V.; Schmid, V.; Blum, C. Variable neighbourhood search for the variable sized bin packing problem. "Computers & operations research", Maig 2012, vol. 39, núm. 5, p. 1097-1108.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants