Skip to main content
SpringerLink
Log in

On patching algorithms for random asymmetric travelling salesman problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

Let the arc-lengthsL ij of a complete digraph onn vertices be independent uniform [0, 1] random variables. We consider the patching algorithm of Karp and Steele for the travelling salesman problem on such a digraph and give modifications which tighten the expected error. We extend these ideas to thek-person travelling salesman problem and also consider the case where cities can be visited more than once.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Angluin and L.G. Valient, “Fast probabilistic algorithms for hamilton circuits and matchings,”Journal of Computer and System Sciences 18 (1979) 155–193.

    Google Scholar 

  2. E. Balas and P. Toth, “Branch and bound methods,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Travelling Salesman Problem (Wiley, Chichester, UK, 1984) pp. 361–401.

    Google Scholar 

  3. G.N. Frederickson, M.S. Hecht and C.E. Kim, “Approximation algorithms for some routing problems,”SIAM Journal on Computing 7 (1978) 178–193.

    Google Scholar 

  4. A.M. Frieze and G.R. Grimmett, “The shortest path problem for graphs with random arc-lengths,”Discrete Applied Mathematics 10 (1985) 57–77.

    Google Scholar 

  5. W. Hoeffding, “Probability inequalities for sums of bounded random variables,”Journal of the American Statistical Association 58 (1963) 13–30.

    Google Scholar 

  6. R.M. Karp, “A patching algorithm for the non-symmetric travelling salesman problem,”SIAM Journal on Computing 8 (1979) 561–573.

    Google Scholar 

  7. R.M. Karp and J.M. Steele, “Probabilistic analysis of heuristics,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Travelling Salesman Problem (Wiley, Chichester, UK, 1984) pp. 181–205.

    Google Scholar 

  8. E.L. Lawler,Combinatorial Optimisation: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).

    Google Scholar 

  9. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Travelling Sales Problem (Wiley, Chichester, UK, 1984).

    Google Scholar 

  10. C.H. Papidimitrious and K. Steiglitz,Combinatorial Optimisation: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leeds University, Leeds, England

    M. E. Dyer

  2. Carnegie-Mellon University, 15213-3890, Pittsburgh, PA, USA

    A. M. Frieze

Authors
  1. M. E. Dyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyer, M.E., Frieze, A.M. On patching algorithms for random asymmetric travelling salesman problems. Mathematical Programming 46, 361–378 (1990). https://doi.org/10.1007/BF01585751

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585751

Key words

Search

Navigation