Hi apologize if this topic was already discussed. If so, could you please tell me where I can find such discussion?
We need to measure the performance of some traffic measures we are implementing using SUMO. These measures range from TL control to traffic assignment. In order to measure the performance, we would like to have a more or less constant nb of cars during the whole simulation time. If we use OD flows, then cars enter the network, travel, and leave. We can never have a more or less constant nb of them in the simulation. Using other methods also have drawbacks (e.g. random trips are too random ;-) ) and in any case all of them have the same issue namely that the network is empty in the beginning and in the end of the simulation. Question then is: is there something like the Nagel-Schreckenberg behavior in which cars are particles that decide probabilistically at each junction in which direction (which link) they continue to travel? This would ensure that all cars enter and stay there all the time, plus we could set the probabilities in each junction in a way that is based on real-world data (e.g., from coutings at the junctions). I appreciate if you could point me to some way to implement this behavior in SUMO if it exists. Thanks Ana ------------------------------------------------------------------------------ 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
