Skip to main content
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [List Home]
Re: [sumo-user] find top n fastest routes
1) sumo --weights.random-factor can be used to spread the detours around. However, there may be other issues that cause this effect: the rerouting device causes vehicles to reroute for perceived minuscule gains (https://github.com/eclipse/sumo/issues/4635) and it also has no concept of discounting future gains due to uncertainty (it will happily accept a wide detour under the assumption that this detour is free of traffic).
2) MAROUTER with a suitable OD matrix as input

Am Fr., 12. Juli 2019 um 22:30 Uhr schrieb Sasan Amini <sasan.amini@xxxxxx>:

Thank you Jakob. Actually, I wanted to solve two issues by finding n fastest routes. 1) reroute traffic in a stochastic manner  to a number of alternative routes instead of only the best route. The gaol is to avoid inducing too much traffic on the fastest route. In my experiment if I have more than 20% cars with navigation device the rerouting makes the congestion worse. 2) I wanted to measure the redundancy in the network by finding all possible paths for OD pairs. Any hints for these two?

 

Sasan

 

From: sumo-user-bounces@xxxxxxxxxxx [mailto:sumo-user-bounces@xxxxxxxxxxx] On Behalf Of Jakob Erdmann
Sent: Friday, 12 July 2019 08:54
To: Sumo project User discussions <sumo-user@xxxxxxxxxxx>
Subject: Re: [sumo-user] find top n fastest routes

 

TraCI does not allow to retrieve the list of n fastest routes.

Also, the n-fastest routes in a strict mathmatical sense are often not useful because they include minor variations on the fastest route (high overlap) rather than real alternatives (low overlap).

The marouter application can compute a set of route alternatives using the penalty-method (found paths are penalized to encourage alternative routes without overlap). This algorithm can also be reproduced via TraCI by dynamically adapting the edge traveltimes before calling findRoute.

 

regards,

Jakob

 

Am Do., 11. Juli 2019 um 15:55 Uhr schrieb Sasan Amini <sasan.amini@xxxxxx>:

Dear SUMO users,

 

I am trying to rank all possible routes from edge A to edge B according to their travel time or distance. I used traci.simulation.findRoute() but it only returns the fastest route. Any idea how to retrieve a list of n fastest routes?

 

Thanks,

Sasan

 

 

 

_______________________________________________
sumo-user mailing list
sumo-user@xxxxxxxxxxx
To change your delivery options, retrieve your password, or unsubscribe from this list, visit
https://www.eclipse.org/mailman/listinfo/sumo-user

_______________________________________________
sumo-user mailing list
sumo-user@xxxxxxxxxxx
To change your delivery options, retrieve your password, or unsubscribe from this list, visit
https://www.eclipse.org/mailman/listinfo/sumo-user

Back to the top