Dynamic estimation of passenger origin-destination matrix for congested transit networks

H. L. Ren, Hing Keung William Lam, Z. Y. Gao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

This paper investigates the problem of estimation of time-dependent passenger origin-destination (O-D) matrices in congested transit networks where real-time updated passenger counts and prior O-D matrices are available. A bi-level programming model is proposed for the dynamic estimation of passenger O-D matrix. The upper level minimizes the sum of error measurements in dynamic passenger counts and time-dependent O-D 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 bi-level programming model. Finally, a numerical example is used to illustrate the applications of the proposed model and solution algorithm.
Original languageEnglish
Title of host publicationProceedings of the 11th International Conference of Hong Kong Society for Transportation Studies
Subtitle of host publicationSustainable Transportation
Pages239-248
Number of pages10
Publication statusPublished - 1 Dec 2006
Event11th International Conference of Hong Kong Society for Transportation Studies: Sustainable Transportation - Kowloon, Hong Kong
Duration: 9 Dec 200611 Dec 2006

Conference

Conference11th International Conference of Hong Kong Society for Transportation Studies: Sustainable Transportation
CountryHong Kong
CityKowloon
Period9/12/0611/12/06

ASJC Scopus subject areas

  • Automotive Engineering
  • Civil and Structural Engineering
  • Mechanical Engineering
  • Safety, Risk, Reliability and Quality
  • Transportation

Cite this