Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/26830

TitleSequence based heuristics for two-dimensional bin packing problems
Author(s)Alvelos, Filipe Pereira e
Chan, Tak Ming
Vilaça, Paulo
Gomes, Tiago Manuel Ribeiro
Silva, Elsa
Carvalho, J. M. Valério de
KeywordsCutting and packing
Guillotine constraints
Greedy heuristics
Local search
variable neighbourhood descent
Issue date2009
PublisherTaylor & Francis
JournalEngineering Optimization
CitationF.Alvelos, T. M. Chan, P. Vilaça, T. Gomes, E. Silva, J. M. Valério de Carvalho, Sequence based Heuristics for Two-dimensional Bin Packing Problems, Engineering Optimization, Vol. 41 (8), 2009, 773-791.
Abstract(s)This article addresses several variants of the two-dimensional bin packing problem. In the most basic version of the problem it is intended to pack a given number of rectangular items with given sizes in rectangular bins in such a way that the number of bins used is minimized. Different heuristic approaches (greedy, local search, and variable neighbourhood descent) are proposed for solving four guillotine two-dimensional bin packing problems. The heuristics are based on the definition of a packing sequence for items and in a set of criteria for packing one item in a current partial solution. Several extensions are introduced to deal with issues pointed out by two furniture companies. Extensive computational results on instances from the literature and from the two furniture companies are reported and compared with optimal solutions, solutions from other five (meta)heuristics and, for a small set of instances, with the ones used in the companies.
TypeArticle
URIhttp://hdl.handle.net/1822/26830
DOI10.1080/03052150902835960
ISSN0305-215X
1029-0273
Peer-Reviewedyes
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Artigos em revistas internacionais/Papers in international journals

Files in This Item:
File Description SizeFormat 
03 Sequence based heuristics for two-dimensional bin packing problems.pdf
  Restricted access
308,35 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID