Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Hybrid algorithms for the variable sized bin packing problem

Autor
Blum, C.; Hemmelmayr, V.; Pibernat, H.H; Schmid, V.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2010-10
Número
6373
Pàgina inicial
16
Pàgina final
30
DOI
https://doi.org/10.1007/978-3-642-16054-7_2 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/11412 Obrir en finestra nova
Resum
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 neighborho...
Citació
Blum, C. [et al.]. Hybrid algorithms for the variable sized bin packing problem. "Lecture notes in computer science", Octubre 2010, núm. 6373, p. 16-30.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

  • Blum, Christian Clemens  (autor)
  • Hemmelmayr, Vera C.  (autor)
  • Pibernat, Heranandez Hugo  (autor)
  • Schmid, Verena  (autor)