I guess there are several research papers on fast/quick routing on road networks ... most of them modify dijkstra's ...<br>there are citations on <b>parallel</b> dijkstra's if you want to scale ..to large number of nodes ...................<br>
<br>Thanks<br>Sandeep<br><br><br><div class="gmail_quote">On Fri, May 16, 2008 at 5:08 AM, Ritesh Ambastha <<a href="mailto:group.ritesh@gmail.com">group.ritesh@gmail.com</a>> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br>
Dear Readers,<br>
<br>
I use Dijkstra's shortest path algorithm for route computation. I am<br>
satisfied with the accurate result it gives. Still, I feel for road segments<br>
~ 200Million, the route computation will take a lot of time. So, is there<br>
another algorithms exist as best practices for route computation(like<br>
A*,TSP,etc)? Or, geeks write their own algorithm for route computation?<br>
<br>
Thanks and Regards,<br>
Ritesh Ambastha<br>
<font color="#888888">--<br>
View this message in context: <a href="http://www.nabble.com/Routing-Algorithm-Confusion-%21-tp17264809p17264809.html" target="_blank">http://www.nabble.com/Routing-Algorithm-Confusion-%21-tp17264809p17264809.html</a><br>
Sent from the Mapserver - User mailing list archive at Nabble.com.<br>
<br>
_______________________________________________<br>
mapserver-users mailing list<br>
<a href="mailto:mapserver-users@lists.osgeo.org">mapserver-users@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/mapserver-users" target="_blank">http://lists.osgeo.org/mailman/listinfo/mapserver-users</a><br>
</font></blockquote></div><br><br clear="all"><br>-- <br>Thanks<br>Regards<br><br>Sandeep Kumar Jakkaraju