Adaptive orienteering problem with stochastic travel times

Irina Dolinskaya*, Zhenyu (Edwin) Shi, Karen Smilowitz

*Corresponding author for this work

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

In this paper, we evaluate the extent to which one can increase the likelihood of collecting greater reward in an orienteering problem with stochastic travel times by adapting paths between reward nodes as travel times are revealed. We evaluate whether this adaptivity impacts the choices of reward nodes to visit in a setting where the agent must commit to reward nodes before commencing operations. We explore the computational challenges of adding adaptive consideration in the selection of reward nodes to visit and examine the extent to which one can capture some of the benefits of adaptivity with a simpler model.

Original languageEnglish (US)
Pages (from-to)1-19
Number of pages19
JournalTransportation Research Part E: Logistics and Transportation Review
Volume109
DOIs
StatePublished - Jan 2018

    Fingerprint

Keywords

  • Adaptive path
  • Dynamic programming
  • Orienteering problem
  • Search and rescue
  • Variable neighborhood search

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Cite this