Document Open Access Logo

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities

Authors Julian Patzner , Matthias Müller-Hannemann

PDF
Thumbnail PDF

File

OASIcs.ATMOS.2024.18.pdf
  • Filesize: 1.61 MB
  • 20 pages

Document Identifiers

Author Details

Julian Patzner
  • Martin-Luther-Universität Halle-Wittenberg, Germany
Matthias Müller-Hannemann
  • Martin-Luther-Universität Halle-Wittenberg, Germany

Cite AsGet BibTex

Julian Patzner and Matthias Müller-Hannemann. Dynamic Traffic Assignment for Public Transport with Vehicle Capacities. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/OASIcs.ATMOS.2024.18

Abstract

Traffic assignment is a core component of many urban transport planning tools. It is used to determine how traffic is distributed over a transportation network. We study the task of computing traffic assignments for public transport: Given a public transit network, a timetable, vehicle capacities and a demand (i.e. a list of passengers, each with an associated origin, destination, and departure time), the goal is to predict the resulting passenger flow and the corresponding load of each vehicle. Microscopic stochastic simulation of individual passengers is a standard, but computationally expensive approach. Briem et al. (2017) have shown that a clever adaptation of the Connection Scan Algorithm (CSA) can lead to highly efficient traffic assignment algorithms, but ignores vehicle capacities, resulting in overcrowded vehicles. Taking their work as a starting point, we here propose a new and extended model that guarantees capacity-feasible assignments and incorporates dynamic network congestion effects such as crowded vehicles, denied boarding, and dwell time delays. Moreover, we also incorporate learning and adaptation of individual passengers based on their experience with the network. Applications include studying the evolution of perceived travel times as a result of adaptation, the impact of an increase in capacity, or network effects due to changes in the timetable such as the addition or the removal of a service or a whole line. The proposed framework has been experimentally evaluated with public transport networks of Göttingen and Stuttgart (Germany). The simulation proves to be highly efficient. On a standard PC the computation of a traffic assignment takes just a few seconds per simulation day.

Subject Classification

ACM Subject Classification
  • Applied computing → Transportation
