telligent algorithm for solving single traveling salesman problem, ant colony algorithm. By inputting the weight vector between cities (the distance between cities), the minimum Hamiltonian ring of all cities and the shortest total distance can be output.

蚁群算法\ACA.m
蚁群算法\Chap9_citys_data.xlsx
蚁群算法

• 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．