What is a practical solution to the Travelling Salesman problem, using Google Maps / geolocation / route finding?
I don\'t need the best solution, within 5% would be
you can use long lat to estimated roughly how far apart the locations are, then make a few lookups for those that are nearby each other.
a simpler alternative is to separate your map into 3 x 3 sections. Only look up routes for locations in adjacent sections.
these techniques aren't 100% accurate though.
And even if you look up all the paths, you should end up with no more than 190 lookups.