we need a program in .NET or Java which will calculate the shortest route between 2 points using Contraction Hierarchy. It should return multiple possible routes (3-4 minimum). we prefer in .NET (C#) but java will also work. The program should connect to postgress DB to get OSM (Open Street Map) data and calculate route. This needs to calculate route very fast some thing similar to OSRM (Open Street Routing Machine) and Graphhooper.
We can use OSRM but it has limitation like it does not return alternate path more than two. It does not take condition at query time/while calculating route. We are looking for a program where user can specify link/node to avoid/include like tool roads, specific road block due to construction etc. Above tools I mentioned work with static Graph/Files but we need this to work on postgress so dynamic conditions can be passed. Also route needs to be calculated based on current traffic speed instead of shortest path only. You need not worry about speed data we have that. We can provide posted speed and current speed against each way/link and you can use this for route calculation.
So overall we are looking for a program/algo similar to google route calculation API. This could be stand alone app running on server or function which we can embed in our another app which is being developed using c#, operlayers, postrgess, postGIS..
Feel free to shoot any questions you have. I will be happy to answer. Person with past experience in routing algorithm will be preferred. Person with c++ experience who can modify the OSRM code to suite our needs like use postgress data instead of static file, provide 3-4 routes instead of only max two can also bid.
Thanks for looking into this. Happy bidding. :)
Job Details Updated: Aug 15, 2015 at 8:45 am Change History »
Desired [url removed, login to view] Framework, Java, Geographic Information System (GIS), 956, routing
7 freelancere byder i gennemsnit $686 på dette job
Hi, Please feel free to discuss the project with me....................................................................................................... Thanks, Murtaza