Solve TSP by MMAS
by wang h
28 Apr 2007
(Updated 30 Apr 2007)
Using MAX MIN Ant System to solve Traveling Salesman Problem.
|
Watch this File
|
| File Information |
| Description |
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 |
| MATLAB release |
MATLAB 7.2 (R2006a)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
|
Contact us at files@mathworks.com