Probabilistic analysis for a multiple depot vehicle routing problem
Journal article, 2007

We give a probabilistic analysis of the Multiple Depot Vehicle Routing Problem (MDVRP) where k depots and it customers are given by i.i.d. random variables in [0, 1](d), d >= 2. The tour length divided by n((d-1)/d) tends to a integral([0,1]d) f(x)((d-1)/d) dx, where,f is the density of the absolutely continuous part of the law of the random variables giving the depots and customers and where the constant alpha depends on the number of depots. If k = o(n), alpha is the constant of the TSP problem. For k = lambda n, lambda > 0, we prove lower and upper bounds on alpha, which decrease as fast as (1 + lambda)(-1/d).

vehicle routing

probabilistic analysis

MDVRP

Author

A. Baltz

University of Kiel

Devdatt Dubhashi

Chalmers, Computer Science and Engineering (Chalmers)

A. Srivastav

University of Kiel

Libertad Tansini

Chalmers, Computer Science and Engineering (Chalmers)

S. Werth

University of Kiel

Random Structures and Algorithms

1042-9832 (ISSN)

Vol. 30 1-2 206-225

Subject Categories

Computer Science

DOI

10.1002/rsa.20156

More information

Latest update

3/29/2018