An Approximation algorithm for a 2-Depot, Heterogeneous Vehicle Routing Problem Conference Paper

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. 2009 AACC.

name of conference

• 2009 American Control Conference

authors

• Darbha, Swaroop
• Rathinam, Sivakumar

published proceedings

• 2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9

author list (cited authors)

• Yadlapalli, S. K., Rathinam, S., & Darbha, S.

citation count

• 4

complete list of authors

• Yadlapalli, Sai Krishna||Rathinam, Sivakumar||Darbha, Swaroop

publication date

• January 2009

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the ... American Control Conference. American Control Conference  Journal

keywords

• 35 Commerce, Management, Tourism And Services
• 3509 Transportation, Logistics And Supply Chains
• 40 Engineering

Digital Object Identifier (DOI)

• 10.1109/ACC.2009.5160738

International Standard Book Number (ISBN) 13

• 978-1-4244-4523-3

start page

• 1730

end page

• 1735

URL

• http://dx.doi.org/10.1109/acc.2009.5160738

user-defined tag

• 7 Affordable and Clean Energy