Paper Info
Title
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
Abstract
A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts (2DBP|@?|G) is presented. The heuristic constructs a solution by packing a bin at a time. Central to the adopted solution scheme is the principle of average-area sufficiency proposed by the authors for guiding selection of items to fill a bin. The algorithm is tested on a set of standard benchmark problem instances and compared with existing heuristics producing the best-known results. The results presented attest to the efficacy of the proposed scheme.
Year
DOI
Venue
2011
10.1016/j.cor.2010.12.013
Computers & OR
Keywords
DocType
Volume
constructive bin-oriented heuristic,guiding selection,two-dimensional bin-packing problem,Guillotine cut,two-dimensional bin packing problem,Two-dimensional bin packing,average-area sufficiency,new heuristic algorithm,solution scheme,Constructive heuristic,best-known result,proposed scheme,standard benchmark problem instance,guillotine cut
Journal
38
Issue
ISSN
Citations 
10
Computers and Operations Research
15
PageRank 
References 
Authors
0.71
8
2
Name
Order
Citations
PageRank
Christoforos Charalambous1504.35
Krzysztof Fleszar236825.38