期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 5, 页码 1608-1614出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.03.004
关键词
Rectangular packing; Knapsack problem; Heuristic; Local search
类别
资金
- National Nature Science Foundation of China [60773126]
- Province Nature Science Foundation of Fujian [A0710023]
- academician start-up fund [X01109]
- 985 information technology fund in Xiamen University [0000-X07204]
The rectangular packing problem is to pack a number of rectangles into a single large rectangular sheet so as to maximize the total area covered by the rectangles packed. The paper first presents a least wasted first strategy which evaluates the positions used by the rectangles. Then a random local search is introduced to improve the results and a least wasted first heuristic algorithm (LWF) is further developed to find a desirable solution. Twenty-one rectangular-packing instances are tested by the algorithm developed, the experimental results show that the presented algorithm can achieve an optimal solution within reasonable time and is fairly efficient for dealing the rectangular packing problem. LWF still performs well when it is extended to solve zero-waste and non-zero-waste strip packing instances. (c) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据