EUVIMEDEUVIMED entdecken
Crossref

Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm

M. Veeresh, T. Jayanth Kumar, M. Thangaraj

Decision Science Letters · 2024 · 13 (2) · 401-414

DOI: 10.5267/j.dsl.2024.1.006 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Decision Science Letters, 2024. Verfasst von M. Veeresh und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 1 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution. MTSP has found widespread applications in various domains, such as transportation, robotics, and networking. Despite extensive research on MTSP and its variants, there has been limited attention given to the open close multiple travelling salesman problem (OCMTSP) and its variants in the literature. To the best of the author's knowledge, only one study has addressed OCMTSP, introducing an exact algorithm designed for optimal solutions. However, the efficiency of this existing algorithm diminishes for larger instances due to computational complexity. Therefore, there is a crucial need for a high-level metaheuristic to provide optimal/best solutions within a reasonable timeframe. Addressing this gap, this study proposes a first meta-heuristic called multi-chromosome-based Genetic Algorithm (GA) for solving OCMTSP. The effectiveness of the developed algorithm is demonstrated through a comparative study on distinct asymmetric benchmark instances sourced from the TSPLIB dataset. Additionally, results from comprehensive experiments conducted on 90 OCMTSP symmetric instances, generated from the renowned TSPLIB benchmark dataset, highlight the efficiency of the proposed GA in addressing the OCMTSP. Notably, the proposed multi-chromosome-based GA stands out as the top-performing approach in terms of overall performance. Further, solutions to symmetric TSPLIB benchmark instances are also reported, which will be used as a basis for future studies.

Zitieren

APA

Veeresh, M., Kumar, T. J., & Thangaraj, M. (2024). Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm. Decision Science Letters, 13(2), 401-414. https://doi.org/10.5267/j.dsl.2024.1.006

Vancouver

Veeresh M, Kumar TJ, Thangaraj M. Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm. Decision Science Letters. 2024;13(2):401-414. doi:10.5267/j.dsl.2024.1.006

BibTeX
@article{Veeresh2024,
  author = {Veeresh, M. and Kumar, T. Jayanth and Thangaraj, M.},
  title = {Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm},
  journal = {Decision Science Letters},
  year = {2024},
  volume = {13},
  number = {2},
  pages = {401--414},
  doi = {10.5267/j.dsl.2024.1.006}
}
Kostenlos starten →