| 基于混合演化算法的二维下料问题 |
| |
| 引用本文： | 陈盛双,胡晓林,黄樟灿.基于混合演化算法的二维下料问题[J].计算机仿真,2001,18(4):54-57. |
| |
| 作者姓名： | 陈盛双 胡晓林 黄樟灿 |
| |
| 作者单位： | 1. 武汉理工大学数理系,
2. 武汉理工大学汽车工程学院, |
| |
| 基金项目： | 国家自然科学基金资助 (编号 :70 0 710 42，6 0 0 730 43) |
| |
| 摘 要： | 介绍了将二维下料问题建模成旅行商问题的方法，指出单纯旅行商问题模型的局限性，认为其是一种启发式方法，理论上找不到全局最优解。针对于此，在原有模型的基础上引入旋转变换，提出了两种混合演化算法捆绑式深化算法和元算法。实例仿表明，该算法可以获得比普通经算法好的结果。
|
| 关 键 词： | 二维下料问题 旅行商问题 元算法 混合演化算法 组合优化 |
| 修稿时间： | 2001年4月13日 |
2-D Cutting-stock Problem Based on Hybrid Evolutionary Algorithm |
| |
| Chen Shengshuang,Hu Xiaolin,Huang Zhangcan.2-D Cutting-stock Problem Based on Hybrid Evolutionary Algorithm[J].Computer Simulation,2001,18(4):54-57. |
| |
| Authors: | Chen Shengshuang Hu Xiaolin Huang Zhangcan |
| |
| Affiliation: | Chen Shengshuang 1 Hu Xiaolin 2 Huang Zhangcan 1 |
| |
| Abstract: | The method of modeling the 2-D Cutting-stock Problem to Traveling Salesman Problem (TSP) is introduced in this paper. Because of the limitation of the pure TSP model, it is considered as a heuristic method and it cannot find the global optimal solution in theory. According to this, the rotation transformation is introduced into the original model, and two kinds of hybrid Evolutionary Algorithm, i.e. Binding Evolutionary Algorithm and Memetic Algorithm, is proposed. The simulation study shows that they can get better result than normal Evolutionary Algorithm. |
| |
| Keywords: | D cutting-stock problem Traveling salesman problem Binding evolutionary algorithm Memetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
