Computer and Modernization ›› 2009, Vol. 1 ›› Issue (10): 1-3.doi: 10.3969/j.issn.10062475.2009.10.001

• 算法分析与设计 •     Next Articles

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

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