The orienteering problem with stochastic travel and service times
- 510 Downloads
In this paper, we introduce a variant of the orienteering problem in which travel and service times are stochastic. If a delivery commitment is made to a customer and is completed by the end of the day, a reward is received, but if a commitment is made and not completed, a penalty is incurred. This problem reflects the challenges of a company who, on a given day, may have more customers than it can serve. In this paper, we discuss special cases of the problem that we can solve exactly and heuristics for general problem instances. We present computational results for a variety of parameter settings and discuss characteristics of the solution structure.
KeywordsOrienteering Stochastic travel times Variable neighborhood search Dynamic programming
Unable to display preview. Download preview PDF.
- Campbell, A. M., & Thomas, B. W. (2008a). Advances and challenges in a priori routing. In B. Golden, R. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and challenges, operations research/computer science interfaces (Vol. 43, pp. 123–142). Berlin: Springer. CrossRefGoogle Scholar
- Denardo, E. V. (2003). Dynamic programming: models and applications. Mineola: Dover. Google Scholar
- Goodson, J. (2008). Fixed, dynamic, and hybrid routing strategies for the vehicle routing problem with stochastic demand. Ph.D. Dissertation Proposal, Department of Management Sciences, University of Iowa. Google Scholar
- Hansen, P., Mladenović, N., Brimberg, J., & Moreno Perez, J. A. (2010). Variable neighborhood search. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics, international series in operations research & management science (Vol. 146, Chap. 3, pp. 61–86). New York: Springer. Google Scholar
- Puterman, M. L. (1994). Markov decision processes: discrete stochastic dynamic programming. New York: Wiley. Google Scholar
- Russell, R. A., & Urban, T. L. (2007). Vehicle routing with soft time windows and Erlang travel times. Journal of the Operational Research Society, 1–9. Google Scholar
- Sevkli, Z., & Sevilgen, F. E. (2006). Variable neighborhood search for the orienteering problem. In Lecture notes in computer science (Vol. 4263, pp. 134—143). Berlin: Springer. Google Scholar
- Tsiligirides, T. (1984). Heuristic methods applied to orienteering. Journal of Operations Research Society, 35, 797–809. Google Scholar
- Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011). The orienteering problem: a survey. European Journal of Operational Research. doi:10.1016/j.ejor.2010.03.045.
- Wong, J. C. F., Leung, J. M. Y., & Cheng, C. H. (2003). On a vehicle routing problem with time windows and stochastic travel times: models, algorithms, and heuristics (Tech. Rep.). SEEM2003-03, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong. Google Scholar