Mostra el registre d'ítem simple
Hybrid algorithms for the variable sized bin packing problem
dc.contributor.author | Blum, Christian |
dc.contributor.author | Hemmelmayr, Vera C. |
dc.contributor.author | Hernández Pibernat, Hugo |
dc.contributor.author | Schmid, Verena |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2011-02-16T13:13:13Z |
dc.date.available | 2011-02-16T13:13:13Z |
dc.date.created | 2010-10 |
dc.date.issued | 2010-10 |
dc.identifier.citation | 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. |
dc.identifier.issn | 0302-9743 |
dc.identifier.uri | http://hdl.handle.net/2117/11412 |
dc.description.abstract | 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 neighborhoods are also based on dynamic programming. The best results are obtained by using the solutions provided by the proposed heuristic as starting solutions for variable neighborhood search. The results show that this algorithm is very competitive with current state-of-the-art approaches. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Mathematical optimization |
dc.subject.lcsh | Bin packing problem |
dc.subject.lcsh | Hybrid algotihm |
dc.title | Hybrid algorithms for the variable sized bin packing problem |
dc.type | Article |
dc.subject.lemac | Optimització matemàtica |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1007/978-3-642-16054-7_2 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 4999026 |
dc.description.version | Postprint (published version) |
local.citation.author | Blum, C.; Hemmelmayr, V.; Hernández, H.; Schmid, V. |
local.citation.publicationName | Lecture notes in computer science |
local.citation.number | 6373 |
local.citation.startingPage | 16 |
local.citation.endingPage | 30 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]