Mostra el registre d'ítem simple
Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic
dc.contributor.author | Baumgartner, Lukas |
dc.contributor.author | Schmid, Verena |
dc.contributor.author | Blum, Christian |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2012-02-22T10:21:30Z |
dc.date.available | 2012-02-22T10:21:30Z |
dc.date.created | 2011 |
dc.date.issued | 2011 |
dc.identifier.citation | Baumgartner, L.; Schmid, V.; Blum, C. Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic. "Lecture notes in computer science", 2011, vol. 6683, p. 76-90. |
dc.identifier.issn | 0302-9743 |
dc.identifier.uri | http://hdl.handle.net/2117/15300 |
dc.description.abstract | The two-dimensional bin packing problem (2BP) consists in packing a set of rectangular items into rectangular, equally-sized bins. The problem is NP-hard and has a multitude of real world applications. We consider the case where the items are oriented and guillotine cutting is free. In this paper we first present a review of well-know heuristics for the 2BP and then propose a new ILP model for the problem. Moreover, we develop a multi-start algorithm based on a probabilistic version of the LGFi heuristic from the literature. Results are compared to other well-known heuristics, using data sets provided in the literature. The obtained experimental results show that the proposed algorithm returns excellent solutions. With an average percentage deviation of 1.8% from the best know lower bounds it outperformes the other algorithms by 1.1% − 5.7%. Also for 3 of the 500 instances we tested a new upper bound was found. |
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 | Two-dimensional bin packing |
dc.subject.lcsh | Heuristic algorithms |
dc.title | Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic |
dc.type | Article |
dc.subject.lemac | Heurística |
dc.subject.lemac | Problema de bin packing |
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-25566-3_6 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 8944357 |
dc.description.version | Postprint (published version) |
local.citation.author | Baumgartner, L.; Schmid, V.; Blum, C. |
local.citation.publicationName | Lecture notes in computer science |
local.citation.volume | 6683 |
local.citation.startingPage | 76 |
local.citation.endingPage | 90 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]