Multiple Nests´ Cooperation ACO Based Union-Intersection Operations

On the base of researches on Max-Min Ant System (MMAS), a new algorithm named multiple nestspsila cooperation ACO based Union-Intersection operations (UI-MNCACO) is proposed to resolve the narrow Traveling Salesman Problem (TSP). In UI-MNCACO, we find out the edges contained in the shortest Hamiltonian circuit by the cooperation of elitist ants, the cooperation is completed by the union and intersection operations. Our experimental results clearly show that UI-MNCACO has a faster convergence than MMAS and its solution quality is better.