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 | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A large neighborhood search for the vehicle routing problem with multiple time windows
Schaap, Hendrik, (2022)
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
A customized genetic algorithm for bi-objective routing in a dynamic network
Maskooki, Alaleh, (2022)
- More ...
-
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Lu, Yongliang, (2022)
-
An opposition-based memetic algorithm for the maximum quasi-clique problem
Zhou, Qing, (2020)
-
Heuristic search to the capacitated clustering problem
Zhou, Qing, (2019)
- More ...