ACO with multiple nests’ cooperation and its application on narrow TSP

On the base of researches on max-min ant system, a new algorithm named ant colony optimization with multiple nestspsila cooperation (MNC-ACO) is proposed to resolve the narrow traveling salesman problem. In MNC-ACO, we find out the edges contained in the shortest Hamiltonian circuit by the cooperation of elitist ants. Our experimental results clearly show that MNC-ACO has a faster convergence than max-min ant system and its solution quality is better.