Origin-Destination Demands Estimation in Congested Dynamic Transit Networks

This paper investigates the problem of estimation of time-dependent passenger origin-destination (OD) matrices in congested transit networks where real-time updated passenger counts and prior OD matrices are available. A bilevel programming model is proposed for the dynamic estimation of passenger OD matrix. The upper level minimizes the sum of error measurements in dynamic passenger counts and time-dependent OD matrices, and the lower level is a new schedule-based dynamic transit assignment model that can determine simultaneously the dynamic average travel costs and route choices of passengers in congested transit networks. The lower-level problem can be formulated as a variational inequality problem. A heuristic solution algorithm is adapted for solving the proposed bilevel programming model. Finally, a numerical example is used to illustrate the applications of the proposed model and solution algorithm.

[1]  Shing Chung Josh Wong,et al.  Estimation of time-dependent origin–destination matrices for transit networks , 1998 .

[2]  William H. K. Lam,et al.  Estimation of Transit Origin–Destination Matrices from Passenger Counts Using a Frequency-Based Approach , 2003, J. Math. Model. Algorithms.

[3]  Shing Chung Josh Wong,et al.  A stochastic transit assignment model using a dynamic schedule-based network , 1999 .

[4]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[5]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[6]  E. Cascetta.  Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[7]  Enrique Fernández,et al.  Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , 1993, Transp. Sci..

[8]  Paolo Ferrari,et al.  Capacity constraints in urban transport networks , 1997 .

[9]  M. Maher.  INFERENCES ON TRIP MATRICES FROM OBSERVATIONS ON LINK VOLUMES: A BAYESIAN STATISTICAL APPROACH , 1983 .

[10]  Shing Chung Josh Wong,et al.  A dynamic schedule-based model for congested transit networks , 2004 .

[11]  C. S. Fisk,et al.  Trip matrix estimation from link traffic counts: The congested network case , 1989 .

[12]  Umberto Crisalli,et al.  ESTIMATION OF TRANSIT ORIGIN/DESTINATION MATRICES FROM TRAFFIC COUNTS USING A SCHEDULE-BASED APPROACH , 2001 .

[13]  M. Florian,et al.  A COORDINATE DESCENT METHOD FOR THE BILEVEL O-D MATRIX ADJUSTMENT PROBLEM , 1992 .

[14]  Sang Nguyen,et al.  Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks , 1988 .

[15]  Hai Yang.  Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .

[16]  Gao Zi-you,et al.  Bilevel Model and Solution Algorithm for Dynamic Transit Schedule Planning Problem , 2006, 2006 International Conference on Management Science and Engineering.

[17]  Michael J. Maher,et al.  A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows , 2001 .