Ant colony algorithm to solve TSP problems MATLAB realization Dispatched m ants, ants randomly select a path for each, denoted I = [1 2 3 · · · m], length denoted as long (I) Calculated pheromone each path, denoted as P (I) = 1/long (I), and the normalization processing Re-dispatched m ants, select the path according to the following rules: Each ant with a probability p1 choose a new path (path random) Ants do not select a new path with probability P (I) choose the path I All ants are in a small probability p2 locally on their own path to change Update all paths, each path is calculated pheromone Repeat the above steps until the remaining path.

蚁群算法实现matlab实现\程序\citydata.m
......................\....\could.m
......................\....\exchange.m
......................\....\found.m
......................\....\main.m
......................\....\unit.m
......................\....\zhh.m
......................\蚁群算法实现.doc
......................\程序
蚁群算法实现matlab实现

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