Skip to main content

A Large Scale Stochastic Multi-Class Schedule-Based Transit Model with Random Coefficients

Implementation and Algorithms

  • Chapter
Schedule-Based Dynamic Transit Modeling: theory and applications

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 28))

Abstract

Public transport assignment models are increasing in complexity in order to describe passengers’ route choices as detailed and correctly as possible. Important trends in the development are 1) schedule-based models, 2) inclusion of feeder modes, 3) use of stochastic components to describe differences in passengers’ preferences within and between trip purposes and classes, as well as to describe non-explained variation within a utility theory framework, and 4) consideration of capacity problems at coach level, system level and terminal level. In the East Denmark Model, such a large-scale transit assignment model was developed and estimated within a Stochastic User Equilibrium framework solved by the Method of Successive Averages. The model covered a metropolitan area including its hinterland (2,000 lines, 50,000 runs, 300,000 stops, and 1 million nodes and 10 million arcs in the calculation graph). The paper outlines the experiences from this project, and the subsequent research and development using the case as ‘modelling laboratory’. The main focus of the paper is to describe the estimation of the utility functions, and to discuss and suggest optimisation of the solution algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Akiva, M.; & Bierlaire (1999). Discrete Choice Methods and their applications to Short Term Travel Descisions. Handbook of Transportation Science. Randolph W. Hall, ed.

    Google Scholar 

  2. Bertsekas, D.P. (1998). Network Optimization — Continuous and discrete models. Athena Scientific, Belmont, Massachusetts.

    Google Scholar 

  3. Bottom, J. A. (2000). Consitent Anticipatory Route Guidance. Ph.D.-thesis. Massachusetts Istitute of Technology.

    Google Scholar 

  4. Bottom, J. A. & Chabini, I. (2001). Accelerated Averaging methods for Fixed Point Problems in Transportation Analysis and Planning. Triennial Symposium on Transportation Analysis (TRISTAN IV). Sao Miguel, Azores, June. Preprints, Vol. 1 /3, pp. 69–74.

    Google Scholar 

  5. Cascetta, E.; Nuzzolo, A.; Russo, F. & Vivetta, A. (1996). A modified Logit Route Choice Model Overcomming Path Overlapping Problems: Specification and Some Calibration Results for Interurban networks. Transportation and Traffic Theory. Proceedings from the Thirteenth International Symphosium on Transportation and Traffic Theory, Lyon, France, J.B.Lesort, ed. Pergamon.

    Google Scholar 

  6. Cormen, T.H., Leiserson, C.E. & Rivest, R.L. (1998). Introduction to Algorithms. MIT Press.

    Google Scholar 

  7. Daganzo, C. F. & Sheffi, Y. (1977). On Stochastic Models of Traffic Assignment. Transportation Science. No. 11 (3), pp. 253–274.

    Article  Google Scholar 

  8. Dial, R. B. (1971). A probabilistic Multipath Traffic Assignment Algorithm which obviates Path Enumeration. Transportation Research. No. 5 (2). pp. 81–111.

    Google Scholar 

  9. Evans, S. P. (1976). Derivation and Analysis of Some Models for Combining Trip Distribution and Assignment. Transportation Research, Vol. 10. Pergamon Press, UK, 1976, pp. 37–57.

    Google Scholar 

  10. Florian, M.. (2002). Operational aspects of a schedule-based approach to transit modelling: a particular implementation and future modelling challenges. First International Workshop on the Schedule-Based Approach in Dynamic Transit Modelling. 27/5. Ischia, Italy.

    Google Scholar 

  11. Friedrich, M. & Wekeck, S. (2002). A schedule-based transit assignment model adressing the passengers’ choice among competing connections. First International Workshop on the Schedule-Based Approach in Dynamic Transit Modelling. 27/5. Ischia, Italy.

    Google Scholar 

  12. Lee, J. Y. S. & Lam, W. H. K. (2001). Pedestrian Simulation-Assignment Model for Hong Kong Mass Transit Railway Stations. 9th World Conference on Transportation Research (WCTR), Pre-prints, session D1–01. Seoul, Korea.

    Google Scholar 

  13. Moller-Pedersen, J. (1999). Assignment model for timetable-based systems (TPSchedule). 27th European Transport Forum (PTRC Annual meeting). Proceedings of Seminar F, Transportation Planning Methods, Vol. P 434. pp. 159–168. Cambridge, September.

    Google Scholar 

  14. Nielsen, O. A. (1997). On the distribution of the stochastic component in SUE traffic assignment models 25th European Transport Forum (PTRC Annual meeting), Proceedings. Seminar F, Transportation Planning Methods, Vol. II, pp. 77–94. Uxbridge, UK, 1997.

    Google Scholar 

  15. Nielsen, Otto Anker; Simonsen, Nikolaj & Frederiksen, Rasmus Dyhr (1998). Stochastic User Equilibrium Traffic Assignment with Turn-delays in Intersections. International Transactions in Operational Research. Vol. 5, No. 6, pp. 555–568. Pergamon, Elsevier Science Ltd.

    Google Scholar 

  16. Nielsen, O. A. (2000a) A Stochastic Transit Assignment Model Considering Differences in Passengers Utility Functions Transportation Research Part B Methodological, Vol. 34B, No. 5, pp. 337–402. Elsevier Science Ltd.

    Google Scholar 

  17. Nielsen, O. A., Hansen, C. O. & Daly, A. (2001a) A large-scale model system for the Copenhagen-Ringsted railway project. Travel behaviour Research: The Leading Edge. edt. David Hensher. Pergamon press. Chapter 35, pp 603–623. 2002.

    Google Scholar 

  18. Nielsen, O.A. & Frederiksen, R.D. (2001b). Rule-based, object-oriented modelling of public transport systems — A description of the Transportation Object Platform. 9th World Conference on Transportation Research (WCTR), Pre-prints, session D1–01, 23/7. Seoul, Korea. A new version is to be published in the selected proceedings, Elsevier.

    Google Scholar 

  19. Nielsen, O.A. & Frederiksen, R.D. (2001c). Optimising Timetable-Based Stochastic Transit Assignment Models Triennial Symposium on Transportation Analysis (TRISTAN IV). Sao Miguel, Zores, June. Preprints, Vol. 1 /3, pp. 195–200.

    Google Scholar 

  20. Nielsen, O.A.; Frederiksen, R. D. & Daly, A. (2002). A stochastic multi-class road assignment model with distributed time and cost coefficients. Networks and spatial economics. No 2. pp. 327–346. Kluwer.

    Google Scholar 

  21. Nuzzolo, A.; Russo, F. & Crisalli, U. (1997). A pseudo-dynamic assignment to extraurban networks using a C-logit route choice model. 25th European Transport Forum, Proceedings of Seminar F, Transportation Planning Methods, Vol. II. pp. 95105

    Google Scholar 

  22. Nuzollo, A.; Crisalli, U. & Russo, F. (2001). Schedule-Based Dynamic Path Choice and Assignment Models for Public Transport Networks. 9th World Conference on Transportation Research (WCTR), Presentation/abstract, Special Session on Route Choice models, 26/7.Seoul, Korea.

    Google Scholar 

  23. Nuzullo, A. (2002). The schedule-based approach in dynamic transit modelling: a general overview. First International Workshop on the Schedule-Based Approach in Dynamic Transit Modelling. 27/5. Ischia, Italy.

    Google Scholar 

  24. Prashker, J.N. & Bekhor, S. (1998). Investigation of Stochastic Network Loading Procedures. Transportation Research Record, Vol. 1645, pp. 94–102.

    Google Scholar 

  25. Sheffi, Y. & Powell, W. B. (1981). A comparison of Stochastic and Deterministic Traffic Assignment over Congested Networks. Transportation Research B. No. 15 (1), pp. 53–64.

    Google Scholar 

  26. Sheffi, Y & Powell, W. B. (1982). An Algorithm, for the Equilibrium Assignment Problem with Random Link Times. Networks 12 (2), pp. 191–207.

    Article  Google Scholar 

  27. Sheffi, Y (1985) Urban Transportation Networks, Prentice Hall, Inc, Englewood Cliffs, NJ.

    Google Scholar 

  28. Sjöstrand, H. (2001) Passengers Evaluation in Local Public Transport, Ph.D.-thesis, Lund University, Sweeden.

    Google Scholar 

  29. Sorensen, M.V., Nielsen, O.A. & Filges, D. (2001a). Validation and test of a complex stochastic traffic model. European Transport Conference (PTRC). Seminar on Methodological Innovations, Session on Networks and Assignment. Proceedings, PTRC. Cambridge, September.

    Google Scholar 

  30. Sorensen, M.V. & Nielsen, O.A. (200lb. Assessing Distributions of Error Components in a Complex Traffic Model. 9th World Conference on Transportation Research (WCTR), Pre-prints, session D1–01, 23/7.Seoul, Korea.

    Google Scholar 

  31. Sorensen, M.V. (2003). Discrete Choice Models — Estimation of Passenger Traffic. Ph.D.-thesis, CTT, DTU.

    Google Scholar 

  32. Van Vuren, T (1995) The trouble with SUE stochastic assignment options in practice PTRC Summer Annual Meeting, Proceedings, Seminar H. pp.41–52. University of Warwick, England, 1995.

    Google Scholar 

  33. Walker, W. T.; Rossi, T. F. & Islam, N. (1998). Method of Succesive Averages Versus Evans Algorithm — Iterating a Regional Travel Simulation Model to the User Equilibrium Solution. Transportation Research Record, Vol. 1645, pp. 133–142.

    Google Scholar 

  34. Wardrop, J. G. (1952). Some theoretical aspects of road traffic research. Institution of Civil Engineers. London.

    Google Scholar 

  35. Vovsha, P. & Bekhor, S. (1998). Link-Nested Logit Model of Route Choice — Overcomming Route Overlapping Problem. Transportation Research Record, Vol. 1645, pp. 133–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Nielsen, O.A. (2004). A Large Scale Stochastic Multi-Class Schedule-Based Transit Model with Random Coefficients. In: Wilson, N.H.M., Nuzzolo, A. (eds) Schedule-Based Dynamic Transit Modeling: theory and applications. Operations Research/Computer Science Interfaces Series, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6467-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6467-3_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5412-1

  • Online ISBN: 978-1-4757-6467-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics