Solving the Multiple Traveling Salesman Problem Using Memetic Algorithm

The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding the shortest tour between different cities with a set of constraints such as visiting each city once by one salesman. The solution tour represents the sum of all tours' costs performed by n salesmen. In this research, we propose a novel approach to find different solutions for various instances of MTSP based on a memetic algorithm using Genetic Algorithm (GA) and Hill-Climbing (HC) algorithm. The experimental results proved that the memetic approach achieved promising results i.e., minimum total tour compared to other existing approaches.