Skip to content

faq 111547449

Billy Charlton edited this page Sep 5, 2018 · 2 revisions

Post Simulation Analysis of the shortest path between multiple Origin-Destination points

by Abdullah Binthunaiya on 2017-08-25 13:47:55


Hello,

I am trying to compare the shortest path between two points when all modes of travel are searched with the shortest path produced when searching only street network. I am also trying to do some comparisons of the generated shortest path at different levels of traffic loads.
I am in the process of simulating traffic based on two scenarios:1-  street network only (car mode) and 2- multimodal transportation network (car, train, walk).I have set of 30-pairs of origin-destination points. For each pair, I will simulate 50,000 trips (50,000 agents will depart origin to destination points).   I want to understand how agents follow the shortest route (time-dependent) when a public transportation system is available compared to only car mode.

Would you please suggest for me How to analyze the output of the simulation to get answers to the following:
1- for each pair of origin-destination points; what is the most followed route? And is it possible to write that route to a shapefile?
2- in every 5-minutes time slot, what is the count of agents that are using cars, using walking mode, and on train vehicles?
3- for each pair of origin-destination points, what is the distance followed by agents during a 5-minutes time slot, and average distances followed by all agents?
4- for each pair of origin-destination points, what is the average time of the trip during a 5-minutes time slot, and the average trip-time for all agents?
5- what is the run-time (average) needed to calculate the shortest route in the case of car mode, and in the case of multimode?

6- The average run-time to execute all plans for each pair of origin-destination points?


Comments: 0

Clone this wiki locally