A Resolution Adaptive Algorithm for the Stochastic Orienteering Problem with Chance Constraints
Thomas C. Thayer,Stefano Carpin,Thomas C. Thayer,Stefano Carpin
We study a stochastic version of the classic orienteering problem where the time to traverse an edge is a continuous random variable. For a given temporal deadline B, our solution produces a policy, i.e., a function that, based on the current position along a solution path and the elapsed time, decides whether to continue along the path or take a shortcut to avoid missing the deadline. The solutio...
