Skip to main content
SpringerLink
Log in

Approximation algorithms for multiple terminal, Hamiltonian path problems

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

Abstract

This article presents a new 2-approximation algorithm for a multiple depot, multiple terminal, Hamiltonian path problem when the costs satisfy the triangle inequality. For the case where all the salesmen start from the same depot, we present another algorithm with an approximation ratio of \({\frac{5}{3}}\). These results generalize the approximation algorithms currently available for the single depot, single terminal Hamiltonian path problem.

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. Pardalos, P.M. (ed.): Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer, Dordrecht (2000)

    MATH  Google Scholar 

  2. Vazirani V.: Approximation Algorithms, second printing. Springer, Berlin (2002)

    Google Scholar 

  3. Pardalos, P.M. (ed.): Complexity in Numerical Optimization. World Scientific, Singapore (1993)

    MATH  Google Scholar 

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

    Google Scholar 

  5. 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, New York (2009)

    Chapter  Google Scholar 

  6. Gutin G.: Traveling salesman problem. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3935–3944. Springer, New York (2009)

    Chapter  Google Scholar 

  7. 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, PA (1976)

  8. Hoogeveen J.A.: Analysis of christofides’ heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10, 291–295 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Guttmann-Beck N., Hassin R., Khuller S., Raghavachari B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. 1998 FST&TCS conference (Madras, India). Algorithmica 28, 422–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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)

  11. 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 

  12. 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)

  13. Brezovec C., Cornuejols G., Glover F.: A matroid algorithm and its application to the efficient solution of two optimization problems on graphs. Math. Prog. 42, 471–487 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Frieze A.M.: An extension of Christofides heuristic to the k-person travelling salesman problem. Discrete Appl. Math. 6, 79–83 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  15. Rathinam S., Sengupta R.: \({\frac{3}{2}}\)-Approximation algorithm for variants of a 2-depot, Hamiltonian path problem. Oper. Res. Lett. 38, 63–68 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  16. 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, vol. 6139, pp. 127–138. Springer, Berlin (2010)

  17. Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publishers, Mineola (1998)

    MATH  Google Scholar 

  18. Papadimitriou C.H., Vazirani U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231–246 (1984)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  20. Cerdeira J.O.: Matroids and a forest cover problem. Math. Program. 66, 403–405 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  21. 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 

  22. Edmonds J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand 69B, 125–130 (1965)

    MathSciNet  Google Scholar 

  23. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (1990)

Download references

Author information

Authors and Affiliations

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

    Jungyun Bae & Sivakumar Rathinam

Authors
  1. Jungyun Bae
    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

Corresponding author

Correspondence to Sivakumar Rathinam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bae, J., Rathinam, S. Approximation algorithms for multiple terminal, Hamiltonian path problems. Optim Lett 6, 69–85 (2012). https://doi.org/10.1007/s11590-010-0252-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0252-4

Keywords

Search

Navigation