A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints
| Year of publication: |
1 July 2018
|
|---|---|
| Authors: | Lu, Yongliang ; Benlic, Una ; Wu, Qinghua |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 268.2018, 1 (1.7.), p. 54-69
|
| Subject: | Heuristics | Orienteering Problem | Memetic algorithm | Infeasible local search | Heuristik | Theorie | Theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
Mei, Yi, (2016)
-
A logistic optimization for the vehicle routing problem through a case study in the food industry
Akpinar, Muhammet Enes, (2021)
-
An improved memetic algorithm for integrated production scheduling and vehicle routing decisions
Qiu, Feier, (2023)
- More ...
-
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Lu, Yongliang, (2022)
-
A parallel adaptive memory algorithm for the capacitated modular hub location problem
Wu, Qinghua, (2023)
-
He, Mu, (2024)
- More ...