Study on hybrid PS-ACO algorithm
- First Online:
- 250 Downloads
Ant colony optimization (ACO) algorithm is a recent meta-heuristic method inspired by the behavior of real ant colonies. The algorithm uses parallel computation mechanism and performs strong robustness, but it faces the limitations of stagnation and premature convergence. In this paper, a hybrid PS-ACO algorithm, ACO algorithm modified by particle swarm optimization (PSO) algorithm, is presented. The pheromone updating rules of ACO are combined with the local and global search mechanisms of PSO. On one hand, the search space is expanded by the local exploration; on the other hand, the search process is directed by the global experience. The local and global search mechanisms are combined stochastically to balance the exploration and the exploitation, so that the search efficiency can be improved. The convergence analysis and parameters selection are given through simulations on traveling salesman problems (TSP). The results show that the hybrid PS-ACO algorithm has better convergence performance than genetic algorithm (GA), ACO and MMAS under the condition of limited evolution iterations.
KeywordsAnt colony optimization Particle swarm optimization Hybrid PS-ACO TSP
Unable to display preview. Download preview PDF.
- 1.Maniezzo V, Carbonaro A (2001) Ant colony optimization: an overview, essays and surveys in metaheuristics. Kluwer, Dordrecht, 21–44 Google Scholar
- 8.Zwann S, Marques C (1999) Ant colony optimization for Job Shop scheduling. In: Proceedings of the third workshop on genetic algorithms and artificial life (GAAL 99) Google Scholar
- 10.Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE conference neural networks, vol. IV, Piscataway, NJ, pp 1942–1948 Google Scholar
- 11.Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of 1998 IEEE international conference on evolutionary computation, Anchorage, AK, pp 69-73 Google Scholar
- 12.Russell C, Eberhart, Shi YH (1998) In: Comparison between genetic algorithms and particle swarm optimization. Lecture notes in computer science, vol 1447. Springer, Berlin, pp 611–616 Google Scholar