Abstract

Stochastic vehicle routing, which deals with routing problems in which some of the key problem parameters are not known with certainty, has been an active, but fairly small research area for almost 50 years. However, over the past 15 years we have witnessed a steady increase in the number of papers targeting stochastic versions of the vehicle routing problem (VRP). This increase may be explained by the larger amount of data available to better analyze and understand various stochastic phenomena at hand, coupled with methodological advances that have yielded solution tools capable of handling some of the computational challenges involved in such problems. In this paper, we first briefly sketch the state-of-the-art in stochastic vehicle routing by examining the main classes of stochastic VRPs (problems with stochastic demands, with stochastic customers, and with stochastic travel or service times), the modeling paradigms that have been used to formulate them, and existing exact and approximate solution methods that have been proposed to tackle them. We then identify and discuss two groups of critical issues and challenges that need to be addressed to advance research in this area. These revolve around the expression of stochastic phenomena and the development of new recourse strategies. Based on this discussion, we conclude the paper by proposing a number of promising research directions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call