Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity

10/29/2022
by   Jingyang Zhao, et al.
0

The Capacitated Vehicle Routing Problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. According to the property of the demand of customers, we distinguish three variants of CVRP: unit-demand, splittable and unsplittable. We consider k-CVRP in general metrics and general graphs, where k is the capacity of the vehicle and all the three versions are APX-hard for each fixed k≥ 3. In this paper, we give a (5/2-Θ(√(1/k)))-approximation algorithm for splittable and unit-demand k-CVRP and a (5/2+ln2-Θ(√(1/k)))-approximation algorithm for unsplittable k-CVRP (assume the approximation ratio for metric TSP is α=3/2). Thus, our approximation ratio is better than previous results for sufficient large k, say k≤ 1.7× 10^7. For small k, we design independent algorithms by using more techniques to get further improvements. For splittable and unit-demand cases, we improve the ratio from 1.934 to 1.500 for k=3, and from 1.750 to 1.667 for k=4. For the unsplittable case, we improve the ratio from 2.693 to 1.500 for k=3, from 2.443 to 1.750 for k=4, and from 2.893 to 2.157 for k=5.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2023

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing

The Multidepot Capacitated Vehicle Routing Problem (MCVRP) is a well-kno...
research
11/10/2020

Improving the Approximation Ratio for Capacitated Vehicle Routing

We devise a new approximation algorithm for capacitated vehicle routing....
research
09/14/2021

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing

We give a probabilistic analysis of the unit-demand Euclidean capacitate...
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
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
08/08/2022

Multi Purpose Routing: New Perspectives and Approximation Algorithms

The cost due to delay in services may be intrinsically different for var...
research
04/09/2018

Beating the integrality ratio for s-t-tours in graphs

Among various variants of the traveling salesman problem, the s-t-path g...

Please sign up or login with your details

Forgot password? Click here to reset