A. Tatarakis, I. Minis

Stochastic Single Vehicle Routing Problem with Delivery and Pick Up and a Predefined Custoer Sequence, European Journal of Operation Research, vol. 213, 2011, 37-51

In this paper we study the routing of a single vehicle that delivers products and picks up items with sto- 21 chastic demand. The vehicle follows a predefined customer sequence and is allowed to return to the 22 depot for loading/unloading as needed. A suitable dynamic programming algorithm is proposed to deter- 23 mine the minimum expected routing cost. Furthermore, the optimal routing policy to be followed by the 24 vehicle’s driver is derived by proposing an appropriate theorem. The efficiency of the algorithm is studied 25 by solving large problem sets.