Article

Annals of Operations Research

, Volume 186, Issue 1, pp 61-81

The orienteering problem with stochastic travel and service times

  • Ann M. CampbellAffiliated withDept. of Management Sciences, Tippie College of Business, The University of Iowa
  • , Michel GendreauAffiliated withCIRRELT and MAGI, École Polytechnique de Montréal
  • , Barrett W. ThomasAffiliated withDept. of Management Sciences, Tippie College of Business, The University of Iowa Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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

Orienteering Stochastic travel times Variable neighborhood search Dynamic programming