Keywords
  • Public transport
  • traffic assignment
  • vehicle capacities
  • crowding
  • stochastic simulation
  • learning

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. L. Briem, S. Buck, H. Ebhart, N. Mallig, B. Strasser, P. Vortisch, D. Wagner, and T. Zündorf. Efficient Traffic Assignment for Public Transit Networks. In C. S. Iliopoulos, S. P. Pissis, S. J. Puglisi, and R. Raman, editors, 16th International Symposium on Experimental Algorithms (SEA 2017), volume 75 of Leibniz International Proceedings in Informatics (LIPIcs), pages 20:1-20:14, Dagstuhl, Germany, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SEA.2017.20.
  2. O. Cats. Dynamic Modelling of Transit Operations and Passenger decisions. PhD thesis, KTH Royal Institute of Technology, 2011. Google Scholar
  3. O. Cats and M. Hartl. Modelling public transport on-board congestion: comparing schedule-based and agent-based assignment approaches and their implications. Journal of Advanced Transportation, 50(6):1209-1224, 2016. URL: https://doi.org/10.1002/atr.1398.
  4. O. Cats and J. West. Learning and adaptation in dynamic transit assignment models for congested networks. Transportation Research Record: Journal of the Transportation Research Board, 2674:113-124, 2020. URL: https://doi.org/10.1177/0361198119900138.
  5. O. Cats, J. West, and J. Eliasson. A dynamic stochastic model for evaluating congestion and crowding effects in transit systems. Transportation Research Part B Methodological, 89:43-57, June 2016. URL: https://doi.org/10.1016/j.trb.2016.04.001.
  6. Z. Christoforou, E. Chandakas, and I. Kaparias. Investigating the impact of dwell time on the reliability of urban light rail operations. Urban Rail Transit, 6:116-131, 2020. URL: https://doi.org/10.1007/s40864-020-00128-1.
  7. J. Dibbelt, T. Pajor, B. Strasser, and D. Wagner. Connection scan algorithm. ACM J. Exp. Algorithmics, 23, October 2018. URL: https://doi.org/10.1145/3274661.
  8. Collection of open source public transport networks by DFG Research Unit "FOR 2083: Integrated Planning For Public Transportation", 2018. URL: https://github.com/FOR2083/PublicTransportNetworks.
  9. Q. Fu, R. Liu, and S. Hess. A review on transit assignment modelling approaches to congested networks: A new perspective. Procedia - Social and Behavioral Sciences, 54:1145-1155, 2012. URL: https://doi.org/10.1016/j.sbspro.2012.09.829.
  10. G. Gentile, M. Florian, Y. Hamdouch, O. Cats, and A. Nuzzolo. The theory of transit assignment: Basic modelling frameworks. In G. Gentile and K. Noekel, editors, Modelling Public Transport Passenger Flows in the Era of Intelligent Transport Systems: COST Action TU1004 (TransITS), chapter 6, pages 287-386. Springer International Publishing, 2016. URL: https://doi.org/10.1007/978-3-319-25082-3_6.
  11. G. Gentile, K. Noekel, J.-D. Schmöcker, V. Trozzi, and E. Chandakas. The theory of transit assignment: Demand and supply phenomena. In Guido Gentile and Klaus Noekel, editors, Modelling Public Transport Passenger Flows in the Era of Intelligent Transport Systems: COST Action TU1004 (TransITS), chapter 7, pages 387-481. Springer International Publishing, 2016. URL: https://doi.org/10.1007/978-3-319-25082-3_7.
  12. PTV Group. New features at a glance - PTV Visum 2024. www.ptvgroup.com, 2023. Google Scholar
  13. Y. Hamdouch and S. Lawphongpanich. Schedule-based transit assignment model with travel strategies and capacity constraints. Transportation Research Part B: Methodological, 42:663-684, August 2008. URL: https://doi.org/10.1016/j.trb.2007.11.005.
  14. Y. Hamdouch, W. Szeto, and Y. Jiang. A new schedule-based transit assignment model with travel strategies and supply uncertainties. Transportation Research Part B: Methodological, 67:35-67, September 2014. URL: https://doi.org/10.1016/j.trb.2014.05.002.
  15. M. Müller-Hannemann and R. Rückert. Dynamic event-activity networks in public transportation: Timetable information and delay management. Datenbank-Spektrum, 17, May 2017. URL: https://doi.org/10.1007/s13222-017-0252-y.
  16. S. Nguyen and S. Pallottino. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research, 37(2):176-186, November 1988. URL: https://doi.org/10.1016/0377-2217(88)90327-X.
  17. O. Nielsen and R. Frederiksen. Optimisation of timetable-based, stochastic transit assignment models based on MSA. Annals OR, 144:263-285, April 2006. URL: https://doi.org/10.1007/s10479-006-0012-0.
  18. A. Nuzzolo, U. Crisalli, and L. Rosati. A schedule-based assignment model with explicit capacity constraints for congested transit networks. Transportation Research Part C Emerging Technologies, 20, February 2012. URL: https://doi.org/10.1016/j.trc.2011.02.007.
  19. A. Nuzzolo, F. Russo, and U. Crisalli. A doubly dynamic schedule-based assignment model for transit networks. Transportation Science, 35:268-285, August 2001. URL: https://doi.org/10.1287/trsc.35.3.268.10149.
  20. N. Oliker and S. Bekhor. A frequency based transit assignment model that considers online information and strict capacity constraints. EURO Journal on Transportation and Logistics, 9(1):100005, 2020. URL: https://doi.org/10.1016/j.ejtl.2020.100005.
  21. M. Rieser, D. Grether, and K. Nagel. Adding mode choice to multiagent transport simulation. Transportation Research Record: Travel Demand Forecasting 2009, 2132:50-58, December 2009. URL: https://doi.org/10.3141/2132-06.
  22. P. Ryus, A. Danaher, M. Walker, F. Nichols, B. Carter, E. Ellis, L. Cherrington, and A. Bruzzone. Transit Capacity and Quality of Service Manual, Third Edition. The National Academies Press, January 2013. URL: https://doi.org/10.17226/24766.
  23. P. Schiewe, A. Schöbel, S. Jäger, S. Albert, U. Baumgart, C. Biedinger, V. Grafe, S. Roth, A. Schiewe, F. Spühler, M. Stinzendörfer, and R. Urban. LinTim: an integrated environment for mathematical public transport optimization. Documentation for version 2023.12, 2023. URL: https://nbn-resolving.de/urn:nbn:de:hbz:386-kluedo-75699.
  24. J.-D. Schmöcker, A. Fonzone, H. Shimamoto, F. Kurauchi, and M. Bell. Frequency-based transit assignment considering seat capacities. Transportation Research Part B: Methodological, 45:392-408, February 2011. URL: https://doi.org/10.1016/j.trb.2010.07.002.
  25. H. Spiess and M. Florian. Optimal strategies: A new assignment model for transit networks. Transportation Research Part B: Methodological, 23:83-102, April 1989. URL: https://doi.org/10.1016/0191-2615(89)90034-9.
  26. M. Wahba. MILATRAS: MIcrosimulation Learning-based Approach to TRansit ASsignment. PhD thesis, University of Toronto, 2008. Google Scholar
  27. M. Wahba and A. Shalaby. Learning-based framework for transit assignment modeling under information provision. Transportation, 41, March 2014. URL: https://doi.org/10.1007/s11116-013-9510-5.
  28. M. Wardman and G. Whelan. Twenty years of rail crowding valuation studies: Evidence and lessons from british experience. Transport Reviews, 31:379-398, May 2011. URL: https://doi.org/10.1080/01441647.2010.519127.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact