Added to Favorites

Computing Dictionary

(TSP or "shortest path", US: "traveling") Given a set of towns and the distances between them, determine the shortest path starting from a given town, passing through all the other towns and returning to the first town.

This is a famous problem with a variety of solutions of varying complexity and efficiency. The simplest solution (the brute force approach) generates all possible routes and takes the shortest. This becomes impractical as the number of towns, N, increases since the number of possible routes is !(N-1). A more intelligent algorithm (similar to iterative deepening) considers the shortest path to each town which can be reached in one hop, then two hops, and so on until all towns have been visited. At each stage the algorithm maintains a "frontier" of reachable towns along with the shortest route to each. It then expands this frontier by one hop each time.

Pablo Moscato's TSP bibliography (http://densis.fee.unicamp.br/~moscato/TSPBIB_home.html). Fractals and the TSP (http://ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html).

(1998-03-24)

Explore Dictionary.com

Previous Definition: travelling salesman

Next Definition: travelling wave

Words Near: travelling salesman problem

More from Thesaurus.com

Synonyms and Antonyms for travelling salesman problem

More from Reference.com

Search for articles containing travelling salesman problem

More from Dictionary.com Translator

Translate travelling salesman problem into French

Translate travelling salesman problem into German

Translate travelling salesman problem into Italian

Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Nearby Words

Copyright © 2014 Dictionary.com, LLC. All rights reserved.