An efficient hybrid genetic algorithm for solving truncated travelling salesman problem
This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities as in conventional travelling salesman problem (TSP)) with minimal traversal distance. Thu...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Growing Science
2022-01-01
|
| Col·lecció: | Decision Science Letters |
| Accés en línia: | http://www.growingscience.com/dsl/Vol11/dsl_2022_24.pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|