Abstract
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kurauchi, F., Bell, M.G.H. & Schmöcker, JD. Capacity Constrained Transit Assignment with Common Lines. Journal of Mathematical Modelling and Algorithms 2, 309–327 (2003). https://doi.org/10.1023/B:JMMA.0000020426.22501.c1
Issue Date:
DOI: https://doi.org/10.1023/B:JMMA.0000020426.22501.c1