计算机与现代化 ›› 2009, Vol. 1 ›› Issue (10): 1-3.doi: 10.3969/j.issn.10062475.2009.10.001

• 算法分析与设计 •    下一篇

禁忌搜索算法与蚁群算法的混合策略在二次分配问题上的应用

吕聪颖,赵刚彬,王保胜   

  1. 南阳理工学院计算机科学与技术系,河南 南阳 473004
  • 收稿日期:2009-04-16 修回日期:1900-01-01 出版日期:2009-10-15 发布日期:2009-10-15

Application of Hybrid Strategy Based on Tabu Search and Ant Colony Algorithm to Quadratic Assignment Problem

LU Cong-ying,ZHAO Gang-bin,WANG Bao-sheng   

  1. Department of Computer Science and Technology, Nanyang Institute of Technology, Nanyang 473004, China
  • Received:2009-04-16 Revised:1900-01-01 Online:2009-10-15 Published:2009-10-15

摘要: 二次分配问题是一个NPhard问题,它在线路板设计、布局问题以及打字机键盘的设计等现实生活中有许多的应用。使用基本蚁群算法进行搜索时,其全局优化性能的优劣在很大程度上与蒸发系数的选择有关,若选择不合适,易使算法陷入局部最优。为此,本文提出一种新的算法,即将基本蚁群算法与禁忌搜索策略相结合来求解二次分配问题,设计出具体的算法模型,并对标准问题库中的具体实例进行测试,实验结果证实新方法的有效性。

关键词: 二次分配问题, 蚁群算法, 禁忌搜索

Abstract: Quadratic Assignment Problem(QAP) is a NPhard problem and it has numerous real life applications in, for example, school layout, circuit board designing and typewriter keyboard designing. Ant Colony Algorithm (ACA) behaves well in finding local optium, whereas its global search depends on selection of the evaporation coefficient. An unsuitable evaporation coefficient may result in local optium of final solutions. So this paper presents a new Hybrid Ant Colony Algorithm (HACA) to solve quadratic assignment problem. The results obtained show that the new approach is efficient.

Key words: Quadratic Assignment Problem, ant colony algorithm, tabu search