Solve TSP by MMAS

Using MAX MIN Ant System to solve Traveling Salesman Problem.

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. [e-mail]