Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Ant colony system: a cooperative learning approach to the traveling salesman problem
7.933
Zitationen
2
Autoren
1997
Jahr
Abstract
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
Ähnliche Arbeiten
Genetic algorithms in search, optimization, and machine learning
1989 · 49.281 Zit.
Particle swarm optimization
2002 · 46.674 Zit.
A fast and elitist multiobjective genetic algorithm: NSGA-II
2002 · 46.420 Zit.
Lecture Notes in Computer Science 1205
1999 · 38.695 Zit.
Statistical Learning Theory
1999 · 26.914 Zit.