J4

• 计算机科学 • 上一篇    下一篇

动态自适应蚁群算法在二次分配问题中的应用

吕聪颖, 于哲舟, 周春光, 王康平, 庞 巍   

  1. 吉林大学计算机科学与技术学院, 长春 130012
  • 收稿日期:2005-01-04 修回日期:1900-01-01 出版日期:2005-07-26
  • 通讯作者: 周春光

A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems

LÜ Cong-ying, YU Zhe-zhou, ZHOU Chun-guang, WANG Kang-ping, PANG Wei   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2005-01-04 Revised:1900-01-01 Online:2005-07-26
  • Contact: ZHOU Chun-guang

摘要: 采用一种新算法--动态自适应蚁群算法解决二次 分配问题, 并引入3-opt方法对问题求解进行局部优化, 通过对二次分配问题的不同实例进 行实验, 结果表明, 该算法在求解二次分配问题上具有较好的能力, 可以很好地解决较大规 模的二次分配问题, 而以往的算法只适合于处理较小规模的二次分配问题.

关键词: 动态自适应, 蚁群算法, 二次分配问题

Abstract: We uses a dynamic and adaptive ant algorithm to solve the quadratic as signment problem (QAP), and presented a 3-opt algorithm to the problem for the local optimization of the solution. The results from the ex periments on different QAP instances show that this algorithm is able to find go od solutions quickly. Especially, the a lgorithm is able to solve the large QAP instance preferably, but the ancient alg orithm is only able to solve the small QAP instances.

Key words: dynamic adaptive, ant algorithm, quadratic assignment problem

中图分类号: 

  • TP31