Dòng Nội dung
1
Ant colonies for the traveling salesman problem / Marco Dorigo, Luca Maria Gambardella // TR/IRIDIA/1996-3. - Belgium. - . - ISSN:



Ký hiệu phân loại (DDC): 004
We describe an artificial ant colony capable of solving the traveling 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.
 Số bản sách: (0) Tài liệu số: (1)
2
Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem / Marco Dorigo, Senior Member, IEEE, and Luca Maria Gambardella, Member, IEEE // IEEE Transactions On Evolutionary Computation, Vol. 1, No. 1, April 1997. - . - p. 53-66. - ISSN:



Ký hiệu phân loại (DDC): 004.5
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 TSP’s. 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 TSP’s.
 Số bản sách: (0) Tài liệu số: (1)