Hello, 1) marouter can compute alternative paths but tries to find 'true alternatives' in the sense of avoiding too much overlap between alternatives. For all possible paths you need to write your own algorithm. For finding the shortest path you can use duarouter or traci. There are also some python functions in tools (grep for dijkstra).
2) The individual assignments of edge weights is possible. It is somewhat simpler to conflate costs with travel times and set custom travel times for each edge but it is also possible to set costs independently of travel times and route by costs (this makes sense if costs change over time while driving). See http://sumo.dlr.de/wiki/Simulation/Routing regards, Jakob 2017-05-01 17:01 GMT+02:00 Ankur Sarker <[email protected]>: > Hi, > > Is there any way I can track down all possible paths from source edge to > destination edge? I guess there is an option for finding the shortest path. > > I have another question, is it possible to add extra metric of an edge? I > want to set some extra things of an edge like travelling time, travelling > cost, energy consumption. > > Thanks for your time! > > Best, > A. Sarker > ------------------------------------------------------------ > ------------------ > Check out the vibrant tech community on one of the world's most > engaging tech sites, Slashdot.org! http://sdm.link/slashdot > _______________________________________________ > sumo-user mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/sumo-user > ------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot _______________________________________________ sumo-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sumo-user
