Description: Based on the TSP solution of ant colony algorithm, ant colony algorithm and hybrid algorithm of ant colony algorithm particle swarm optimization are used to solve the TSP, and different fitness functions of crossover and mutation are used to update the particles, so as to achieve the optimal solution of TSP, which is closer to the actual problem.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| ca_tsp.m | 152 | 2013-10-19
|
| cross_tsp_a.m | 377 | 2013-10-19
|
| cross_tsp_b.m | 425 | 2013-10-19
|
| cross_tsp_c.m | 443 | 2013-10-19
|
| cross_tsp_d.m | 446 | 2013-10-19
|
| mutation_a.m | 139 | 2013-10-19
|
| mutation_b.m | 195 | 2013-10-19
|
| mutation_c.m | 206 | 2013-10-19
|
| mutation_d.m | 265 | 2013-10-19
|
| y19_1.m | 2575 | 2013-10-19
|
| y19_2.m | 3975 | 2013-10-19 |
Download