You are here

Stochastic Single Vehicle Routing with a Predefined Customer Sequence and Multiple Depot Returns

Tatarakis, A. and Minis, I.

European Journal of Operations Research, vol. 197, n. 2, 2008, 557-571.


We study the routing of a single vehicle that delivers multiple products under stochastic demand. Specifically, we investigate two practical variations of this problem: (i) The case in which each product type is stored in its dedicated compartment in the vehicle, and (ii) the case in which all products are stored together in the vehicle's single compartment. Suitable dynamic programming algorithms are proposed to determine the minimum expected (routing) cost for each case. Furthermore, the optimal routing policy is derived by developing appropriate theorems. The efficiency of the algorithms is studied by solving large problem sets.