A schedule‐based time‐dependent trip assignment model for transit networks

C. O. Tong · S.C. Wong

33 citations0/0 files storedJournal of Advanced Transportation

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Railway Systems and Energy Efficiency

Abstract

Abstract A schedule‐based time‐dependent trip assignment model for transit networks is presented. First the transit network model is formulated using the schedule‐based approach, in which the vehicles are assumed to arrive punctually in accordance with a scheduled time‐table. Based on a previously developed time‐dependent shortest path algorithm, an all‐or‐nothing network loading procedure is employed to assign the passenger trips onto the network. Both the passenger demand and scheduled time‐table are time‐varying. This provides a versatile tool for the evaluation of the performance of transit networks subject to peak period loading. A case study using the Mass Transit Railway System in Hong Kong is given to illustrate the potential applications of the model.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 33 citations exist upstream.

References

1971A probabilistic multipath traffic assignment model which obviates path enumeration 1989Optimal strategies: A new assignment model for transit networks 1993Transit Assignment for Congested Public Transport Systems: An Equilibrium Model 1988Equilibrium traffic assignment for large scale transit networks 1975Common Bus Lines 1994Transit Equilibrium Assignment: A Model and Solution Algorithms 1984A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules 1988TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM

Cited by

2001A schedule‐based dynamic transit network model — Recent advances and prospective future research 2007An algorithm for finding reasonable paths in transit networks 2010Estimation of origin-destination matrices for a multimodal public transit network 2003Network equilibrium for congested multi‐mode networks with elastic demand 2004A Schedule-Based Transit Assignment Model Addressing the Passengers’ Choice Among Competing Connections

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.