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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2022-01-01
|
| Series: | Decision Science Letters |
| Online Access: | http://www.growingscience.com/dsl/Vol11/dsl_2022_24.pdf |