In reply to Deadeye:
I don't think it would be easy to do it with a "machine algorithm". I'm not saying it would be impossible, but it certainly isn't an easy problem to minimise a function of distance and ascent with 214 nodes. It is like a two dimensional version of the travelling salesman problem, more details here.
https://en.wikipedia.org/wiki/Travelling_salesman_problem
I'm intrigued by this quote from Wikipedia "It has been observed that humans are able to produce near-optimal solutions[to the travelling salesman problem] quickly, in a close-to-linear fashion, with performance that ranges from 1% less efficient for graphs with 10-20 nodes, and 11% more efficient for graphs with 120 nodes" Surely it's not saying that humans can produce near optimal solutions 11% quicker than computers?