Skip to main content
SpringerLink
Log in

The Traveling Salesman

Computational Solutions for TSP Applications

  • Book
  • © 1994

Overview

Authors:
  1. Gerhard Reinelt

    1. Institut für Angewandte Mathematik, Universität Heidelberg, Heidelberg, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 840)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Introduction

    Pages 1-3

  3. Basic Concepts

    Pages 4-30

  4. Related Problems and Applications

    Pages 31-41

  5. Geometric Concepts

    Pages 42-63

  6. Candidate Sets

    Pages 64-72

  7. Construction Heuristics

    Pages 73-99

  8. Improving Solutions

    Pages 100-132

  9. Heuristics for Large Geometric Problems

    Pages 133-152

  10. Further Heuristic Approaches

    Pages 153-160

  11. Lower Bounds

    Pages 161-186

  12. A Case Study: TSPs in Printed Circuit Board Production

    Pages 187-199

  13. Practical TSP Solving

    Pages 200-210

  14. Back Matter

    Pages 211-223
    Download chapter PDF
Back to top

Keywords

About this book

Still today I am receiving requests for reprints of the book, but unfortunately it is out of print. Therefore, since the book still seems to receive some attention, I p- posed to Springer Verlag to provide a free online edition. I am very happy that Springer agreed. Except for the correction of some typographical errors, the online edition is just a copy of the printed version, no updates have been made. In particular, Table 13.1 gives the status of TSPLIB at the time of publishing the book. For accessing TSPLIB the link http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/ should be used instead of following the procedure described in Chapter 13. Heidelberg, January 2001 Gerhard Reinelt Preface More than ?fteen years ago, I was faced with the following problem in an assignment for a class in computer science. A brewery had to deliver beer to ?ve stores, and the task was to write a computer program for determining the shortest route for the truck driver to visit all stores and return to the brewery. All my attemps to ?nd a reasonable algorithm failed, I could not help enumerating all possible routes and then select the best one.

Reviews

"Without any doubt, I can recommend this book, both for practitioners as well as researchers, since it gives a concise and crisp overview of the heuristical approach to solving the TSP." OPTIMA

Authors and Affiliations

  • Institut für Angewandte Mathematik, Universität Heidelberg, Heidelberg, Germany

    Gerhard Reinelt

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation