An Improvement of the Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem (TSP)
暂无分享,去创建一个
The ant colony optimization algorithm usually falls into local optimal solution and can not select the path with high pheromone concentration quickly in solving the TSP. According to this, in this paper an improved MAX-MIN Ant System (MMAS) algorithm based on pheromone concentration reinitialization is proposed to overcome the shortcoming above. The simulation results show that the improved algorithm can obtain the optimal solution of TSP, and speed up convergence.
[1] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[2] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[3] Daniela Favaretto,et al. On MAX - MIN Ant System's Parameters , 2006, ANTS Workshop.