The selection route which each ant will select is based on maximum probability criteria, and the amount pheromone remains on each route between two cities.
Hamid Behravan (2021). Ant Colony Optimization Techniques applied on Travelling Salesman Problem (https://www.mathworks.com/matlabcentral/fileexchange/35506-ant-colony-optimization-techniques-applied-on-travelling-salesman-problem), MATLAB Central File Exchange. Retrieved .
This is a script with no comments on how to use it.
The file AS_TSP.m clears all variables (!) and then calls the file DistanceMatrix.m which contains a graph. It makes use of the function randint (from Communications Toolbox?).
I think the author should consider to rewrite it as it might be actually useful but it's not very usable in the current version.
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!