Cargando…
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...
Autores principales: | Lu, Yongliang, Hao, Jin-Kao, Wu, Qinghua |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2022
|
Materias: | |
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 |
Ejemplares similares
-
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm
por: Ban, Ha-Bang, et al.
Publicado: (2023) -
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
por: Hao, Tan, et al.
Publicado: (2023) -
A novel approach for solving travelling thief problem using enhanced simulated annealing
por: Ali, Hamid, et al.
Publicado: (2021) -
Dynamic thresholding search for the feedback vertex set problem
por: Sun, Wen, et al.
Publicado: (2023) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017)