DougPaul
Well-known member
This is known as the traveling salesman problem (find the shortest route to visit a list of cities) in the computational world. It is an NP-complete problem (very difficult to solve). http://en.wikipedia.org/wiki/Travelling_salesman_problemFolsom did it in more than one "trip" but his claim to fame was more about figuring out what the shortest route to include all peaks was (hence the name) rather than just doing it the fastest.
At the time I was interested in choosing the optimal Diretissima route from a GIS network analysis perspective(
There are closed loop (start and finish in the same spot) and open loop (start and finish in different spots) versions.
Doug