RISK-AVERSE STOCHASTIC ORIENTEERING PROBLEMS
Abstract
In this study, we consider risk-averse orienteering problems with stochastic travel times or stochastic rewards. In risk-neutral orienteering problems, the objective is generally to maximize the expected total reward of visited notes. However, due to uncertain travel times or uncertain rewards, the dispersion in total reward collected may be large, which necessitates an approach that minimizes the dispersion (risk) in addition to maximizing the expected total reward. To handle this, for the orienteering problems with stochastic travel times or stochastic rewards, we suggest two different formulations with an objective of coherent measures of risk. For both problems, we conduct an experimental study using two different coherent measures of risk, which have been extensively used in the literature, and compare the results. The computational results show that, in both models suggested and under both risk measures used, the decision maker is able to obtain a tour with expected total reward being close to the expected total reward of risk-neutral solution, however with a significant decrease in the standard deviation of total reward.
Keywords
References
- Tsiligirides T. Heuristic Methods Applied to Orienteering. The Journal of the Operational Research Society 1984; 35(9): 797-809.
- Golden BL, Levy L, Vohra R. The orienteering problem. Naval Research Logistics 1987; 34(3): 307-318.
- Vansteenwegen P, Souffriau W, Van Oudheusden D. The orienteering problem: A survey. European Journal of Operational Research 2011; 209 (1): 1–10.
- Gunawan A, Lau HC, Vansteenwegen P. Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research 2016; 255(2): 315-332.
- Teng SY, Ong HL, Huang HC. An integer L-shaped algorithm for the time-constrained traveling salesman problem with stochastic travel times and service times. Asia-Pacific Journal of Operational Research 2004; 21: 241–257.
- Campbell AM, Gendreau M, Thomas BW. The orienteering problem with stochastic travel and service times. Annals of Operations Research 2011; 186: 61–81.
- Tang H, Miller-Hooks E. Algorithms for a stochastic selective travelling salesperson problem. Journal of the Operational Research Society 2005; 56(4): 439–452.
- Ilhan T, Iravani SM, Daskin MS. The orienteering problem with stochastic profits. IIE Transactions 2008; 40: 406–421.
- Evers L, Glorie K, Van Der Ster S, Barros AI, Monsuur H. A two-stage approach to the orienteering problem with stochastic weights. Computers & Operations Research 2014; 43: 248-260.
- Shang K, Chan FT, Karungaru S, Terada K, Feng Z, Ke L. Two-stage robust optimization for orienteering problem with stochastic weights. 2016; arXiv preprint arXiv:1701.00090.