1. You can enlarge the whole site (character size and with) by using the browser function to change characters size.

2. To your right it is possible to change the character size, font, spacing, characters and letters as well as adjust the colours. This will have consequences for the appearance of the whole website design. It will effect all pages at the University  of Gothenburg's website. The changes will remain the next time you log in. (To save your changes the browser must allow cookies.)

*Changes has been made to the look of this website

  • Home
  • Probabilistic analysis for a multiple depot vehicle routing problem

Probabilistic analysis for a multiple depot vehicle routing problem

Random structures & algorithms
Year of publication: 
Scientific journal article - peer reviewed

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).

To the top

Page updated: 2013-02-07 14:51

Send as email
Print page
Show as pdf