Abstract

At present, the existing dynamic OD estimation methods in an urban rail transit network still need to be improved in the factors of the time-dependent characteristics of the system and the estimation accuracy of the results. This study focuses on predicting the dynamic OD demand for a time of period in the future for an urban rail transit system. We propose a nonlinear programming model to predict the dynamic OD matrix based on historic automatic fare collection (AFC) data. This model assigns the passenger flow to the hierarchical flow network, which can be calibrated by backpropagation of the first-order gradients and reassignment of the passenger flow with the updated weights between different layers. The proposed model can predict the time-varying OD matrix, the number of passengers departing at each time, and the travel time spent by passengers, of which the results are shown in the case study. Finally, the results indicate that the proposed model can effectively obtain a relatively accurate estimation result. The proposed model can integrate more traffic characteristics than traditional methods and provides an effective and hierarchical passenger flow estimation framework. This study can provide a rich set of passenger demand for advanced transit planning and management applications, for instance, passenger flow control, adaptive travel demand management, and real-time train scheduling.

Document type: Article

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

http://downloads.hindawi.com/journals/jat/2020/8846715.xml,
http://dx.doi.org/10.1155/2020/8846715
under the license https://creativecommons.org/licenses/by/4.0/
Back to Top

Document information

Published on 01/01/2020

Volume 2020, 2020
DOI: 10.1155/2020/8846715
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?