IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v41y2014i2p397-417.html
   My bibliography  Save this article

Learning-based framework for transit assignment modeling under information provision

Author

Listed:
  • Mohamed Wahba
  • Amer Shalaby

Abstract

The modeling of service dynamics has been the focus of recent developments in the field of transit assignment modeling. The emerging focus on dynamic service modeling requires a corresponding shift in transit demand modeling to represent appropriately the dynamic behaviour of passengers and their responses to Intelligent Transportation Systems technologies. This paper presents the theoretical development of a departure time and transit path choice model based on the Markovian Decision Process. This model is the core of the MIcrosimulation Learning-based Approach to TRansit Assignment. Passengers, while traveling, move to different locations in the transit network at different points in time (e.g. at stop, on board), representing a stochastic process. This stochastic process is partly dependent on the transit service performance and partly controlled by the transit rider’s trip choices. This can be analyzed as a Markovian Decision Process, in which actions are rewarded and hence passengers’ optimal policies for maximizing the trip utility can be estimated. The proposed model is classified as a bounded rational model, with a constant utility term and a stochastic choice rule. The model is appropriate for modeling information provision since it distinguishes between individual’s experience with the service performance and information provided about system dynamics. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Mohamed Wahba & Amer Shalaby, 2014. "Learning-based framework for transit assignment modeling under information provision," Transportation, Springer, vol. 41(2), pages 397-417, March.
  • Handle: RePEc:kap:transp:v:41:y:2014:i:2:p:397-417
    DOI: 10.1007/s11116-013-9510-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11116-013-9510-5
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11116-013-9510-5?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. 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.
    2. 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.
    3. 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.
    4. Ettema, Dick & Tamminga, Guus & Timmermans, Harry & Arentze, Theo, 2005. "A micro-simulation model system of departure time using a perception updating model under travel time uncertainty," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(4), pages 325-344, May.
    5. Mohamed Wahba & Amer Shalaby, 2011. "Large-scale application of MILATRAS: case study of the Toronto transit network," Transportation, Springer, vol. 38(6), pages 889-908, November.
    6. Mark D. Hickman & David H. Bernstein, 1997. "Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks," Transportation Science, INFORMS, vol. 31(2), pages 129-146, May.
    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. 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.
    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. Oded Cats & Zafeira Gkioulou, 2017. "Modeling the impacts of public transport reliability and travel information on passengers’ waiting-time uncertainty," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 247-270, September.
    2. 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.
    3. Chenfeng Xiong & Lei Zhang, 2017. "Dynamic travel mode searching and switching analysis considering hidden model preference and behavioral decision processes," Transportation, Springer, vol. 44(3), pages 511-532, May.

    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. David Watling & Giulio Cantarella, 2015. "Model Representation & Decision-Making in an Ever-Changing World: The Role of Stochastic Process Models of Transportation Systems," Networks and Spatial Economics, Springer, vol. 15(3), pages 843-882, September.
    2. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    3. 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.
    4. Rambha, Tarun & Boyles, Stephen D., 2016. "Dynamic pricing in discrete time stochastic day-to-day route choice models," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 104-118.
    5. Cantarella, Giulio E. & Watling, David P., 2016. "A general stochastic process for day-to-day dynamic traffic assignment: Formulation, asymptotic behaviour, and stability analysis," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 3-21.
    6. Sun, Mingmei, 2023. "A day-to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    7. G. E. Cantarella & D. P. Watling, 2016. "Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 69-98, March.
    8. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    9. Parry, Katharina & Hazelton, Martin L., 2013. "Bayesian inference for day-to-day dynamic traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 104-115.
    10. Watling, David P. & Hazelton, Martin L., 2018. "Asymptotic approximations of transient behaviour for day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 90-105.
    11. Katharina Parry & David P. Watling & Martin L. Hazelton, 2016. "A new class of doubly stochastic day-to-day dynamic traffic assignment models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 5-23, March.
    12. Wang, Jian & He, Xiaozheng & Peeta, Srinivas, 2016. "Sensitivity analysis based approximation models for day-to-day link flow evolution process," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 35-53.
    13. Watling, David, 1999. "Stability of the stochastic equilibrium assignment problem: a dynamical systems approach," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 281-312, May.
    14. Guo, Ren-Yong & Huang, Hai-Jun, 2009. "Chaos and bifurcation in dynamical evolution process of traffic assignment with flow “mutation”," Chaos, Solitons & Fractals, Elsevier, vol. 41(3), pages 1150-1157.
    15. Watling, David, 1998. "Perturbation stability of the asymmetric stochastic equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 155-171, April.
    16. 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.
    17. Hazelton, Martin L., 2022. "The emergence of stochastic user equilibria in day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 102-112.
    18. Hazelton, Martin L., 2002. "Day-to-day variation in Markovian traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 637-648, August.
    19. Liu, Ronghui & Van Vliet, Dirck & Watling, David, 2006. "Microsimulation models incorporating both demand and supply dynamics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(2), pages 125-150, February.
    20. 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.

    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:transp:v:41:y:2014:i:2:p:397-417. 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.