为了克服基本蚁群算法收敛速度慢、易于停滞的缺陷,提出了一种基于局部优化策略的蚁群算法(LO-ACA)。该算法根据TSP的特点,采用了三种局部优化算子来交换搜索路径中城市的位置,以改进解的质量。以TSP为例进行的实验结果表明,该算法优于ACA和ACAGA。
This paper proposed an ant colony algorithm based on local optimization (LOACA) to avoid the default of slow con- vergence speed and early stagnation in the basic ant colony algorithm (ACA). According to the features of TSP, it used three local optimization operations to exchange the position of cities in the search paths to gain the better solutions. Experimental re- sults for solving TSP show that the proposed algorithm performs better than ACA and ACAGA.