Citation

Dolinskaya I, Shi ZE, Smilowitz K. Transp. Res. E Logist. Transp. Rev. 2018; 109: 1-19.

Copyright

(Copyright © 2018, Elsevier Publishing)

DOI

10.1016/j.tre.2017.10.013

PMID

unavailable

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.

Language: en

Keywords

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