Modelling risk aversion using a disaggregate stochastic process model in congested transit networks
- 92 Downloads
Existing transit assignment models which either use equilibrium or stochastic processes assume full knowledge of the network. This assumption leads to an assignment process wherein passengers renounce their individual experiences to base their route choice on the collective experiences on each route. This seems unrealistic especially in a congested network in the absence of any external source of information. The fact that passengers failing to board a service of their choice experience a different level of reliability to a passenger being able to board the same needs to be acknowledged and a model, sensitive to the fact that reliability is an individual entity, needs to be explored. The stochastic process model proves to be one of the advantageous methods for countering the asymmetric non-separable nature of strict capacity constraint transit assignment, thereby making it a possible choice for modelling reliability. In the current paper such a ‘Reliability based disaggregate stochastic process model (R-DSPM)’ following the Markov principles with strict capacity constraints is proposed. The R-DSPM framework provides a stationary and ergodic process model. The model is implemented onto an example network and its sensitivity to various parameters is discussed along with a case study.
KeywordsStochastic process model Strict capacity constraint, transit assignment Reliability Risk aversion
The author acknowledges with gratitude the valuable suggestions of the supervisors Prof. David Watling and Dr. Chandra Balijepalli during the period of her PhD research (Seetharaman 2015) at the Institute for Transport Studies, University of Leeds, UK. The funding of Commonwealth Scholarship Commission-UK for this research is gratefully acknowledged along with thanks to Dr. S. Gangopadhyay, former Director CSIR-Central Road Research Institute, New Delhi, India, for granting study leave to pursue her PhD. Funding was provided by Commonwealth Scholarship Commission (Grant No. INCS- 2011-148).
- Ceder A (2007) Public transit planning and operation—theory, modelling and practice, Elsevier, OxfordGoogle Scholar
- De Cea CJ, Fernandez JE (1989) Transit assignment to minimal routes: an efficient new algorithm. Traffic Eng Control 30(10):491–494Google Scholar
- De Cea CJ, Bunster J, Zubleta L, Florian M (1988) Optimal strategies and optimal routes in public transit assignment models: an empirical comparison. Traffic Eng Control 29(10):520–526Google Scholar
- Schmoecker JD (2006) Dynamic capacity constrained transit assignment. Dissertation, University of LondonGoogle Scholar
- Seetharaman P (2015) Relaibility based disaggregate stocahstic process models with strict capacity constraint in congested transit networks. PhD Dissertation, University of Leeds, UKGoogle Scholar
- Teklu F (2008a) A Markov process model for capacity-constrained transit assignment. Dissertation, University of Leeds, UKGoogle Scholar
- Transport For London (2011) https://tfl.gov.uk/info-for/open-data-users/. Accessed 19 Dec 2014