Some Aspects of Ant Systems for the TSP

  • Authors:
  • Mariusz Boryczka

  • Affiliations:
  • (Correspd.) Institute of Computer Science, University of Silesia, Sosnowiec, Poland. boryczka@us.edu.pl

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the ant systems and the application of the generative policies improving the performance of the ant systems in the context of the Travelling Salesman Problem. The generative policies are derived from the studies carried out in Germany and USA in the sixties. We study the leader (superman) and élite strategies, which have been chosen because of their analogy to the world of real ants. First, we describe three ant algorithms and we introduce a formal description of the ant system. Then we discuss the reflection of the evolutionary computing in the ant systems.