title: Ant colonies for the travelling salesman problem.
abstract: We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to both symmetric and asymmetric instances of the TSP. The method is an example, like simulated annealing, neural networks and evolutionary computation, of the successful use of a natural metaphor to design an optimization algorithm.
authors.affiliation: IRIDIA, Université Libre de Bruxelles, Belgium. mdorigo@ulb.ac.be
authors.forename: M
authors.initials: M
authors.lastname: Dorigo
authors.forename: L M
authors.initials: LM
authors.lastname: Gambardella
mesh_terms: D000465:Algorithms; D000818:Animals; D001000:Ants / Q000502:physiology*; D003198:Computer Simulation; D008124:Locomotion; D008954:Models, Biological; D010675:Pheromones / Q000502:physiology; D013269:Stochastic Processes
chemical_list: D010675:Pheromones