I am planning to do a PhD in supply chain optimization. I want to solve a warehouse localization problem. I have 120 long, alt addresses in West Europe. I need to calculate distances when using a clustering algorithm, then use a grid to locate the best option for the warehouse. For this purpose I will need to calculate the distances approximately 120 thousand times. I think opensteetmap is the best option for this problem.
Can anybody provide some information from what to start? For now I have an algorithm made with Wolfram Mathematica, However I didn’t find any openstreetmap scripts that would work with this software.
Is there any finished application that I could use and communicate with it easily? E.g. googlemap api works, however it has a 2500 day limit and extra calculations would cost a lot.
3.Is it possible to use simply a web link, that wouldn’t have any limitations? Maybe someone could provide it and for a few days turn off the limits for my IP address?
- If no, how should I use openstreetmap to solve this problem? Do I need to download the osm planet file and write the code to return the distance between A and B, or is there any completed solutions? I would need to remake the algorithm with another programming language in this case.
I would be really grateful for any advice or help,
thank you in advanced