Back to Search
Start Over
A novel memetic algorithm for solving the generalized traveling salesman problem.
- Source :
- Logic Journal of the IGPL; Aug2024, Vol. 32 Issue 4, p576-588, 13p
- Publication Year :
- 2024
-
Abstract
- This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature. [ABSTRACT FROM AUTHOR]
- Subjects :
- TRAVELING salesman problem
ALGORITHMS
HUMAN chromosomes
Subjects
Details
- Language :
- English
- ISSN :
- 13670751
- Volume :
- 32
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Logic Journal of the IGPL
- Publication Type :
- Academic Journal
- Accession number :
- 178650246
- Full Text :
- https://doi.org/10.1093/jigpal/jzae019