Name
Abstract | ||
|---|---|---|
During the last decade, a number of challenging applications in logistics, tourism and other fields were modelled as orienteering problems (OP). In the orienteering problem, a set of vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some vertices and maximises the sum of the collected scores. In this paper, the literature about the orienteering problem and its applications is reviewed. The OP is formally described and many relevant variants are presented. All published exact solution approaches and (meta) heuristics are discussed and compared. Interesting open research questions concerning the OP conclude this paper. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejor.2010.03.045 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimisation,Orienteering problem,Survey | Open research,Mathematical optimization,Orienteering,Operations research,Combinatorial optimization,Heuristics,Travelling salesman problem,Local search (optimization),Operations management,Metamodeling,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
209 | 1 | 0377-2217 |
Citations | PageRank | References |
261 | 8.04 | 34 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pieter Vansteenwegen | 1 | 1026 | 48.63 |
| Wouter Souffriau | 2 | 750 | 28.50 |
| Dirk Van Oudheusden | 3 | 917 | 41.64 |