Convergence Results for Vehicle Routing Problems With Stochastic Demands

In this paper, the authors investigate two variants of the Stochastic Vehicle Routing Problem: The Vehicle Routing Problem with Stochastic Demands and the Vehicle Routing Problem with Stochastic Demands and Customers. They show that under some moderate conditions there is an asymptotic equivalence between the Vehicle Routing Problem with Stochastic Demands and the Traveling Salesman Problem, as well as between the Vehicle Routing Problem with Stochastic Demands and Customers and the Probabilistic Traveling Salesman Problem. Based on their results they give explanations for different observations in literature and they provide ideas for the development of new approximation algorithms and heuristics for these problems.

Provided by: University of Lugano Topic: Mobility Date Added: Nov 2011 Format: PDF

Find By Topic