Learning-guided iterated local search for the minmax multiple traveling salesman problem
| Year of publication: |
2026
|
|---|---|
| Authors: | He, Pengfei ; Hao, Jin-Kao ; Xia, Jinhui |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 185.2026, Art.-No. 107255, p. 1-12
|
| Subject: | Iterated local search | Learning-driven search | Minmax | Multi-armed bandit | Traveling salesman | Theorie | Theory | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming |
-
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
He, Pengfei, (2023)
-
A dual local search framework for combinatorial optimization problems with TSP application
Ouenniche, Jamal, (2017)
-
Iterated local search for consecutive block minimization
Haddadi, Salim, (2021)
- More ...
-
Hybrid search with neighborhood reduction for the multiple traveling salesman problem
He, Pengfei, (2022)
-
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
He, Pengfei, (2023)
-
General edge assembly crossover-driven memetic search for split delivery vehicle routing
He, Pengfei, (2023)
- More ...