[MAPSERVER-USERS] Routing Algorithm Confusion !
group.ritesh at gmail.com
Fri May 16 04:34:23 EDT 2008
Yeah I know that there are few algorithms exist to solve this case.
Please let me know few names(links) of good algorithms which are followed to
solve this problem
> I guess there are several research papers on fast/quick routing on road
> networks ... most of them modify dijkstra's ...
> there are citations on *parallel* dijkstra's if you want to scale ..to
> number of nodes ...................
> On Fri, May 16, 2008 at 5:08 AM, Ritesh Ambastha <group.ritesh at gmail.com>
>> Dear Readers,
>> I use Dijkstra's shortest path algorithm for route computation. I am
>> satisfied with the accurate result it gives. Still, I feel for road
>> ~ 200Million, the route computation will take a lot of time. So, is there
>> another algorithms exist as best practices for route computation(like
>> A*,TSP,etc)? Or, geeks write their own algorithm for route computation?
>> Thanks and Regards,
>> Ritesh Ambastha
>> View this message in context:
>> Sent from the Mapserver - User mailing list archive at Nabble.com.
>> mapserver-users mailing list
>> mapserver-users at lists.osgeo.org
> Sandeep Kumar Jakkaraju
> mapserver-users mailing list
> mapserver-users at lists.osgeo.org
View this message in context: http://www.nabble.com/Routing-Algorithm-Confusion-%21-tp17264809p17270028.html
Sent from the Mapserver - User mailing list archive at Nabble.com.
More information about the mapserver-users