| Ant-Q算法在矩形件优化排料中的应用 |
| |
| 引用本文： | 须文波,刘瑞杰. Ant-Q算法在矩形件优化排料中的应用[J]. 江南大学学报(自然科学版), 2006, 5(3): 270-273 |
| |
| 作者姓名： | 须文波 刘瑞杰 |
| |
| 作者单位： | 江南大学,信息工程学院,江苏,无锡,214122 |
| |
| 摘 要： | 矩形件优化排料问题是一类具有NP完全难度的组合优化问题,该优化问题可用与或树描述,即把矩形件优化排料问题变换为寻找一棵面积比率最大的二叉树问题.使用Ant-Q算法能够有效实现这种树搜索,从而求得矩形件优化排料问题的优化解.
|
| 关 键 词： | 矩形件优化排料 Ant-Q算法 树搜索 |
| 文章编号： | 1671-7147（2006）03-0270-04 |
| 收稿时间： | 2004-12-09 |
| 修稿时间： | 2005-01-13 |
The Ant-Q Algorithm Applied to the Optimal Layout of Rectangular Part |
| |
| XU Wen-bo,LIU Rui-jie. The Ant-Q Algorithm Applied to the Optimal Layout of Rectangular Part[J]. Journal of Southern Yangtze University:Natural Science Edition, 2006, 5(3): 270-273 |
| |
| Authors: | XU Wen-bo LIU Rui-jie |
| |
| Affiliation: | School of Information Technology , Southern Yangtze University ,Wuxi 214122,China |
| |
| Abstract: | The optimal layout for rectangular part is a NP-complete combinatorial optimization problem.This optimal problem is represented by an AND/OR tree.Therefore,its optimal objective becomes to find the binary tree whose ratio of the area is maximum.The Ant-Q algorithm can effectively implement this kind of tree search,and then the optimal solution of the rectangular part optimal layout will be obtained. |
| |
| Keywords: | rectangular parts optimal layout Ant-Q algorithm tree search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
