| 矩形件排样优化贪婪算法及系统开发 |
| |
| 引用本文： | 宋连超,朱建良,张彤.矩形件排样优化贪婪算法及系统开发[J].哈尔滨理工大学学报,2007,12(1):29-31,35. |
| |
| 作者姓名： | 宋连超 朱建良 张彤 |
| |
| 作者单位： | 1. 哈尔滨理工大学,电气与电子工程学院,黑龙江,哈尔滨,150040
2. 哈尔滨工业大学,国家大学科技园,黑龙江,哈尔滨,150001 |
| |
| 摘 要： | 针对矩形件排样优化问题,分析了传统近似算法的主要缺陷,在此基础上,提出一种新的排样算法——贪婪算法.该算法的主要思想是在每次排样过程中,都用面积最大的矩形件对板材进行填充.同时,开发了一个矩形件排样优化系统.实际排样结果表明,贪婪算法能够获得比近似算法更有效的排样结果.
|
| 关 键 词： | 矩形件排样优化 近似算法 贪婪算法 |
| 文章编号： | 1007-2683（2007）01-0029-03 |
| 修稿时间： | 2006-03-18 |
Research and Development on the Greedy Algorithm and System of the Rectangular Cutting Stock Problem |
| |
| SONG Lian-chao,ZHU Jian-liang,ZHANG Tong.Research and Development on the Greedy Algorithm and System of the Rectangular Cutting Stock Problem[J].Journal of Harbin University of Science and Technology,2007,12(1):29-31,35. |
| |
| Authors: | SONG Lian-chao ZHU Jian-liang ZHANG Tong |
| |
| Abstract: | To resolve the rectangular cutting stock problem,this paper proposes a new greedy algorithm,based on analyzing the main disadvantage of the traditional approximate algorithm.The main idea of the greedy algorithm is to allocate the plate with the max-area rectangular every time.At the same time,this paper develops a system for the rectangular cutting stock problem.The experimental results show that the greedy algorithm can get a more effective layout result than approximate algorithm. |
| |
| Keywords: | the rectangular cutting stock problem approximate algorithm greedy algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
