A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model

The quota traveling salesman problem (QTSP) is a variant of the traveling salesman problem (TSP), which is a classical optimization problem. In the QTSP, the salesman visits some of the n cities to meet a given sales quota Q while having minimized travel costs. In this paper, we develop a DNA algori...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Zhaocai, Wu, Xian, Wu, Tunhua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2022
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9451995/
https://www.ncbi.nlm.nih.gov/pubmed/36093485
http://dx.doi.org/10.1155/2022/1450756

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9451995/
https://www.ncbi.nlm.nih.gov/pubmed/36093485
http://dx.doi.org/10.1155/2022/1450756

Ejemplares similares