Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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 fine.
For example, I have 20 locations in the UK to visit, in any order. This may need to scale to hundreds of locations.
What sort of algorithm can I use, given that I can lookup distances (but don’t want to lookup hundreds of distances)?
I you are looking for a polynomial approximation for the Euclidean TSP, several algorithms have been suggested. Have a look here.