Skip to main content
SpringerLink
Log in

3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We present the first approximation algorithm for a two depot, heterogeneous traveling salesman problem with an approximation ratio of 3 when the costs are symmetric and satisfy the triangle inequality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chandler, P., Pachter, M.: Research issues in autonomous control of tactical UAVs. In: Proceedings of the American Control Conference, pp. 394–398 (1998)

  2. Chandler, P., Pachter, M., Swaroop, D., Fowler, J.M., Howlett, J.K., Rasmussen, S., Schumacher, C., Nygard, K.: Complexity in UAV cooperative control. In: Proceedings of the American Control Conference, pp. 1831–1836 (2002)

  3. Lagoudakis, M., Markakis, V., Kempe, D., Keskinocak, P., Koenig, S., Kleywegt, A., Tovey, C., Meyerson, A., Jain, S.: Auction-based multi-robot routing. In Proceedings of the International Conference on Robotics: Science and Systems, pp. 343–350 (2005)

  4. Tisdale, J., Ryan, A., Zennaro, M., Xiao, X., Caveney, D., Rathinam, S., Hedrick, J.K., Sengupta, R.: The software architecture of the Berkeley UAV platform. In: IEEE Conference on Control Applications, Munich, Germany (2006)

  5. Gutin, G., Punnen, A.P. (eds): The Travelling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  6. Gutin G.: Traveling Salesman Problem. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3935–3944. Springer, USA (2009)

    Chapter  Google Scholar 

  7. Vazirani V.V.: Approximation Algorithms. Springer, Berlin (2001)

    Google Scholar 

  8. Du, D., Pardalos, P. M. (eds). Handbook of Combinatorial Optimization, vol. 1–3 (1999)

  9. Marinakis Y.: Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 1498–1506. Springer, USA (2009)

    Chapter  Google Scholar 

  10. Lawler E.L.: Combinatorial Optimization: Networks and Matroids. Dover Publications, USA (2001)

    MATH  Google Scholar 

  11. Reinelt G.: The Traveling Salesman-Computational Solutions for TSP Allocations, Lecture Notes in Computer Science 840. Springer, Berlin (1994)

    Google Scholar 

  12. Christofides, N.: Worst-case analysis of a new heuristic for the Traveling Salesman Problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)

  13. Malik W., Rathinam S., Darbha S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Oper. Res. Lett. 35(6), 747–753 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  14. Rathinam S., Sengupta R., Darbha S.: A resource allocation algorithm for multi-vehicle systems with non-holonomic constraints. IEEE Trans. Autom. Sci. Eng. 4(1), 98–104 (2007)

    Article  Google Scholar 

  15. Rathinam, S., Sengupta, R.: Lower and upper bounds for a multiple depot UAV Routing Problem. In: IEEE Control and Decision Conference, San Diego, California (2006)

  16. Rathinam S., Sengupta R.: 3/2-approximation algorithm for two variants for a 2-Depot, Hamiltonian path problem. Oper. Res. Lett. 38(1), 63–68 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  17. Xu, Z., Rodrigues, B.: A 3/2-approximation algorithm for multiple depot multiple traveling salesman problem, algorithm theory—SWAT 2010, Lecture Notes in Computer Science, Springer Berlin/Heidelberg vol. 6139, pp. 127–138 (2010)

  18. Yadlapalli, S., Rathinam, S., Darbha, S.: An approximation algorithm for a heterogenous, multiple vehicle, multiple travelling salesman problem. American Control Conference (2009)

  19. Menger K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96–115 (1927)

    MATH  Google Scholar 

  20. Grotschel M., Lovasz L., Schrijver A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MathSciNet  Google Scholar 

  21. Shmoys D.B., Williamson D.P.: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Inf. Process. Lett. 35(6), 281–285 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  22. Goemans M.X., Bertsimas D.: Survivable networks, linear programming relaxations and the parsimonius property. Math. Program. 60, 143–166 (1993)

    Article  MathSciNet  Google Scholar 

  23. Ford L.R. Jr., Fulkerson D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mechanical Engineering, Texas A & M University, College Station, TX, 77843, USA

    Sai Yadlapalli, Sivakumar Rathinam & Swaroop Darbha

Authors
  1. Sai Yadlapalli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sivakumar Rathinam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Swaroop Darbha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sivakumar Rathinam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yadlapalli, S., Rathinam, S. & Darbha, S. 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim Lett 6, 141–152 (2012). https://doi.org/10.1007/s11590-010-0256-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0256-0

Keywords

Search

Navigation