[MAPSERVER-USERS] Routing Algorithm Confusion !

[Geo Aspects Development]

Ritesh,

FWIW a long time ago I wrote a route finding algorithm for a  
commercial desktop mapping product (Personal Navigator I think it was  
called)
At the time I decided on the A* algorithm - which seemed to work quite  
well on the UK road data 1:50000

I believe this is one of the algorithms available in the PgRouting  
package, although I haven't tested this implementation myself

regards
Tim


On May 16, 2008, at 1:38 AM, Ritesh Ambastha 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