Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (10): 37-39.

• 理论研究 • Previous Articles     Next Articles

Hybrid ant colony algorithm based on quadratic assignment problem

ZHANG Cui-jun,ZOU Hui,ZHANG You-hua   

  1. College of Information and Technology,Shijiazhuang University of Economics,Shijiazhuang 050031,China
  • Received:2007-09-21 Revised:2007-11-30 Online:2008-04-01 Published:2008-04-01
  • Contact: ZHANG Cui-jun

基于二次分配问题的混合蚁群算法

张翠军,邹 慧,张有华   

  1. 石家庄经济学院 信息工程学院,石家庄 050031
  • 通讯作者: 张翠军

Abstract: Quadratic assignment problem is one of the classical NP-hard problems in combinatorial optimization field.It is known for its diverse applications.Based on the analysis about quadratic assignment problem,a hybrid ant colony algorithm for solving it is designed.It adopts 2-interchange mutation operator in ant colony algorithm to increase its ability of local search and to improve the quality of the solution.The experiment results show that the algorithm is superior to ant colony algorithm and genetic algorithm in solving quadratic assignment problem.

Key words: quadratic assignment problem, NP-hard problem, hybrid ant colony algorithm, 2-interchange mutation operator, local search

摘要: 二次分配问题是组合优化领域中经典的NP-hard问题之一,应用广泛。在对二次分配问题进行分析的基础上,提出了一种求解该问题的混合蚁群算法。该算法通过在蚁群算法中引入遗传算法的2-交换变异算子,增强了算法的局部搜索能力,提高了解的质量。实验结果表明,该算法在求解二次分配问题时优于蚁群算法和遗传算法。

关键词: 二次分配问题, NP-hard问题, 混合蚁群算法, 2-交换变异算子, 局部搜索