Multi-type ant colony system for solving the multiple traveling salesman problem.

• Yasel José Costa Salas Universidad Central “Marta Abreu” de Las Villas-Cuba
• René Abreu Ledón Universidad Central “Marta Abreu” de Las Villas-Cuba
• Norge Isaías Coello Machado Universidad Central “Marta Abreu” de Las Villas-Cuba
• Ann Nowé Vrije Universiteit Brusse-Bélgica

Resumo

The Multiple Traveling Salesman problem (mTSP) is an extension of the well-known Traveling Sales- man Problem (TSP), where more than one salesman is allowed to be used in order to visit some cities just once. Furthermore, the formulation of the mTSP seem more relevant for real-life applications, and also can be extended to a wide variety of Vehicle Routing Problems (VRPs) by incorporating some additional side constraints, such as the vehicle capacity and customer demands. Although the literature for the TSP and the VRP is definitely wide, the mTSP has not received the same amount of attention. In that sense, this paper proposes a new algorithm based on Ant Colony Optimization (ACO) for the mTSP, specifically Multi-type Ant Colony System (M-ACS), where each colony represents a possible global solution. More-over, these colonies cooperate by means of “frequent” pheromone exchanges in order to find a competitive solution for the mTSP. The algorithm performance has been compared with one of the most efficient local search algorithms for mTSP, the Lin-Kernighan algorithm. Computational results confirm the competitiveness and efficiency of the strategy we propose.