Journal of Mathematical Modelling and Algorithms

, Volume 2, Issue 4, pp 309–327 | Cite as

Capacity Constrained Transit Assignment with Common Lines

  • Fumitaka Kurauchi
  • Michael G. H. Bell
  • Jan-Dirk Schmöcker

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.

transit assignment capacity restrained common lines problem absorbing Markov chain 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Fumitaka Kurauchi
    • 1
  • Michael G. H. Bell
    • 2
  • Jan-Dirk Schmöcker
    • 2
  1. 1.Department of Urban Management, Graduate School of EngineeringKyoto UniversitySakyo, KyotoJapan
  2. 2.Centre for Transport StudiesImperial College LondonLondonUK

Personalised recommendations