A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection
Year of publication: |
February 2018
|
---|---|
Authors: | Luo, Yongliang ; Benlic, Una ; Wu, Qinghua |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 90.2018, p. 193-207
|
Subject: | Dynamic programming | The traveling salesman problem | Infeasible local search | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Urrutia, Sebastián, (2015)
-
Dynamic programming for the minimum tour duration problem
Tilk, Christian, (2017)
- More ...
-
Heuristic search to the capacitated clustering problem
Zhou, Qing, (2019)
-
Lu, Yongliang, (2019)
-
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints
Lu, Yongliang, (2018)
- More ...