A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

Authors:
Tetsuo Asano;Naoki Katoh;Kazuhiro Kawashima
Affiliations:
-;-;-
Venue:
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Year:
1999

Citing 4
Cited 0

A note on an algorithm for generalized fractional programs

Journal of Optimization Theory and Applications
A note on the complexity of a simple transportation problem

SIAM Journal on Computing
A Capacitated Vehicle Routing Problem on a Tree

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Vehicle Scheduling on a Tree with Release and Handling Times

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot. Customers are located on vertices of the tree. Demands of customers are served by a fleet of identical vehicles with limited capacity. It is assumed that the demand of a customer is splittable, i.e., it can be served by more than one vehicle. The problem we are concerned with in this paper asks to find a set of tours of the vehicles with minimum total lengths. Each tour begins at the depot, visits a subset of the customers and returns to the depot. We propose a 1.35078-approximation algorithm for the problem (exactly, (√41 - 1)/4), which is an improvement over the existing 1.5-approximation.