Probabilistic Analysis of Euclidean Capacitated Vehicle Routing

09/14/2021
by   Claire Mathieu, et al.
0

We give a probabilistic analysis of the unit-demand Euclidean capacitated vehicle routing problem in the random setting, where the input distribution consists of n unit-demand customers modeled as independent, identically distributed uniform random points in the two-dimensional plane. The objective is to visit every customer using a set of routes of minimum total length, such that each route visits at most k customers, where k is the capacity of a vehicle. All of the following results are in the random setting and hold asymptotically almost surely. The best known polynomial-time approximation for this problem is the iterated tour partitioning (ITP) algorithm, introduced in 1985 by Haimovich and Rinnooy Kan. They showed that the ITP algorithm is near-optimal when k is either o(√(n)) or ω(√(n)), and they asked whether the ITP algorithm was also effective in the intermediate range. In this work, we show that when k=√(n), the ITP algorithm is at best a (1+c_0)-approximation for some positive constant c_0. On the other hand, the approximation ratio of the ITP algorithm was known to be at most 0.995+α due to Bompadre, Dror, and Orlin, where α is the approximation ratio of an algorithm for the traveling salesman problem. In this work, we improve the upper bound on the approximation ratio of the ITP algorithm to 0.915+α. Our analysis is based on a new lower bound on the optimal cost for the metric capacitated vehicle routing problem, which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2023

Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm

We study the unit-demand capacitated vehicle routing problem in the rand...
research
11/10/2020

Improving the Approximation Ratio for Capacitated Vehicle Routing

We devise a new approximation algorithm for capacitated vehicle routing....
research
01/21/2020

Closed form distance formula for the balanced multiple travelling salesmen

As a first contribution the mTSP is solved using an exact method and two...
research
10/29/2022

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity

The Capacitated Vehicle Routing Problem (CVRP) is one of the most extens...
research
09/19/2023

Improved guarantees for the a priori TSP

We revisit the a priori TSP (with independent activation) and prove stro...
research
06/29/2021

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

In this paper, we present Approximation Schemes for Capacitated Vehicle ...
research
08/27/2020

Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

Dynamic routing occurs when customers are not known in advance, e.g. for...

Please sign up or login with your details

Forgot password? Click here to reset