Traveling salesman problem

traveling salesman problemThis is a classic tourproblem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each.

Traveling Salesman Problem at Georgia Tech
Traveling Salesman Problem by Jon McLoone based on a program by Stephen Wolfram, after work by Stan Wagon, Wolfram Demonstrations Project.

This is the solution to the traveling salesman problem. ArcInfo provides a heuristic solution to the traveling salesman problem by ordering the stops and then finding the least-cost path which visits them.

salesman - Create a cycle connecting given nodes (Traveling salesman problem). Note that TSP is NP-hard, heuristic algorithm is used by this module and created cycle may be sub optimal.
KEYWORDS
vector, networking
SYNOPSIS
v.net.

Minimum spanning tree
Route inspection problem (also called the "Chinese Postman Problem")
Seven Bridges of Königsberg
Shortest path problem
Steiner tree
Three cottage problem
Traveling salesman problem (NP-Complete) ...

these companies use and carry out include the simulation of flows in complex networks, load balancing in electrical distribution, traffic analysis, computation of pressure loss in water lines, maximum flow analysis, traveling salesman problem, ...

See also: Network, Algorithm, Map, Location, Route