蚁群算法在一维下料优化问题中的应用

研究了一维下料优化问题,建立了一维下料的双目标多约束数学优化模型,并给出了求解模型的蚁群算法的具体实现过程;针对模型的特殊性,提出了零件编码和将所有下料方式首尾连接转化为蚂蚁路径的方法,并讨论了初始化参数变量的选择问题。通过一维下料实例进行验证,计算结果表明,此算法可逼近理论最优解,收敛速度较快,理论上可以解决多规格大规模的一维下料优化问题。

An Ant Colony Algorithm for One-dimensional Cutting-stock Problem

One-dimensional cutting-stock problem was studied.The mathematical model of one-dimensional cutting-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.