Hello, 1. What is the major difference between the routing algorithms: dijkstra, and astar with respect to shortest path computation based on the current traffic volume and other road conditions? I ask because I get the same trip/travel time for both; when will I begin to see the difference i.e. in what road conditions/situations/scenarios. Are there other routing algorithms out there that can compute the shortest path based on other road/traffic conditions not considered by either dijkstra, and astar - how do I get them.
Thanks in anticipation of your response. ------------------------------------------------------------------------------ Subversion Kills Productivity. Get off Subversion & Make the Move to Perforce. With Perforce, you get hassle-free workflows. Merge that actually works. Faster operations. Version large binaries. Built-in WAN optimization and the freedom to use Git, Perforce or both. Make the move to Perforce. http://pubads.g.doubleclick.net/gampad/clk?id=122218951&iu=/4140/ostg.clktrk _______________________________________________ sumo-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sumo-user
