Plotting The Optimal Walking Route
Q. I have a question about planning a hill walking route. I need to plan a route that hits a defined group of locations spread across a forest. I have google map and DDM coordinates for each coordinates. There are paths between them all but there are probably a lot of different ways I could walk round the route, but I do want to stick to the paths. How do I plot a route round the locations that is optimal for minimising the distance round them, even if it means hitting the same location twice?
The Geocacher, Falkirk