An approximation algorithm for a 2-depot, heterogeneous vehicle routing problem

Authors:
Sai Krishna Yadlapalli;Sivakumar Rathinam;Swaroop Darbha
Affiliations:
Department of Mechanical Engineering, Texas A & M University, College Station, Texas;Department of Mechanical Engineering, Texas A & M University, College Station, Texas;Department of Mechanical Engineering, Texas A & M University, College Station, Texas
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 4
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Approximation algorithms

Approximation algorithms
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing problems involving heterogeneous vehicles naturally arise in several civil and military applications due to fuel and motion constraints of the vehicles. These vehicles can differ either in their motion constraints or sensing capabilities. Approximation algorithms are useful for solving these routing problems because they produce solutions that can be efficiently computed and are relatively less sensitive to the noise in the data. In this paper, we present the first approximation algorithm for a 2-Depot, Heterogeneous Vehicle Routing Problem when the cost of direct travel between any pair of locations is no costlier than the cost of travel between the same locations and going through any intermediate location.