Solve TSP by MMAS

Version 1.0.0.0 (47.4 KB) by wang h
Using MAX MIN Ant System to solve Traveling Salesman Problem.
1.8
(10)
5.4K Downloads
Updated 30 Apr 2007

No License

MAX-MIN Ant System was supposed to work better than AS and ACS.In this M-file, MMAS Algorithm is implemented, it can be easily used as following command to see the playing iterative course.
ACO('filename.tsp');
here filename.tsp is the problem file of the Symmetrical or Asymmetrical TSP problem which you can download from the following site: http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp/index.html
Plealse make me known if you want to use it commercially. codstar@126.com

Cite As

wang h (2024). Solve TSP by MMAS (https://www.mathworks.com/matlabcentral/fileexchange/14822-solve-tsp-by-mmas), 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
1.0.0.0