论文信息 - An approximation algorithm for a 2-Depot, heterogeneous vehicle routing problem

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

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.

[1] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .

[2] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.

[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4] S. Rathinam,et al. Lower and Upper Bounds for a Multiple Depot UAV Routing Problem , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[5] Manfred W. Padberg,et al. Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges , 1977, Oper. Res..

[6] Jianliang Xu,et al. Flash-Optimized B+-Tree , 2010, Journal of Computer Science and Technology.

[7] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[8] Swaroop Darbha,et al. An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem , 2007, Oper. Res. Lett..

[9] Raja Sengupta,et al. A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints , 2007, IEEE Transactions on Automation Science and Engineering.