基于图形的加权蚁群算法

Weighted ant colony algorithm based on graph

针对蚁群算法在开始的时候由于信息素较少导致收敛速度慢的问题,提出了基于图形的加权蚁群算法,利用蚁群算法最优路径的特点,对每个城市分别加权,从比较离散的点开始进行寻优,节省了在不可能构成最优路径上的计算时间,提高了运算速度。通过TSP问题检验的结果表明,新算法提高了标准蚁群算法的效率和计算结果的质量。

In view of the problem that ant colony algorithm needs longer computing time because of shortage of pheromone,this paper proposes a weighted ant colony algorithm based on graph. Using the character of the best route, it weights for every cities and then from the discrete cities searches for best route. New algorithm improves the searching strategy and consequently saves the computational time on the paths that can not be on the best route. It significantly improves the basic ant colony algorithm by accelerating the convergence speed and improves the precision. Simulation on its test in TSP problem proves that the new algorithm improves both the efficiency and the quality of results of the standard ant colony algorithm.