Advertisement

Revisiting Elitism in Ant Colony Optimization

  • Tony White
  • Simon Kaegi
  • Terri Oda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2723)

Abstract

Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling Salesman Problem and found that the use of a small number of elitist ants can improve algorithm performance. The elitist ants take advantage of global knowledge of the best tour found to date and reinforce this tour with pheromone in order to focus future searches more effectively. This paper discusses an alternative approach where only local information is used to reinforce good tours thereby enhancing the ability of the algorithm for multiprocessor or actual network implementation. In the model proposed, the ants are endowed with a memory of their best tour to date. The ants then reinforce this “local best tour” with pheromone during an iteration to mimic the search focusing of the elitist ants. The environment used to simulate this model is described and compared with Ant System.

Keywords

Heuristic Search Ant Algorithm Ant Colony Optimization Ant System Traveling Salesman Problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bonabeau E., Dorigo M., and Theraulaz G. Swarm Intelligence From Natural to Artificial Systems. Oxford University Press, New York NY, 1999.zbMATHGoogle Scholar
  2. 2.
    Dorigo M. and L.M. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1):53–66, 1997.CrossRefGoogle Scholar
  3. 3.
    Dorigo M., V. Maniezzo and A. Colorni. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29–41, 1996.CrossRefGoogle Scholar
  4. 4.
    Dumitrescu A. and Mitchell J., Approximation Algorithms for Geometric Optimization Problems, in the Proceedings of the 9th Canadian Conference on Computational Geometry, Queen’s University, Kingston, Canada, August 11–14, 1997, pp. 229–232.Google Scholar
  5. 5.
    Pilat M. and White T., Using Genetic Algorithms to optimize ACS-TSP. In Proceedings of the 3rd International Workshop on Ant Algorithms, Brussels, Belgium, September 12–14 2002.Google Scholar
  6. 6.
    Reinelt G. TSPLIB, A Traveling Salesman Problem Library. ORSA Journal on Computing, 3:376–384, 1991.zbMATHGoogle Scholar
  7. 7.
    Stützle T. and Dorigo M. ACO Algorithms for the Traveling Salesman Problem. In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, Wiley, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tony White
    • 1
  • Simon Kaegi
    • 1
  • Terri Oda
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations