For those who like math (not me!) there is this well known mathematical problem called the “Traveling Salesman Problem”, which is how do you
calculate the shortest route between multiple destinations.
Well this Google maps mash-up claims to have solved it. It is very easy to use – to add locations, simply left-click the map. The first location you
add is considered to be the start and end of your journey. To remove a location, click its marker. If more than nine locations are specified, a heuristic method is used rather than trying all possible routes. This means that there is no guarantee that the optimal solution is found.
For a more detailed explanation go here.
Baron Conway
Comments
Connections