This is an "Ant Colony Optimization" to solve "Travelling Salesman Problems" . It's a quite Complete one which can be updated easily to adapt to lots of problems .. The Main Program is written in "AS_TSP.m" .. you can start reading this file and understand the whole part . there is a description in every part of the file. there are some small functions as DistanceMatrix which we put the distance between 2 nodes as matrixs .. and also a "Probability.m" function to choose the best Probable way ..




File list:
Ants_TSP
.......\Codes
.......\.....\AS_TSP.asv
.......\.....\AS_TSP.m
.......\.....\DistanceMatrix.m
.......\.....\Probability.m
.......\.....\randint.m
.......\.....\Tour_Cost.m