No open-access location is known for this record yet.
No open-access location is known for this record yet.
This report presents an improvement of an existing multipath transit assignment model. Multipath transit assignment models have been implemented in transportation planning software packages such as EMME/2. The use of approximate expressions for the expected waiting time at a node and the resulting ridership probabilities, however, raise doubts about the reliability of the results. The objective of this research is to improve the transit assignment model developed and implemented in the EMME/2 package. That approach presents the transit assignment problem with a fixed set of transit lines, where a traveler chooses the strategy that allows the desired destination to be reached at a minimum expected cost. Route choice is based on the concept of optimal strategies. The expressions in the model for waiting time at a node and for line probabilities do not replicate the behavior of uniform random passenger arrivals at a node for a set of fixed transit lines with constant headways. The exact expressions for waiting time and line probabilities are derived based on a theoretical framework involving basic probability functions and properties of constant inter-arrival distributions. A recursive solution is presented.
Loading…
Imported from OpenAlex (CC0) — nothing here is generated.