摘要
矩形件优化排料问题是一类具有NP完全难度的组合优化问题,该优化问题可用与或树描述,即把矩形件优化排料问题变换为寻找一棵面积比率最大的二叉树问题.使用Ant-Q算法能够有效实现这种树搜索,从而求得矩形件优化排料问题的优化解.
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.
出处
《江南大学学报(自然科学版)》
CAS
2006年第3期270-273,共4页
Joural of Jiangnan University (Natural Science Edition)