期刊
COMPUTERS & OPERATIONS RESEARCH
卷 38, 期 10, 页码 1443-1451出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.12.013
关键词
Two-dimensional bin packing; Constructive heuristic; Guillotine cut
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据