ACSLs for Large-Scale Bounded Single Depot Multiple Travelling Salesman Problem

Bounded single depot multiple travelling salesman problem (BSD-MTSP) optimizes salesmen tours with constraints on the number of cities visiting per salesman, which ensures balanced routes. BSD-MTSP presents challenges due to its combinatorial nature and additional complexities arising from multiple salesmen and depot-related constraints. Exact solutions for BSD-MTSP via classical methods are computationally expensive, prompting the use of heuristics and metaheuristics for practical solutions. This paper presents ACSLs, a hybrid algorithm combining initialization heuristic, Ant colony system, and Local search operators. ACSLs efficiently tackles large-scale BSD-MTSPs, demonstrating a superiority of up to 9.964% over the most advanced algorithms through comparative analysis.