Skip to main content
SpringerLink
Log in

Traveling Salesman Problem (TSP)

  • Reference work entry
Encyclopedia of GIS

  • 431 Accesses

Synonyms

Traveling salesperson problem; TSP; Hamiltonian cycle with the least weight

Definition

The traveling salesperson problem is a well studied and famous problem in the area of computer science. In brief, consider a salesperson who wants to travel around the country from city to city to sell his wares. A simple example is shown in Fig. 1.

Figure 1
figure 1

An example of a city map for the traveling salesman problem

Full size image

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

Recommended Reading

  1. Traveling Salesman Problem website supported by School of Industrial and Systems Engineering at Georgia Tech. http://www.tsp.gatech.edu/

  2. Wikipedia, Traveling Salesman Problem. http://en.wikipedia.org/

  3. Millennium Problems, The Clay Mathematics Institute of Cambridge, Massachusetts. http://www.claymath.org/millennium/

  4. Appletgate, D., Bixby, R., Chvátal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker‐Vereinigung International Congress of Mathematicians, (1998)

    Google Scholar 

  5. Fekete, S., Meijer, H., Rohe, A., Tietze, W.: Solving a Hard problem to approximate an Easy one: heuristics for maximum matchings and maximum traveling salesman problems. J. Exp. Algorithm. (JEA)7, (2002)

    Google Scholar 

  6. Barvinok, A., Fekete, S., Johnson, D., Tamir, A., Woeginger, G., Woodroofe, R.: The geometric maximum traveling salesman problem. J. ACM (JACM) 50:(5)3, (2003)

    Google Scholar 

  7. Krolak, P., Felts, W., Marble, G.: A man-machine approach toward solving the traveling salesman problem. Communications of the ACM 14:(5), (1971)

    Google Scholar 

  8. Papadimitriou, C., Steiglitz, K.: Some complexity results for the Traveling Salesman Problem. Proceedings of the eighth annual ACM symposium on Theory of computing, May (1976)

    Google Scholar 

  9. Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736–1936. Clarendon Press, Oxford (1976)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA

    Rhett Wilfahrt

  2. ESRI, Redlands, CA, USA

    Sangho Kim

Authors
  1. Rhett Wilfahrt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sangho Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Shashi Shekhar (McKnight Distinguished University Professor) (McKnight Distinguished University Professor)

  2. Management Science and Information Systems Department, Rutgers Business School Newark and New Brunswick Rutgers, the State University of New Jersey, Newark, NJ, 07102, USA

    Hui Xiong (Assistant Professor) (Assistant Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Wilfahrt, R., Kim, S. (2008). Traveling Salesman Problem (TSP). In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_1406

Download citation

Publish with us

Policies and ethics

Search

Navigation