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.

Filename	Size	Update
蚁群算法\aca.m	5666	2018-12-25
蚁群算法\acaimprove.m	6805	2018-12-21
蚁群算法\acatxfg.m	3518	2018-12-25
蚁群算法	0	2019-12-25

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．