File Exchange

image thumbnail

Ant Colony Optimization Techniques applied on Travelling Salesman Problem

version (5.92 KB) by Hamid Behravan
This program applies the typical ant colony optimization technique on TSP problem.


Updated 03 May 2012

View License

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.

Comments and Ratings (3)


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.

Ayman Esmat


Change to Probability Selection

MATLAB Release Compatibility
Created with R2008b
Compatible with any release
Platform Compatibility
Windows macOS Linux