摘要
采用一种新算法动态自适应蚁群算法解决二次分配问题,并引入3-opt方法对问题求解进行局部优化,通过对二次分配问题的不同实例进行实验,结果表明,该算法在求解二次分配问题上具有较好的能力,可以很好地解决较大规模的二次分配问题,而以往的算法只适合于处理较小规模的二次分配问题.
We uses a dynamic and adaptive ant algorithm to solve the quadratic assignment problem (QAP), and presented a 3-opt algorithm to the problem for the local optimization of the solution. The results from the experiments on different QAP instances show that this algorithm is able to find good solutions quickly. Especially, the algorithm is able to solve the large QAP instance preferably, but the ancient algorithm is only able to solve the small QAP instances.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2005年第4期477-480,共4页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:60433020)
教育部重点项目基金(批准号:02090).
关键词
动态自适应
蚁群算法
二次分配问题
<Keyword>dynamic adaptive
ant algorithm
quadratic assignment problem
