IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v8y2008i2p225-240.html
   My bibliography  Save this article

A Stochastic Process Approach for Frequency-based Transit Assignment with Strict Capacity Constraints

Author

Listed:
  • Fitsum Teklu

Abstract

No abstract is available for this item.

Suggested Citation

  • Fitsum Teklu, 2008. "A Stochastic Process Approach for Frequency-based Transit Assignment with Strict Capacity Constraints," Networks and Spatial Economics, Springer, vol. 8(2), pages 225-240, September.
    • Handle: RePEc:kap:netspa:v:8:y:2008:i:2:p:225-240
    DOI: 10.1007/s11067-007-9046-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-007-9046-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-007-9046-3?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. 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.
    2. Martin L. Hazelton & David P. Watling, 2004. "Computation of Equilibrium Distributions of Markov Traffic-Assignment Models," Transportation Science, INFORMS, vol. 38(3), pages 331-342, August.
    3. 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.
    4. 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.
    5. G. E. Cantarella & E. Cascetta, 1995. "Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory," Transportation Science, INFORMS, vol. 29(4), pages 305-329, November.
    6. Gary A. Davis & Nancy L. Nihan, 1993. "Large Population Approximations of a General Stochastic Traffic Assignment Model," Operations Research, INFORMS, vol. 41(1), pages 169-178, February.
    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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiaomei Zhao & Chunhua Wan & Jun Bi, 2019. "Day-to-Day Assignment Models and Traffic Dynamics Under Information Provision," Networks and Spatial Economics, Springer, vol. 19(2), pages 473-502, June.
    2. Giulio Cantarella & Pietro Velonà & David Watling, 2015. "Day-to-day Dynamics & Equilibrium Stability in A Two-Mode Transport System with Responsive bus Operator Strategies," Networks and Spatial Economics, Springer, vol. 15(3), pages 485-506, September.
    3. 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.
    4. Huijun Sun & Si Zhang & Linghui Han & Xiaomei Zhao & Lu Lou, 2020. "Day-to-Day Evolution Model Based on Dynamic Reference Point with Heterogeneous Travelers," Networks and Spatial Economics, Springer, vol. 20(4), pages 935-961, December.
    5. 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.
    6. 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.
    7. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    8. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    9. Sumalee, Agachai & Tan, Zhijia & Lam, William H.K., 2009. "Dynamic stochastic transit assignment with explicit seat allocation model," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 895-912, September.
    10. 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.
    11. Elnaz Miandoabchi & Reza Farahani & Wout Dullaert & W. Szeto, 2012. "Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks," Networks and Spatial Economics, Springer, vol. 12(3), pages 441-480, September.
    12. 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.
    13. Hänseler, Flurin S. & van den Heuvel, Jeroen P.A. & Cats, Oded & Daamen, Winnie & Hoogendoorn, Serge P., 2020. "A passenger-pedestrian model to assess platform and train usage from automated data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 948-968.

    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. 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).
    2. 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.
    3. 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.
    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. Shang, Pan & Li, Ruimin & Guo, Jifu & Xian, Kai & Zhou, Xuesong, 2019. "Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 135-167.
    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. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Shang, Pan & Xiong, Yufan & Guo, Jifu & Xian, Kai & Yu, Yun & Xu, Han, 2024. "A modeling framework to integrate frequency - and schedule-based passenger assignment approaches for coordinated path choice and space-time trajectory estimation based on multi-source observations," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    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. 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.
    15. 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.
    16. S. Mahmassani, Hani & F. Hyland, Michael, 2016. "Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale applicationAuthor-Name: Verbas, Ömer," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 1-16.
    17. 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.
    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. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    20. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.

    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:kap:netspa:v:8:y:2008:i:2:p:225-240. 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.