摘要
研究了一维下料优化问题,建立了一维下料的双目标多约束数学优化模型,并给出了求解模型的蚁群算法的具体实现过程;针对模型的特殊性,提出了零件编码和将所有下料方式首尾连接转化为蚂蚁路径的方法,并讨论了初始化参数变量的选择问题。通过一维下料实例进行验证,计算结果表明,此算法可逼近理论最优解,收敛速度较快,理论上可以解决多规格大规模的一维下料优化问题。
One-dimensional cutting-stock problem was studied. The mathematical model of one-dimensional cutring-stock problem for bi-objective and multi-constraints is set up. To solve the model, an ant colony algorithm is developed. In this algorithm, accessory chromosome and the cutting-stock is transformed into an ant path. How to select the initial parameters is discussed. Then, the algorithm is applied to a one-dimensional cutting-stock problem. Computed results indicate that the ant colony algorithm can approach the theoretical optimal solution, and its astringency is good.
出处
《机械科学与技术》
CSCD
北大核心
2008年第12期1681-1684,共4页
Mechanical Science and Technology for Aerospace Engineering
关键词
一维下料
蚁群算法
优化
one-dimensional cutting-stock
ant colony algorithm
optimization
