ESTIMATION OF TIME-DEPENDENT ORIGIN-DESTINATION MATRICES FOR TRANSIT NETWORKS

Document Type

Journal Article

Publication Date

1998

Subject Area

ridership - commuting, mode - mass transit

Keywords

Transit services, Transit, Time dependent parameters, Time dependence, Public transit, Passenger counting, Origin and destination, O&D, Mass transit, Local transit, Entropy (Communications)

Abstract

In this paper, the estimation of time-dependent origin-destination (O-D) matrices for transit network based on observed passenger counts is given. The dynamic assignment framework is based on a schedule-based transit network model, which can help determine the time-dependent least cost paths between all O-D pairs, and for each of them the clock arrival times at the end nodes of all observed links (if any) in the transit network. An entropy-based approach is then employed to estimate the time-dependent O-D matrices based on the observed passenger counts at those observed links in the network. An efficient sparse algorithm is also proposed to solve the resulting mathematical programming problem. The estimation methodology is tested in a transit network from the Mass Transit Railway (MTR) system in Hong Kong which is one of the busiest railway systems in the world.

Comments

Transportation Research Part B Home Page: http://www.sciencedirect.com/science/journal/01912615

Link to Full Text

Share

COinS