Thanks a lot Jakob. From: [email protected] <[email protected]> On Behalf Of Jakob Erdmann Sent: March 7, 2020 4:51 PM To: Sumo project User discussions <[email protected]> Subject: Re: [sumo-user] Shortest Path for OD pair database and heatmap
see https://github.com/eclipse/sumo/blob/master/tests/duarouter/trips/geoTrips_lonLat/input_trips.trips.xml Am Fr., 6. März 2020 um 18:54 Uhr schrieb Akhil Raj Kizhakkan <[email protected]<mailto:[email protected]>>: Thank you Jakob, I am sure your suggestions will cover each step of my work. Thanks a lot for them. As I am new to using SUMO, it would clarify the input flow if I could take a look at any of the project code base that involves trip file as input. Please provide any repository links that has a similar input. Thanks in advance, Akhil From: [email protected]<mailto:[email protected]> <[email protected]<mailto:[email protected]>> On Behalf Of Jakob Erdmann Sent: March 6, 2020 3:45 AM To: Sumo project User discussions <[email protected]<mailto:[email protected]>> Subject: Re: [sumo-user] Shortest Path for OD pair database and heatmap Hello you can prepare your input in the form <trip id="RUNNING_NUMBER" fromLonLat="..." toLonLat="..." depart="0"/> Speed up your routing by using duarouter option --bulk-routing You can process the resulting route file with https://sumo.dlr.de/docs/Tools/Routes.html#showdepartsandarrivalsperedge (use option --intermediate) The resulting edgeData file (number of times each edge was used) can be visualized directly in SUMO-GUI: https://sumo.dlr.de/docs/SUMO-GUI.html#visualizing_edge-related_data regards, Jakob Am Fr., 6. März 2020 um 04:07 Uhr schrieb Akhil Raj Kizhakkan <[email protected]<mailto:[email protected]>>: Hello SUMO Community, I am trying to use to SUMO for an urban planning project, involving generating a heatmap (normalized traffic usage statistics) for each segment of road network, based on Origin-Destination Pairs (database of Latitude-Longitude) traffic data. Below is how I am trying to get it done. 1. Find optimal route from Origin(O) to Destination(D) through the network.(could be just origin node to destination node, expected output to contain Segment to Segment routing instruction as path, like <route id="route01" edges="D2 L2 L12 L10 L7 D7"/>) 2. Append each route generated in a trips file. 3. Analyse the above trip file (Step. 2) to score each segment of my network based on the number of time it was used in shortest routes. 4. Normalize the total number of trips on each segment to rank the segments from most used to least. 5. Plot a heat map for results from Step.4 (Any graphical tool suggestions ?) Any leads/examples/tutorials to carry out any of the steps mentioned above would be of great help. Many thanks in advance. I could find among documentations that SUMO uses Dijikstra algorithm based router to calculate the shortest route, but I failed to find the relevant information on how to implement this. An example function call to shortest path router with Origin and Destination as inputs would be greatly appreciated. Regards, Akhil Raj Kizhakkan Research Student Concordia University _______________________________________________ sumo-user mailing list [email protected]<mailto:[email protected]> 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 [email protected]<mailto:[email protected]> 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 [email protected] To unsubscribe from this list, visit https://www.eclipse.org/mailman/listinfo/sumo-user
