摘要
针对三维矩形布局问题,提出一种布局蚁群算法,该算法通过赋定值与随机产生2种方式给出蚂蚁的初始信息素并求得布局初始解。在迭代过程中选择不同的信息素挥发系数,使更新后的信息素值随机性更强,从而提高了算法的寻优性能。通过算例的计算并与已有文献结果进行比较,表明本文提出的算法可得到更优的布局结果。
A packing ant-colony algorithm is proposed for the 3D rectangular packing problem.The algorithm obtains initial information and packing initial solution of ants by two ways, specific values and random values. And the article takes differ- ent pheromone evaporation coefficients in the iterative process, making the random of update information values stronger, which improves the searching optimization of the algorithm.Through the calculation of some cases, it indicates that the pack- ing results are better than the existing literature by the algorithm of the article.
出处
《天津职业技术师范大学学报》
2015年第3期25-28,共4页
Journal of Tianjin University of Technology and Education
基金
天津职业技术师范大学科研发展基金资助项目(KJ14-64)
关键词
布局问题
蚁群算法
挥发系数
packing problem
ant-colony algorithm
volatile coefficient
