Adaptive orienteering problem with stochastic travel times

•OP where paths between the reward nodes is component of the decision space.•Benefits of adaptive decision making incorporating network uncertainty.•Capture different levels of adaptive decision making and study their trade-offs. In this paper, we evaluate the extent to which one can increase the li...

Full description

Saved in:

Bibliographic Details
Published in:	Transportation research. Part E, Logistics and transportation review Vol. 109; pp. 1 - 19
Main Authors:	Dolinskaya, Irina, Shi, Zhenyu (Edwin), Smilowitz, Karen
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01-01-2018
Subjects:	Adaptive path Dynamic programming Orienteering problem Search and rescue Variable neighborhood search Dynamic programming Variable neighborhood search Orienteering problem Search and rescue Adaptive path
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	•OP where paths between the reward nodes is component of the decision space.•Benefits of adaptive decision making incorporating network uncertainty.•Capture different levels of adaptive decision making and study their trade-offs. 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.
ISSN:	1366-5545 1878-5794
DOI:	10.1016/j.tre.2017.10.013