Description: In this paper, the basic theory of ant colony algorithm and its application in TSP are studied systematically and simulated by MATLAB. This paper introduces the basic principle, characteristics and implementation of ant colony algorithm. The basic ant colony algorithm is not very good because of its long search time and easy to fall into the local optimal solution. Aiming at these defects, an improved ant colony algorithm (maximum minimum ant system) is proposed to solve TSP. The main improvements are to limit the concentration of pheromone, the initial value of pheromone and to emphasize the utilization of the optimal solution.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 蚁群算法\aca.m | 5666 | 2018-12-25
|
| 蚁群算法\acaimprove.m | 6805 | 2018-12-21
|
| 蚁群算法\acatxfg.m | 3518 | 2018-12-25
|
| 蚁群算法 | 0 | 2019-12-25 |
Download