| 求解矩形Packing问题的砌墙式启发式算法 |
| |
| 引用本文： | 张德富,韩水华,叶卫国.求解矩形Packing问题的砌墙式启发式算法[J].计算机学报,2008,31(3):509-515. |
| |
| 作者姓名： | 张德富 韩水华 叶卫国 |
| |
| 作者单位： | 1. 厦门大学信息科学与技术学院,福建,厦门,361005
2. 厦门大学管理科学系,福建厦门,361005 |
| |
| 基金项目： | 国家自然科学基金(60773126)，福建省自然科学基金(A0710023)，厦门大学院士启动基金(X01109)，厦门大学“九八五”信息科技基金(0000-X07204)资助 |
| |
| 摘 要： | 为求解正交矩形Packing问题提出了一个新颖而有效的砌墙式启发式算法.该算法主要基于砌墙式启发式策略,其思想主要来源于砖匠在砌墙过程中所积累的经验:基于基准砖的砌墙规则.对国际上公认的大量的Bench-mark问题例的计算结果表明,该算法的计算速度不仅比著名的现代启发式算法快,而且获得更优的高度.
|
| 关 键 词： | 正交矩形Packing问题 启发式 砌墙式规则 局部搜索 基准砖 |
| 修稿时间： | 2005年6月9日 |
A Bricklaying Heuristic Algorithm for the Orthogonal Rectangular Packing Problem |
| |
| ZHANG De-Fu,HAN Shui-Hua,YE Wei-Guo.A Bricklaying Heuristic Algorithm for the Orthogonal Rectangular Packing Problem[J].Chinese Journal of Computers,2008,31(3):509-515. |
| |
| Authors: | ZHANG De-Fu HAN Shui-Hua YE Wei-Guo |
| |
| Abstract: | A novel and effective bricklaying heuristic algorithm for two-dimensional rectangular Packing problem is presented.This algorithm is mainly based on bricklaying heuristic strategies inspired by a large number of experiences accumulated by bricklayers during the process of building the wall,especially,the building wall strategy based on the reference brick is presented.The computational results on large number of Benchmark problems have shown that this algorithm not only runs in shorter time than known meta-heuristic but also finds shorter height. |
| |
| Keywords: | the orthogonal rectangular Packing problem heuristic bricklaying rule local search reference brick |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
