[MAPSERVER-USERS] Routing Algorithm Confusion !

[Sandeep Kumar Jakkaraju]

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 large
number of nodes ...................

Thanks
Sandeep


On Fri, May 16, 2008 at 5:08 AM, Ritesh Ambastha <group.ritesh at gmail.com>
wrote:

>
> 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
> segments
> ~ 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:
> http://www.nabble.com/Routing-Algorithm-Confusion-%21-tp17264809p17264809.html
> Sent from the Mapserver - User mailing list archive at Nabble.com.
>
> _______________________________________________
> mapserver-users mailing list
> mapserver-users at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/mapserver-users
>



-- 
Thanks
Regards

Sandeep Kumar Jakkaraju
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/mapserver-users/attachments/20080516/bc205c55/attachment.html