Annals of Operations Research

, Volume 186, Issue 1, pp 61–81 | Cite as

The orienteering problem with stochastic travel and service times

  • Ann M. Campbell
  • Michel Gendreau
  • Barrett W. Thomas


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.


Orienteering Stochastic travel times Variable neighborhood search Dynamic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ando, N., & Taniguchi, E. (2006). Travel time reliability in vehicle routing and scheduling with time windows. Networks and Spatial Economics, 6(3–4), 293–311. CrossRefGoogle Scholar
  2. 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
  3. Campbell, A. M., & Thomas, B. W. (2008b). The probabilistic traveling salesman problem with deadlines. Transportation Science, 42(1), 1–21. CrossRefGoogle Scholar
  4. Campbell, A. M., & Thomas, B. W. (2009). Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers & Operations Research, 36, 1231–1248. CrossRefGoogle Scholar
  5. Chao, I. M., Golden, B. L., & Wasil, E. A. (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operational Research, 88(3), 475–489. CrossRefGoogle Scholar
  6. Denardo, E. V. (2003). Dynamic programming: models and applications. Mineola: Dover. Google Scholar
  7. Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 44(3), 216–229. CrossRefGoogle Scholar
  8. Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problem with profits. Transportation Science, 39(2), 188–205. CrossRefGoogle Scholar
  9. Fox, B. L., & Denardo, E. V. (1979). Shortest route methods: 1. reaching, pruning, and buckets. Operations Research, 27, 161–186. CrossRefGoogle Scholar
  10. Gendreau, M., Laporte, G., & Solomon, M. M. (1995). Single-vehicle routing and scheduling to minimize the number of delays. Transportation Science, 29, 56–62. CrossRefGoogle Scholar
  11. 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
  12. 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
  13. Ilhan, S., Iravani, S. M. R., & Daskin, M. (2008). The orienteering problem with stochastic profits. IIE Transactions, 40(4), 406–421. CrossRefGoogle Scholar
  14. Jula, H., Dessouky, M., & Ioannou, A. (2006). Truck route planning in nonstationary stochastic networks with time windows at customer locations. IEEE Transactions on Intelligent Transportation Systems, 7(1), 51–62. CrossRefGoogle Scholar
  15. Kao, E. P. C. (1978). A preference order dynamic program for a stochastic traveling salesman problem. Operations Research, 26(6), 1033–1045. CrossRefGoogle Scholar
  16. Kenyon, A. S., & Morton, D. P. (2003). Stochastic vehicle routing with random travel times. Transportation Science, 37(1), 69–82. CrossRefGoogle Scholar
  17. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100. CrossRefGoogle Scholar
  18. Puterman, M. L. (1994). Markov decision processes: discrete stochastic dynamic programming. New York: Wiley. Google Scholar
  19. 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
  20. Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2), 139–171. CrossRefGoogle Scholar
  21. 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
  22. Tang, H., & Miller-Hooks, E. (2005). Algorithms for a stochastic selective travelling salesperson problem. The Journal of the Operational Research Society, 56, 439–452. CrossRefGoogle Scholar
  23. Teng, S. Y., Ong, H. L., & Huang, H. C. (2004). 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, 21, 241–257. CrossRefGoogle Scholar
  24. Tsiligirides, T. (1984). Heuristic methods applied to orienteering. Journal of Operations Research Society, 35, 797–809. Google Scholar
  25. 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.
  26. 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

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Ann M. Campbell
    • 1
  • Michel Gendreau
    • 2
  • Barrett W. Thomas
    • 1
  1. 1.Dept. of Management Sciences, Tippie College of BusinessThe University of IowaIowa CityUSA
  2. 2.CIRRELT and MAGIÉcole Polytechnique de MontréalMontrealCanada

Personalised recommendations