IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v34y2000i5p377-402.html
   My bibliography  Save this article

A stochastic transit assignment model considering differences in passengers utility functions

Author

Listed:
  • Nielsen, Otto Anker

Abstract

The paper presents a framework for public traffic assignment that builds on the probit-based model of Sheffi and Powell [Sheffi, Y., Powell, W.B., 1981. A comparison of stochastic and deterministic traffic assignment over congested networks. Transportation Res. B. 15 (1), 53-64; Sheffi, Y., Powell, W.B., 1982. An algorithm, for the equilibrium assignment problem with random link Times. Networks 12 (2), 191-207.]. Hereby, the problems with overlapping routes that occur in many public transport models can be avoided. The probit-based model with modifications similar to the principles in Nielsen [Nielsen, O.A., 1996. Do stochastic traffic assignment models consider differences in road users utility functions? Twentyfourth European Transport Forum (PTRC Annual Meeting). London, UK, Seminar M.] is used as a starting point. This makes it possible to describe passengers' different preferences towards different sub-modes and against transfers. This also considers dependencies of choices through chains of sub-modes. The simulation of perceived travel times is extended to describe differences in the distribution of travel- and waiting times for different sub-modes. Parallel lines are frequency aggregated in order to handle waiting times appropriately. Initial tests on a full-scale case show that the methodology can describe route choices in public transport very well. This is both due to the model's ability to describe overlapping routes and due to the many different coefficients, error components and distributions that make it possible to calibrate the model. In practice, the many parameters might also be the main weakness, since this complicates the calibration. At the end of the paper, proposals to coefficients are presented based on a Danish SP-analysis. This demonstrated the applicability of the method.

Suggested Citation

  • Nielsen, Otto Anker, 2000. "A stochastic transit assignment model considering differences in passengers utility functions," Transportation Research Part B: Methodological, Elsevier, vol. 34(5), pages 377-402, June.
    • Handle: RePEc:eee:transb:v:34:y:2000:i:5:p:377-402
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(99)00029-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Sheffi, Yosef & Powell, Warren, 1981. "A comparison of stochastic and deterministic traffic assignment over congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 15(1), pages 53-64, February.
    2. Warren B. Powell & Yosef Sheffi, 1982. "The Convergence of Equilibrium Algorithms with Predetermined Step Sizes," Transportation Science, INFORMS, vol. 16(1), pages 45-55, February.
    3. 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.
    4. 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.
    5. 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.
    6. Watling, David, 1996. "Asymmetric problems and stochastic process models of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 339-357, October.
    7. Ben-Akiva, M. & Bolduc, D. & Bradley, M., 1993. "Estimation of Travel Choice Models with Randomly Distributed Values of Time," Papers 9303, Laval - Recherche en Energie.
    8. 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.
    9. Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
    10. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    11. Giulio Erberto Cantarella, 1997. "A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand," Transportation Science, INFORMS, vol. 31(2), pages 107-128, May.
    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. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    2. 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).
    3. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, 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. Massimo Gangi & Giulio E. Cantarella & Antonino Vitetta, 2019. "Solving stochastic frequency-based assignment to transit networks with pre-trip/en-route path choice," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 661-681, December.
    6. 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.
    7. 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.
    8. 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.
    9. García, Ricardo & Marín, Angel, 2005. "Network equilibrium with combined modes: models and solution algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 223-254, March.
    10. 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.
    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. 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.
    13. 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.
    14. Fan, Yinchao & Ding, Jianxun & Liu, Haoxiang & Wang, Yu & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:transb:v:34:y:2000:i:5:p:377-402. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.