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 | Theorie | Theory | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
-
Exact and heuristic algorithms for the carrier-vehicle traveling salesman problem
Erdoğan, Güneş, (2021)
- More ...
-
Integrated post-disaster medical assistance team scheduling and relief supply distribution
Wang, Shengbin, (2018)
-
A survey of privacy-aware supply chain collaboration : from theory to applications
Hong, Yuan, (2014)
-
On the robust and stable flowshop scheduling under stochastic and dynamic disruptions
Liu, Feng, (2017)
- More ...