Solving the clustered traveling salesman problem via traveling salesman problem methods

The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by converting it to the well-studied TSP. For this purpose, we first i...

Descripción completa

Detalles Bibliográficos
Autores principales: Lu, Yongliang, Hao, Jin-Kao, Wu, Qinghua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2022
Materias:
Algorithms and Analysis of Algorithms
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9202618/
https://www.ncbi.nlm.nih.gov/pubmed/35721414
http://dx.doi.org/10.7717/peerj-cs.972

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9202618/
https://www.ncbi.nlm.nih.gov/pubmed/35721414
http://dx.doi.org/10.7717/peerj-cs.972

Ejemplares similares