A matheuristic approach to the orienteering problem with service time dependent profits
Year of publication: |
2019
|
---|---|
Authors: | Yu, Qinxiao ; Fang, Kan ; Zhu, Ning ; Ma, Shoufeng |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 273.2019, 2 (1.3.), p. 488-503
|
Subject: | Routing | Orienteering problem | Service time dependent profits | Matheuristic algorithm | Nonlinear programming | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
A revisited branch-and-cut algorithm for large-scale orienteering problems
Kobeaga, Gorka, (2024)
-
A biased random-key genetic algorithm for the set orienteering problem
Carrabs, Francesco, (2021)
-
A new formulation and a branch-and-cut algorithm for the set orienteering problem
Archetti, Claudia, (2024)
- More ...
-
Team orienteering with time-varying profit
Yu, Qinxiao, (2022)
-
Robust team orienteering problem with decreasing profits
Yu, Qinxiao, (2022)
-
Humanitarian relief network assessment using collaborative truck-and-drone system
Zhang, Guowei, (2021)
- More ...