IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v9y2017i3d10.1007_s12469-017-0163-1.html
   My bibliography  Save this article

Modelling risk aversion using a disaggregate stochastic process model in congested transit networks

Author

Listed:
  • Padma Seetharaman

    (University of Leeds
    CSIR-Central Road Research Institute)

Abstract

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.

Suggested Citation

  • Padma Seetharaman, 2017. "Modelling risk aversion using a disaggregate stochastic process model in congested transit networks," Public Transport, Springer, vol. 9(3), pages 549-569, October.
    • Handle: RePEc:spr:pubtra:v:9:y:2017:i:3:d:10.1007_s12469-017-0163-1
    DOI: 10.1007/s12469-017-0163-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-017-0163-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-017-0163-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    2. Belgacem Bouzaïene-Ayari & Michel Gendreau & Sang Nguyen, 2001. "Modeling Bus Stops in Transit Networks: A Survey and New Formulations," Transportation Science, INFORMS, vol. 35(3), pages 304-321, August.
    3. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    4. Cepeda, M. & Cominetti, R. & Florian, M., 2006. "A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    5. Joaquín de Cea & Enrique Fernández, 1993. "Transit Assignment for Congested Public Transport Systems: An Equilibrium Model," Transportation Science, INFORMS, vol. 27(2), pages 133-147, May.
    6. Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
    7. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
    8. Guido Gentile & Sang Nguyen & Stefano Pallottino, 2005. "Route Choice on Transit Networks with Online Information at Stops," Transportation Science, INFORMS, vol. 39(3), pages 289-297, August.
    9. Cascetta, Ennio, 1989. "A stochastic process approach to the analysis of temporal dynamics in transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(1), pages 1-17, February.
    10. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    11. Watling, David, 2006. "User equilibrium traffic network assignment with stochastic travel times and late arrival penalty," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1539-1556, December.
    12. Philippe H. J. Marguier & Avishai Ceder, 1984. "Passenger Waiting Strategies for Overlapping Bus Routes," Transportation Science, INFORMS, vol. 18(3), pages 207-230, August.
    13. Bates, John & Polak, John & Jones, Peter & Cook, Andrew, 0. "The valuation of reliability for personal travel," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(2-3), pages 191-229, April.
    14. W. Burke Jackson & James V. Jucker, 1982. "An Empirical Study of Travel Time Variability and Travel Choice Behavior," Transportation Science, INFORMS, vol. 16(4), pages 460-475, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    2. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    3. Cortés, Cristián E. & Jara-Moroni, Pedro & Moreno, Eduardo & Pineda, Cristobal, 2013. "Stochastic transit equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 29-44.
    4. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    5. Trozzi, Valentina & Gentile, Guido & Bell, Michael G.H. & Kaparias, Ioannis, 2013. "Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 266-285.
    6. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    7. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    8. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    9. Cepeda, M. & Cominetti, R. & Florian, M., 2006. "A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    10. Du, Muqing & Chen, Anthony, 2022. "Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 175-202.
    11. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
    12. Khani, Alireza, 2019. "An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 549-564.
    13. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    14. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    15. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    16. Esteve Codina, 2013. "A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian," Transportation Science, INFORMS, vol. 47(2), pages 231-246, May.
    17. Agostino Nuzzolo & Francesco Russo & Umberto Crisalli, 2001. "A Doubly Dynamic Schedule-based Assignment Model for Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 268-285, August.
    18. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    19. Kenetsu Uchida & Agachai Sumalee & David Watling & Richard Connors, 2007. "A Study on Network Design Problems for Multi-modal Networks by Probit-based Stochastic User Equilibrium," Networks and Spatial Economics, Springer, vol. 7(3), pages 213-240, September.
    20. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:pubtra:v:9:y:2017:i:3:d:10.1007_s12469-017-0163-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.