Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
Year of publication: |
2020
|
---|---|
Authors: | Amarouche, Youcef ; Guibadj, Rym Nesrine ; Chaalal, Elhadja ; Moukrim, Aziz |
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. 123.2020, p. 1-18
|
Subject: | Adaptive memory | Heuristics | Routing | Splitting algorithm | Team orienteering problem | Time windows | Heuristik | Tourenplanung | Vehicle routing problem | Arbeitsgruppe | Team | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Rundreiseproblem | Travelling salesman problem |
-
Pareto mimic algorithm : an approach to the team orienteering problem
Ke, Liangjun, (2016)
-
Yahiaoui, Ala-Eddine, (2023)
-
The multi-visit team orienteering problem with precedence constraints
Hanafi, Saïd, (2020)
- More ...
-
An effective PSO-inspired algorithm for the team orienteering problem
Dang, Duc-cuong, (2013)
-
An effective PSO-inspired algorithm for the team orienteering problem
Dang, Duc-Cuong, (2013)
-
Ben-Said, Asma, (2022)
- More ...