A distance matrix based algorithm for solving the traveling salesman problem
| Year of publication: |
2020
|
|---|---|
| Authors: | Wang, Shengbin ; Rao, Weizhen ; Hong, Yuan |
| Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 20.2020, 3, p. 1505-1542
|
| Subject: | Traveling salesman problem | Distance matrix method | Greedy heuristic | Savings heuristic | Construction heuristics | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
The approximation ratio of the 2-Opt heuristic for the metric Traveling Salesman Problem
Hougardy, Stefan, (2020)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
- More ...
-
On the robust and stable flowshop scheduling under stochastic and dynamic disruptions
Liu, Feng, (2017)
-
A survey of privacy-aware supply chain collaboration : from theory to applications
Hong, Yuan, (2014)
-
Integrated post-disaster medical assistance team scheduling and relief supply distribution
Wang, Shengbin, (2018)
- More ...