关键词: 改进蚁群算法, 二次分配问题, 全局, 顶点重定位

Abstract: In order to solve the problems that the basic ant colony algorithm for solving large scale quadratic assignment has revealed defects, this paper proposes an improved ant colony algorithm. This algorithm adopts the global pheromone update strategy, the use of distance and traffic as heuristic information and the introduction of local optimization strategy. The optimal solution for each generation is to improve and further accelerate the convergence speed. For the quadratic assignment problem through three different types of problems, and improved ant colony algorithm with the basic ant algorithm and the hybrid genetic algorithm are compared, the experiments show that the improved method has better performance.

Key words: improved ant colony algorithm, quadratic assignment problem, global, vertex relocation