改进的蚂蚁算法在矩形优化排料中的应用  

Improved Ant Algorithm in the Rectangular Pieces Layout Optimization

作　　者：刘瑞杰[1] 李孝贵[1] 王立娟[1] 

机构地区：[1]大连科技学院信息科学系,大连116052

出　　处：《计算机与数字工程》2013年第9期1426-1428,共3页Computer & Digital Engineering

摘　　要：矩形件优化排料问题是一类具有NP完全难度的组合优化问题。将改进的蚂蚁算法应用到矩形件优化排料问题求解中,优化试验结果表明可获得比基本蚂蚁算法更好的效果,为矩形件优化排料这类NP完全问题提供了新的思路和方法。The rectangular pieces layout optimization is a NP-complete combinatorial optimization problem. The improved Ant Algo- rithm is introduced for solving the rectangular pieces layout optimization. Computational results show that the algorithm for the rectangular pieces layout optimization is better effective and practically useful than the Ant Algorithm, and a new way is offered for solving this kind of NP-complete combinatorial optimization problem.

关 键 词：矩形件 优化排料 蚂蚁算法 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]