Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm

Abstract

Multiple traveling salesman problems (MTSP) are a typical computationally complex combinatorial optimization problem, which is an extension of the famous traveling salesman problem (TSP).The MTSP can be generalized to a wide variety of routing and scheduling problems.The paper makes the attempt to show how Genetic Algorithm (GA) can be applied to the MTSP with ability constraint.In this paper, we compare MTSP in term of distance and iteration by considering several set of cities.The computational results show that the proposed algorithm can find competitive solutions within rational time, especially for large scale problems.