| 摘要: |
| 为求解二维矩形条带装箱问题,提出了一种新颖而有效的启发式算法.算法主要包括矩形装载适应度的计算规则和树型迭代搜索规则,通过选择最高适应度的矩形来装载空间.对大量国际上公认的 Benchmark 问题实例的计算结果表明,相对于当前的很多著名算法,提出的算法更加有效. |
| 关键词: 树型迭代 二维装箱问题 启发式算法 适应度 |
| DOI：10.3724/SP.J.1001.2012.04187 |
| 分类号: |
| 基金项目:国家自然科学基金(70771034, 71131003); 国家教育部人文社科基金(12YJC630148); 广东省自然科学基金(S2011010005503); 广州市科技计划基金(7421159402737) |
|
| Recursive Heuristic Algorithm for the 2D Rectangular Strip Packing Problem |
|
PENG Bi-Tao1,2, ZHOU Yong-Wu2
|
|
1.Cisco School of Informatics, Guangdong University of Foreign Studies, Guangzhou 510006, China;2.School of Business Administration, South China University of Technology, Guangzhou 510641, China
|
| Abstract: |
| The paper presents a novel and effective heuristic algorithm for the two-dimensional rectangular strippacking problem. This algorithm is mainly based on the bestfit value and tree recursive search rules and selects themaximal fitness rectangle to the packing the space. The computational results on a large number of Benchmarkproblems have shown that this algorithm is more effective than the existing novel algorithm. |
| Key words: tree recursive 2D packing problem heuristic algorithm fitness |
