there is currently no tool for directly computing alternative paths in SUMO. One way to accomplish this would be to randomly disturb edge weights and compute the shortest path on these disturbed weights.
2014-12-19 9:07 GMT+01:00 Vidura Amarakoon <[email protected]>: > Is it possible to find possible paths between two junctions not > necessarily the shortest path using duarouter ?. What I want to do is when > a vehicle predicts a congested road it will by pass only that road section. > Then it will continue on the same path. So I need to consider two or three > alternative roads to bypass. Duarouter seems only find the shortest path. > > On Mon, Dec 8, 2014 at 2:06 PM, Jakob Erdmann <[email protected]> > wrote: >> >> bad_allow00 sounds like a memory problem. Try to use the 64bit version >> (the 32bit version can only address 2gb of RAM). >> https://sourceforge.net/projects/sumo/files/sumo/version%200.22.0/ >> >> >> Here is the old mail for reference: >> >> sumo (0.22.0) can do this automatically for you: >> >> http://sumo.dlr.de/wiki/Definition_of_Vehicles,_Vehicle_Types,_and_Routes#Incomplete_Routes_.28trips_and_flows.29 >> you can get the computed route using option --vehroute-output >> or duarouter >> http://sumo.dlr.de/wiki/Demand/Shortest_or_Optimal_Path_Routing >> or TraCI >> http://sumo.dlr.de/wiki/TraCI/Change_Vehicle_State >> >> regards, >> Jakob >> >> 2014-11-24 10:19 GMT+01:00 Vidura Amarakoon <[email protected]>: >> Hi, >> >> Is there a way to find the shortest path given two nodes ?. I want to get >> a >> list of edges in between . >> >> 2014-12-06 2:46 GMT+01:00 Vidura Amarakoon <[email protected]>: >> >>> Sorry for asking the same question. I couldn't find the previous post. >>> Anyway I tried duarouter but it gave me this error. >>> std::bad_alloc00 >>> >>> The command I used >>> duarouter --flows flow.xml -n cologne.net.xml >>> --output-file=MySUMORoutes.rou.xml >>> >>> flow.xml >>> >>> <flows> >>> <flow id="0" from="-28984893#2" to="-189909525#2" probability='1'/> >>> </flows> >>> >>> I can't paste cologne file here. Whats the reason for the error . I have >>> a 4gb RAM. >>> >>> On Sat, Dec 6, 2014 at 1:20 AM, Jakob Erdmann < >>> [email protected]> wrote: >>> >>>> You appear to be asking the same question as in november. The same >>>> answers still apply. >>>> >>>> 2014-12-05 19:28 GMT+01:00 Vidura Amarakoon <[email protected]>: >>>> >>>>> Hi, >>>>> >>>>> I have a xxx.net.xml file. I want to find a shortest path(by distance) >>>>> between two edges(E1......En) in that map. How to achieve this. I want >>>>> to >>>>> get a set of edges in the shortest path. >>>>> >>>>> Thanks. >>>>> >>>>> ------------------------------------------------------------------------------ >>>>> Download BIRT iHub F-Type - The Free Enterprise-Grade BIRT Server >>>>> from Actuate! Instantly Supercharge Your Business Reports and >>>>> Dashboards >>>>> with Interactivity, Sharing, Native Excel Exports, App Integration & >>>>> more >>>>> Get technology previously reserved for billion-dollar corporations, >>>>> FREE >>>>> >>>>> http://pubads.g.doubleclick.net/gampad/clk?id=164703151&iu=/4140/ostg.clktrk >>>>> _______________________________________________ >>>>> sumo-user mailing list >>>>> [email protected] >>>>> https://lists.sourceforge.net/lists/listinfo/sumo-user >>>>> >>>> >>>> >>> >> ------------------------------------------------------------------------------ Download BIRT iHub F-Type - The Free Enterprise-Grade BIRT Server from Actuate! Instantly Supercharge Your Business Reports and Dashboards with Interactivity, Sharing, Native Excel Exports, App Integration & more Get technology previously reserved for billion-dollar corporations, FREE http://pubads.g.doubleclick.net/gampad/clk?id=164703151&iu=/4140/ostg.clktrk _______________________________________________ sumo-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sumo-user
