Research on ACO with multiple nests’ cooperation for narrow TSP

A new algorithm named ant colony optimization with multiple nestspsila cooperation (MNACO) is presented to resolve the narrow traveling salesman problem. The union suppose and intersection suppose based on MNACO are proposed. The black, white and grey edges are defined. The edges in the intersection (black edges) are deposited certain pheromones. The white edges are deleted and the grey edges in the union could be taken as the solution space for its following process. Experimental results show MNACO has better convergence on larger traveling salesman problems and is more efficient than the famous max-min ant system. In terms of d493, the best result by MNACO is 34984.91 which is better than the best so far value 35002.62.