|
DDC
| 004.5 | |
Nhan đề
| Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem / Marco Dorigo, Senior Member, IEEE, and Luca Maria Gambardella, Member, IEEE | |
Tóm tắt
| 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. | |
Từ khóa tự do
| Adaptive behavior | |
Từ khóa tự do
| Ant colony | |
Từ khóa tự do
| Emergent behavior | |
Từ khóa tự do
| Traveling salesman problem | |
Tác giả(bs) CN
| Gambardella, Luca Maria | |
Nguồn trích
| IEEE Transactions On Evolutionary Computation, Vol. 1, No. 1, April 1997p. 53-66 |
| |
000
| 00000nab#a2200000u##4500 |
|---|
| 001 | 50840 |
|---|
| 002 | 9 |
|---|
| 004 | BAB7C408-CA97-40C9-98F0-CB53AFF32AB3 |
|---|
| 005 | 202406141511 |
|---|
| 008 | 240614s be eng |
|---|
| 009 | 1 0 |
|---|
| 039 | |a20240614151149|btainguyendientu|y20240614145945|ztainguyendientu |
|---|
| 040 | |aACTVN |
|---|
| 041 | |aeng |
|---|
| 044 | |abe |
|---|
| 082 | |a004.5 |
|---|
| 245 | |aAnt Colony System : |bA Cooperative Learning Approach to the Traveling Salesman Problem / |cMarco Dorigo, Senior Member, IEEE, and Luca Maria Gambardella, Member, IEEE |
|---|
| 520 | |aThis 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. |
|---|
| 653 | |aAdaptive behavior |
|---|
| 653 | |aAnt colony |
|---|
| 653 | |aEmergent behavior |
|---|
| 653 | |aTraveling salesman problem |
|---|
| 700 | |aGambardella, Luca Maria |
|---|
| 773 | 0 |tIEEE Transactions On Evolutionary Computation, Vol. 1, No. 1, April 1997|gp. 53-66 |
|---|
| 890 | |a0|b0|c1|d0 |
|---|
| |
Không tìm thấy biểu ghi nào
|
|
|
|