Skip to main content
SpringerLink
Log in
Book cover

Workshop on Combinatorial and Algorithmic Aspects of Networking

CAAN 2006: Combinatorial and Algorithmic Aspects of Networking pp 86–97Cite as

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4235))

Abstract

In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heuristic. Our improvement is based on replacing the selection of each path to be contracted after deleting a heaviest arc from each short cycle in an Optimal Assignment Problem Solution (OAPS) by contracting a single arc from a short cycle in an OAPS with the largest upper tolerance with respect to one of the relaxed ATSP. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2002)

    MATH  Google Scholar 

  2. Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. European J. Oper. Res. 129, 555–568 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Goldengorin, B., Jäger, G.: How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Competitive, SOM Research Report 05A11, University of Groningen, Groningen, The Netherlands (2005), http://som.eldoc.ub.rug.nl/reports/themeA/2005/05A11/05A11.pdf

  4. Goldengorin, B., Jäger, G., Molitor, P.: Some Basics on Tolerances. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 194–206. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Goldengorin, B., Jäger, G., Molitor, P.: Tolerances Applied in Combinatorial Optimization. J. Comput. Sci. 2(9), 716–734 (2006)

    Article  Google Scholar 

  6. Goldengorin, B., Sierksma, G., Turkensteen, M.: Tolerance Based Algorithms for the ATSP. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 222–234. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Greenberg, H.J.: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp. 97–148. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  8. Gutin, G., Yeo, A., Zverovich, A.: Traveling salesman should not be greedy: domination analysis of greedy type heuristics for the TSP. Discrete Appl. Math. 117, 81–86 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gutin, G., Zverovich, A.: Evaluation of the contract-or-patch heuristic for the Asymmetric TSP. INFOR. 43(1), 23–31 (2005)

    Google Scholar 

  10. Held, M., Karp, R.: The Traveling-Salesman Problem and Minimum Spanning Trees. Oper. Res. 18, 1138–1162 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  11. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European J. Oper. Res. 126, 106–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations Experimental, ch. 10, pp. 445–489. Kluwer, Dordrecht (2002)

    Google Scholar 

  13. Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing 38, 325–340 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Karp, R.M.: The probabilistic analysis of some combinatorial search algorithms. In: Traub, J.F. (ed.) Algorithms and Complexity: New Directions and Recent Results, pp. 1–19. Academic Press, New York (1976)

    Google Scholar 

  15. Karp, R.M.: A patching algorithm for the non-symmetric traveling salesman problem. SIAM J. Comput. 8, 561–573 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  16. Libura, M.: Sensitivity analysis for minimum hamiltonian path and traveling salesman problems. Discrete Appl. Math. 30, 197–211 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Reinelt, G.: TSPLIB – a Traveling Salesman Problem Library. ORSA J. Comput. 3, 376–384 (1991)

    MATH  Google Scholar 

  18. Turkensteen, M., Ghosh, D., Goldengorin, B., Sierksma, G.: Tolerance-Based Branch and Bound Algorithms. In: Maroto, C., Esmap, S.L., et al. (eds.) Proceedings of a EURO conference for young OR researches and practitioners, ORP3 2005, Valencia, Spain, September 6-10, pp. 171–182 (2005)

    Google Scholar 

  19. Volgenant, A.: An addendum on sensitivity analysis of the optimal assignment. European J. Oper. Res. 169, 338–339 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economic Sciences, University of Groningen, 9700 AV, Groningen, The Netherlands

    Boris Goldengorin

  2. Department of Applied Mathematics, Khmelnitsky National University, Ukraine

    Boris Goldengorin

  3. Computer Science Institute, University of Halle-Wittenberg, D-06099, Halle (Saale), Germany

    Gerold Jäger & Paul Molitor

Authors
  1. Boris Goldengorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerold Jäger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Molitor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldengorin, B., Jäger, G., Molitor, P. (2006). Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. In: Erlebach, T. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2006. Lecture Notes in Computer Science, vol 4235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922377_8

Download citation

  • DOI: https://doi.org/10.1007/11922377_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48822-4

  • Online ISBN: 978-3-540-48824-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation