Dorigo, Marco and Gambardella, Luca Maria (1997) Ant colonies for the travelling salesman problem. Biosystems, Volume 43, Issue 2, Pages 73-81. ISSN 0303-2647
Full text not available from this repository.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.
| Item Type: | Scientific journal article, Newspaper article or Magazine article |
|---|---|
| Subjects: | Computer sciences > Artificial intelligence |
| Department/unit: | Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI |
| Depositing User: | Alessia Gianinazzi |
| Date Deposited: | 18 Apr 2023 04:17 |
| Last Modified: | 18 Apr 2023 04:18 |
| URI: | http://repository.supsi.ch/id/eprint/13999 |
Actions (login required)
 |
View Item |