Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14174
Title: Estimation of transit origin-destination matrices from passenger counts using a frequency-based approach
Authors: Lam, WHK 
Wu, ZX
Chan, KS
Keywords: Bi-level programming
Logit-type and probit-type choice models
Issue Date: 2003
Source: Journal of mathematical modelling and algorithms, 2003, v. 2, no. 4, p. 329-348 How to cite?
Journal: Journal of Mathematical Modelling and Algorithms 
Abstract: This paper investigates the transit passenger origin-destination (O-D) estimation problem in congested transit networks where updated passenger counts and outdated O-D matrices are available. The bi-level programming approach is used for the transit passenger O-D estimation problem. The upper level minimizes the sum of error measurements in passenger counts and O-D matrices, and the lower level is a new frequency-based stochastic user equilibrium (SUE) assignment model that can determine simultaneously the passenger overload delays and passenger route choices in congested transit network together with the resultant transit line frequencies. The lower-level problem can be formulated as either a logit-type or probit-type SUE transit assignment problem. A heuristic solution algorithm is developed for solving the proposed bi-level programming model which is applicable to congested transit networks. Finally, a case study on a simplified transit network connecting Kowloon urban area and the Hong Kong International Airport is provided to illustrate the applications of the proposed bi-level programming model and solution algorithm.
URI: http://hdl.handle.net/10397/14174
ISSN: 1570-1166
DOI: 10.1023/B:JMMA.0000020423.93104.14
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Dec 12, 2018

Page view(s)

54
Last Week
0
Last month
Citations as of Dec 10, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.