TSP

[edit] TSP path length for random pointset in a square
Consider N points randomly distributed in a 1 x 1 square with N>>1.

Demo applet of a route planning algorithm solving TSP and VRPTW online
[edit] United Kingdom
Transport Planning Society
Transport Modelling.com
Transport Analysis Guidance
Design Manual for Roads and Bridges ...

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.
v.net.steiner ...

See also: Network, Route, Location, Environment, Analysis