Adaptive orienteering problem with stochastic travel times

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

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 1 2018

Fingerprint

Travel time
reward
travel
time
Reward
Node
Adaptivity

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

@article{cd2fd3e127af4ed78d3b870be09379a3,
title = "Adaptive orienteering problem with stochastic travel times",
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.",
keywords = "Adaptive path, Dynamic programming, Orienteering problem, Search and rescue, Variable neighborhood search",
author = "Irina Dolinskaya and Shi, {Zhenyu (Edwin)} and Smilowitz, {Karen Renee}",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.tre.2017.10.013",
language = "English (US)",
volume = "109",
pages = "1--19",
journal = "Transportation Research, Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",

}

Adaptive orienteering problem with stochastic travel times. / Dolinskaya, Irina; Shi, Zhenyu (Edwin); Smilowitz, Karen Renee.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 109, 01.01.2018, p. 1-19.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive orienteering problem with stochastic travel times

AU - Dolinskaya, Irina

AU - Shi, Zhenyu (Edwin)

AU - Smilowitz, Karen Renee

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Adaptive path

KW - Dynamic programming

KW - Orienteering problem

KW - Search and rescue

KW - Variable neighborhood search

UR - http://www.scopus.com/inward/record.url?scp=85033678468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85033678468&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2017.10.013

DO - 10.1016/j.tre.2017.10.013

M3 - Article

VL - 109

SP - 1

EP - 19

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

ER -