Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm
In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of k (≤n) out of n cities and after visiting the last city, the salesman does not necessarily return to the central depot. The goal is to minimize the overall traversal distance of covering k cities. The OT...
Bewaard in:
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Growing Science
2021-01-01
|
| Reeks: | Journal of Project Management |
| Online toegang: | http://www.growingscience.com/jpm/Vol6/jpm_2021_11.pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|