期刊
COMPUTERS & OPERATIONS RESEARCH
卷 39, 期 1, 页码 64-73出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.10.022
关键词
Knapsack packing problem; Heuristic; Simulated annealing algorithm
类别
资金
- National Nature Science Foundation of China [60773126]
The rectangle knapsack packing problem is to pack a number of rectangles into a larger stock sheet such that the total value of packed rectangles is maximized. The paper first presents a fitness strategy, which is used to determine which rectangle is to be first packed into a given position. Based on this fitness strategy, a constructive heuristic algorithm is developed to generate a solution, i.e. a given sequence of rectangles for packing. Then, a greedy strategy is used to search a better solution. At last, a simulated annealing algorithm is introduced to jump out of the local optimal trap of the greedy strategy, to find a further improved solution. Computational results on 221 rectangular packing instances show that the presented algorithm outperforms some previous algorithms on average. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据