Skip to main content
SpringerLink
Log in

Implementation of a linear time algorithm for certain generalized traveling salesman problems

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1996)

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

Abstract

This paper discusses an implementation of a dynamic programming approach to the traveling salesman problem that runs in time linear in the number of cities. Optimality can be guaranteed when precedence constraints of a certain type are present, and many problems involving time windows fall into this class. Perhaps the most interesting feature of the procedure is that an auxiliary structure is built before any particular problem instance is known, reducing the computational effort required to solve a given problem instance to a fraction of what it would be without such a structure.

Research supported by Grant DMI-9201340 of the National Science Foundation and contract N00014-89-J-1063 of the Office of Naval Research.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Baker, “An Exact Algorithm for the Time-Constrained Traveling Salesman Problem.” Operations Research, 31, (1983) 938–945.

    Google Scholar 

  2. E. Balas, “New Classes of Efficiently Solvable Generalized Traveling Salesman Problems,” Management Science Research Report #MSRR-611, Graduate School of Industrial Administration, Carnegie Mellon University, March 1995.

    Google Scholar 

  3. M. Gendreau, A. Hertz, G. Laporte, M. Stan, “A Generalized Insertion Heuristics for the Traveling Salesman Problem with Time Windows.” Publication CRT-95-07, Centre de recherche sur les transports, Montréal, January 1995.

    Google Scholar 

  4. P. Kanellakis, C. Papadimiriou, “Local Search for the Traveling Salesman Problem.” Operations Research, 28, (1980) 1086–1099.

    Google Scholar 

  5. S. Lin, B. W. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem.” Operations Research, 21, (1973) 495–516.

    Google Scholar 

  6. J.-Y. Potvin, S. Bengio, “A Genetic Approach to the Vehicle Routing Problem with Time Windows.” Publication CRT-953, Centre de recherche sur les transports, Montréal, 1993.

    Google Scholar 

  7. B. Repetto Upper and Lower Bounding Procedures for the Asymmetric Traveling Salesman Problem. Ph.D. Thesis, GSIA, Carnegie Mellon University, April 1994.

    Google Scholar 

  8. B. Repetto, personal communication.

    Google Scholar 

  9. M. M. Solomon, “Algorithms for the Vehicle Routing and Scheduling with Time Windows Constraints.” Operations Research, 35, (1987) 254–265.

    MathSciNet  Google Scholar 

  10. J. Tama, personal communication.

    Google Scholar 

  11. United States Census Bureau, http://www.census.gov/cgi-bin/gazetteer

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Neil Simonetti & Egon Balas

Authors
  1. Neil Simonetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William H. Cunningham S. Thomas McCormick Maurice Queyranne

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simonetti, N., Balas, E. (1996). Implementation of a linear time algorithm for certain generalized traveling salesman problems. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-61310-2_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61310-7

  • Online ISBN: 978-3-540-68453-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation