Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 38, Issue 10, Pages 1443-1451Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.12.013
Keywords
Two-dimensional bin packing; Constructive heuristic; Guillotine cut
Ask authors/readers for more resources
A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts (2DBP vertical bar*vertical bar 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. (c) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available