[1] : The Free On-line Dictionary of Computing (27 SEP 03)

travelling salesman problem
     
         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://www.densis.fee.unicamp.br/~moscato/tspbib_home.html.
        fractals and the tsp
        http://www.ing.unlp.edu.ar/cetad/mos/fractal_tsp_home.html.
     
        1998-03-24
     
     
see also:
brute force algorithm iterative deepening lt;pablo moscato's tsp bibliographygt; lt;fractals and the tspgt; 

Travelling >> T Words
Travelling, definition of term: Travelling
travelling_pag1.html

Problem >> P Words
Problem, definition of term: Problem
problem_pag1.html

Salesman >> S Words
Salesman, definition of term: Salesman
salesman_pag1.html

Problem Solving >> P Words
Problem Solving, definition of term: Problem Solving
problem+solving_pag1.html

Health Problem >> H Words
Health Problem, definition of term: Health Problem
health+problem_pag1.html

TSPBIB Home Page
...The Circulant Travelling Salesman Problem (CTSP) is the problem of ... salesman selection problem. (TSSP) is introduced. The problem is ... ..
http://www.densis.fee.unicamp.br/~moscato/TSPBIB_home.html, score=100, date indexed=January 19, 2006, 10:40 pm

The Travelling Salesman Problem
...... Travelling Salesman Problem (TSP) is a deceptively simple ... problem. It can be stated very simply: A salesman spends his time ... ..
http://www.pcug.org.au/~dakin/tsp.htm, score=87, date indexed=January 20, 2006, 5:03 am

Travelling Salesman Problem Using Genetic Algorithms
...In the Travelling Salesman Problem, the goal is to find the shortest ... are two basic steps to solving the travelling salesman problem using a ... ..
http://www.lalena.com/ai/tsp/, score=44, date indexed=December 21, 2005, 2:08 am

Fractal Instances of the Traveling Salesman Problem
...Rectifiable sets and the Travelling Salesman Problem, P.W. Jones, ... The Euclidean Traveling Salesman Problem and a Space-Filling Curve , M ... ..
http://www.ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html, score=30, date indexed=November 4, 2005, 3:42 pm

Traveling Salesman Problem
...... Salesman Problem wd(menu_link('The Problem', 'problem/index.html')); wd(menu_link('History of TSP', 'history/index.html')); wd(menu_link('Solving the TSP', 'methods/index.html')); wd(menu_link('Applications', 'apps/index.html')); wd(menu_link('Optimal Tours', 'optimal/index.html')); wd(menu_link('Concorde', 'concorde/index.html')); wd(menu_link('TSP Gallery', 'gallery/index.html')); wd(menu_link('Test Data', 'data/index.html')); html(); wd(postcard('Proctor and Gamble\'s. 1962 TSP Contest', 'img/car54_ ..
http://www.tsp.gatech.edu/index.html, score=28, date indexed=December 30, 2005, 9:07 pm

Page 1 2 3 Next