Paper Info
Title
An approximation algorithm for a 2-depot, heterogeneous vehicle routing problem
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.
Year
DOI
Venue
2009
10.1109/ACC.2009.5160738
ACC'09 Proceedings of the 2009 conference on American Control Conference
Keywords
DocType
ISSN
direct travel,military application,motion constraint,intermediate location,approximation algorithm,heterogeneous vehicle,routing problem,heterogeneous vehicle routing problem,vehicle routing problem,data mining,approximation theory,polynomials,robots,approximation algorithms,probability density function,optimization,transportation,mechanical engineering,routing
Conference
0743-1619
Citations 
PageRank 
References 
0
0.34
2
Authors
3
Name
Order
Citations
PageRank
Sai Krishna Yadlapalli100.34
Sivakumar Rathinam221623.81
Swaroop Darbha318426.64