Solving Symmetrical and DisSymmetrical TSP base on Ant Colony Algorithm

Version (28.2 KB) by wang h
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem
Updated 27 Apr 2007

No License

Editor's Note: This file was a File Exchange Pick of the Week

In this M-file, the implementation of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the playing iterative course.
filename.tsp is the problem file of the Symmetrical or Asymmetrical TSP problem which you can download from the following site:
As there is several type of ACO algorithm, the basic one Ant System(AS) is given, which is original. For more problems or other ACO algorithms, you can contact me by the email plealse make me known if you want to use it commercially.
And many thanks for Doug Hull's advice!

Cite As

wang h (2024). Solving Symmetrical and DisSymmetrical TSP base on Ant Colony Algorithm (, MATLAB Central File Exchange. Retrieved .

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

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!


Version Published Release Notes

The code was updated to play the iterative course so the audience can understand ACO easily, and some errors in the commentary were correct!