Using local information to guide ant based search

  • Authors:
  • Simon Kaegi;Tony White

  • Affiliations:
  • School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada

  • Venue:
  • IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 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. Results are compared with Ant System.