[GIS] Seeking tools to calculate routing distance

openstreetmaproutingsoftware-recommendations

I'm working to a web application, and I need to calculate the routing distance (not the distance "as the crow flies") between a starting address and several final addresses. I don't need to render the routes on the map.

The application will have a lot of queries, so I can't use Google APIs and probably the best solution is to perform the task not with an external service, but on a local server.

I think the only way is to use OpenStreetMap.

Which tool can I use to perform the calculation?

At the moment geocoding (700 conversions daily) is performed by Google Maps and Nokia's HERE APIs. Do you recommend me some other tools also for this?
The number of daily point-to-point routing calculations are approximately 100,000

Best Answer

Actually you can use two tools, both are easy to install on your own server.

OSRM writen in C++ and Lua
GraphHopper if you prefer Java

Related Solutions

[GIS] Assessing OpenStreetMap coverage for international routing

There's no statistics on routing quality in different countries available, as far as I'm aware. The best thing you can do is try to measure things indirectly.

I organised a project to do this in the USA on OpenStreetMap during 2009. For full details see the 250 cities project on the OpenStreetMap wiki

First we measured how many of the 250 largest cities in the country were routable, in a large matrix of every possible start/finish point. Secondly, we found places where the outward/backward routes were significantly different lenghts. Then we looked at routes where the distance was greater than 1.4x of the great-circle route, as an indication of likely routing problems.

You could use a similar approach to estimate routing quality in your countries of interest. Your assumption that major cities and major roads are mapped first generally holds true for OpenStreetMap, in my experience.

[GIS] Improve performances on distance coverage routing – PostgreSQL

pgRouting driving_distance function returns not only vertex(node)_id, but also edge(link)_id and cost. (See Official document - 'Examples' part and yellow nodes/links of bellow image.) driving distance result image

So, I think that you can find red point efficiently from driving_distance result like...

for [edge(link) which is not listed in result and connect listed vertex(node)]
  calculate (distance - cost) point from (start/target) point

Best Answer

Related Solutions

[GIS] Assessing OpenStreetMap coverage for international routing

[GIS] Improve performances on distance coverage routing – PostgreSQL

Related Question