Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks
Abstract Traditional methods for solving the multiple traveling salesman problem (MTSP), such as metaheuristics, face a well-known trade-off between computational speed and solution quality. Neural combinatorial networks (NCNs) offer an efficient alternative for addressing traveling salesman problem...
Shranjeno v:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Nature Portfolio
2026-04-01
|
| Serija: | Scientific Reports |
| Online dostop: | https://doi.org/10.1038/s41598-026-45824-3 |
| Oznake: |
Brez oznak, prvi označite!
|