« Previous AbstractAn evaluation of western bean cutworm pheromone trapping techniques (Lepidoptera: Noctuidae) in a corn and soybean agroecosystem    Next AbstractNon-volatile extractable analysis of prefilled syringes for parenteral administration of drug products »

Biosystems

Title:		Ant colonies for the travelling salesman problem
Author(s):		Dorigo M; Gambardella LM;
Address:		"IRIDIA, Universite Libre de Bruxelles, Belgium. mdorigo@ulb.ac.be"
Journal Title:		Biosystems
Year:		1997
Volume:		43
Issue:		2
Page Number:		73 - 81
DOI:		10.1016/s0303-2647(97)01708-5
ISSN/ISBN:		0303-2647 (Print) 0303-2647 (Linking)
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"
Keywords:		"Algorithms Animals Ants/*physiology Computer Simulation Locomotion *Models, Biological Pheromones/physiology Stochastic Processes;"
Notes:		"MedlineDorigo, M Gambardella, L M eng Comparative Study Research Support, Non-U.S. Gov't Ireland 1997/01/01 Biosystems. 1997; 43(2):73-81. doi: 10.1016/s0303-2647(97)01708-5"