Show simple item record

dc.contributor.authorHemmelmayr, Vera C.
dc.contributor.authorSchmid, Verena
dc.contributor.authorBlum, Christian
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationHemmelmayr, 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.
dc.description.abstractThe 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.
dc.format.extent12 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshVariable sized bin packing
dc.subject.lcshVariable neighbourhood search
dc.subject.lcshHybrid algorithms
dc.subject.lcshBin packing problem
dc.subject.lcshMathematical optimization
dc.titleVariable neighbourhood search for the variable sized bin packing problem
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.description.peerreviewedPeer Reviewed
dc.rights.accessRestricted access - publisher's policy
dc.description.versionPostprint (published version)
local.citation.authorHemmelmayr, V.; Schmid, V.; Blum, C.
local.citation.publicationNameComputers & operations research

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder