Searching the optimal solution and determining parameters of TSP based on MMAS

In order to solve such NP-Hard problems as the traveling salesman problem (TSP), we analyze the TSP and build modeling in Max-Min Ant System (MMAS). As the parameters in MMAS have a significant impact on the TSP optimal value, we make sure the optimal parameters through taking and debugging a large number of computer simulation experiments on the parameters in MMAS. At a result, we require the global optimal Chinese TSP path length is 15653 km. The global optimal path length keeps stable to one value without any fluctuation caused by different simulation experiments, and the computing time also can be totally accepted.