Is the duarouter downloaded with SUMO using the Dijkstra algorithm or Gawron's Algorithm?
I am asking this question because I have many deadlocks in my map where vehicles after few seconds are blocked and many vehicles need to be teleported before having a "normal" situation. I have read that doing many iterations of Gawron's algorithm evitate these deadlocks however I am using duaIterate.py to generate all the trips before launching the simulation and I am still getting these deadlocks: is it a problem of duarouter or is there a way to change the trips during the simulation if one deadlock/congestion point is identified during the simulation. Thank you! ------------------------------------------------------------------------------ CenturyLink Cloud: The Leader in Enterprise Cloud Services. Learn Why More Businesses Are Choosing CenturyLink Cloud For Critical Workloads, Development Environments & Everything In Between. Get a Quote or Start a Free Trial Today. http://pubads.g.doubleclick.net/gampad/clk?id=119420431&iu=/4140/ostg.clktrk _______________________________________________ sumo-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sumo-user
