| 矩形件排样中基于最低水平线的改进算法 |
| |
| 引用本文： | 朱冠华. 矩形件排样中基于最低水平线的改进算法[J]. 茂名学院学报, 2006, 16(1): 28-32 |
| |
| 作者姓名： | 朱冠华 |
| |
| 作者单位： | 茂名学院学报编辑部,广东,茂名,525000 |
| |
| 摘 要： | 矩形件排样优化问题是一个多目标优化问题,一方面要考虑到材料的利用率,另一方面要考虑到生产时的下料效率,而且还要满足“一刀切”的工艺要求。在基于最低水平线的搜索算法的基础上,提出了一种新的矩形排样算法,结果证明了该算法是灵活和有效的。
|
| 关 键 词： | 矩形件排样 优化 近似算法 改进算法 |
| 文章编号： | 1671-6590（2006）01-0028-05 |
| 收稿时间： | 2005-11-19 |
| 修稿时间： | 2005-12-11 |
An Improved Algorithm for Rectangular Parts Blank Layout On The Basis of the Lowest Horizontal Line |
| |
| ZHU Guan-hua. An Improved Algorithm for Rectangular Parts Blank Layout On The Basis of the Lowest Horizontal Line[J]. Journal of Maoming College, 2006, 16(1): 28-32 |
| |
| Authors: | ZHU Guan-hua |
| |
| Abstract: | Rectangular parts blank layout optimization is a multi-objective optimization problem in which the utilization of material,the cutting efficiency,and the cutting pattern satisfying the requirement of guillotine should be taken into account.On the basis of the Lowest Horizontal Line-Search Algorithm(LHL-SA),a new algorithm for rectangular packing is proposed.The experimental results indicate that the algorithm is flexible and effective. |
| |
| Keywords: | rectangular parts blank layout optimization approximate algorithm improved algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
