This is a detailed process description how you can build your own optimal route between different points on a map. It’s a description of how to route Ljubljana’s Space Invaders but it’s useful for all sorts of routing problems.
Step 1: Clean your data
I got locations in a Word files that used a number of different ways to describe each point:
So now we need to normalise the data and make sure that it’s computer readable. I’ve opted to manually go through all the links and build a Google Sheets table:
Step 2: Route the data
There’s not a lot of cheap affordable options online. There are developer interfaces but it seemed like too much work for a one-time thing. I ended up using RouteXL to calculate optimal route. It costs 5 EUR/day to input more than 20 addresses. So I paid that and pasted all 30 coordinates.
Step 3: Think about the data
Once you have a route you can then start thinking if it makes sense and if you need to put some more restrictions in the system. In my case there are far away points that would make more sense to be handled separately.
What I learned
It’s worth finding a small website that does that one thing well. I looked at Google Maps API’s and it would taken me so much longer than just paypaling a few euros.
Cleaning the data is always the most time consuming part.
It’s getting easier to do these kind of small single evening projects.
2 responses to “Finding optimal route between different points on a map”
I owe you, Jure! 🙂
Thank you for using our service and mentioning us in your article. Appreciated!