Teklu, F, Watling, DP orcid.org/0000-0002-6193-9121 and Connors, RD orcid.org/0000-0002-1696-0175 (2007) A Markov Process Model for Capacity-constrained Transit Assignment. In: Heydecker, G and Allsop, RE, (eds.) Transportation and Traffic Theory 2007 (Transportation and Traffic Theory 2007. Papers Selected for Presentation at ISTTT17). Elsevier Science , pp. 483-505. ISBN 978-0080450926
Abstract
Representing the finite capacity constraints of vehicles in a transit assignment model, for networks where the vehicle capacities are small and the buses do not operate timetables, requires an accurate representation of the impacts on passenger costs and flows as well as their day-to-day variability. This paper presents a composite frequency-based and schedule-based Markov process model for transit assignment that considers the day-to-day dynamics of the transit network, whereby line frequencies are used to parameterize distributions of vehicle arrivals and the passenger flows are constrained to the individual vehicle capacities. A proof of the model’s Markov property and regularity, its sensitivity to some parameters are presented using a test network.
Metadata
Item Type: | Book Section |
---|---|
Authors/Creators: |
|
Editors: |
|
Keywords: | capacity; frequency; markov; Process model; Transit Assignment |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Environment (Leeds) > Institute for Transport Studies (Leeds) > ITS: Spatial Modelling and Dynamics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 10 Sep 2019 10:45 |
Last Modified: | 10 Sep 2019 10:45 |
Published Version: | http://trid.trb.org/view.aspx?id=815555 |
Status: | Published |
Publisher: | Elsevier Science |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:84672 |