Open AccessSolving the Multiple Traveling Salesman Problem Using Memetic Algorithm
Author(s) -
Ahmad T. Al- Taani,
Lubna M. Al-Afifi
Publication year - 2022
Publication title -
artificial intelligence evolution
Language(s) - English
Resource type - Journals
eISSN - 2717-5952
pISSN - 2717-5944
DOI - 10.37256/aie.3120221206
Subject(s) - travelling salesman problem , memetic algorithm , 2 opt , mathematical optimization , set (abstract data type) , genetic algorithm , computer science , hill climbing , local search (optimization) , mathematics , algorithm , programming language
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.