Publication Type

Journal Article

Version

acceptedVersion

Publication Date

12-2016

Abstract

Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3271. The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP, the Multi-agent OP, the Clustered OP and others. This paper focuses on a comprehensive and thorough survey of recent variants of the OP, including the proposed solution approaches. Moreover, the OP has been used as a model in many different practical applications. The most recent applications of the OP, such as the Tourist Trip Design Problem and the mobile-crowdsourcing problem are discussed. Finally, we also present some promising topics for future research.

Keywords

Orienteering Problem, Practical Applications, Scheduling, Survey

Discipline

Artificial Intelligence and Robotics | Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Optimization

Publication

European Journal of Operational Research

Volume

255

Issue

2

First Page

315

Last Page

332

ISSN

0377-2217

Identifier

10.1016/j.ejor.2016.04.059

Publisher

Elsevier: 24 months

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1016/j.ejor.2016.04.059

Download

Share

COinS