Annals of Operations Research

, Volume 186, Issue 1, pp 61–81

The orienteering problem with stochastic travel and service times

Authors

  • Ann M. Campbell
    • Dept. of Management Sciences, Tippie College of BusinessThe University of Iowa
  • Michel Gendreau
    • CIRRELT and MAGIÉcole Polytechnique de Montréal
    • Dept. of Management Sciences, Tippie College of BusinessThe University of Iowa
Article

DOI: 10.1007/s10479-011-0895-2

Cite this article as:
Campbell, A.M., Gendreau, M. & Thomas, B.W. Ann Oper Res (2011) 186: 61. doi:10.1007/s10479-011-0895-2

Abstract

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.

Keywords

OrienteeringStochastic travel timesVariable neighborhood searchDynamic programming

Copyright information

© Springer Science+Business Media, LLC 2011