Cargando…
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...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi
2022
|
| Materias: | |
| 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 |