Dynamic Origin–Destination Matrix Prediction with Line Graph Neural Networks and Kalman Filter
Authors:
- 31 May 2020
- journal article
- research article
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2674 (8) , 491-503
Abstract
Modern intelligent transportation systems provide data that allow real-time dynamic demand prediction, which is essential for planning and operations. The main challenge of prediction of dynamic origin–destination (O-D) demand matrices is that demand cannot be directly measured by traffic sensors; instead, it has to be inferred from aggregate traffic flow data on traffic links. Specifically, spatial correlation, congestion and time dependent factors need to be considered in general transportation networks. This paper proposes a novel O-D prediction framework combining heterogeneous prediction in graph neural networks and Kalman filter to recognize spatial and temporal patterns simultaneously. The underlying road network topology is converted into a corresponding line graph in the newly designed fusion line graph convolutional networks (FL-GCNs), which provide a general framework of predicting spatial-temporal O-D flows from link information. Data from the New Jersey Turnpike network are used to evaluate the proposed model. The results show that the proposed approach yields the best performance under various prediction scenarios. In addition, the advantage of combining deep neural networks and Kalman filter is demonstrated.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Estimation of dynamic origin–destination trip tables for a general networkTransportation Research Part B: Methodological, 2001
- A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flowsTransportation Research Part B: Methodological, 2001
- Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin–Destination FlowsTransportation Science, 2000
- Heuristic algorithms for the bilevel origin-destination matrix estimation problemTransportation Research Part B: Methodological, 1995
- A linear programming approach for synthesizing origin-destination trip tables from link traffic volumesTransportation Research Part B: Methodological, 1994
- The estimation of origin-destination matrices by constrained generalised least squaresTransportation Research Part B: Methodological, 1991
- A unified framework for estimating or updating origin/destination matrices from traffic countsTransportation Research Part B: Methodological, 1988
- A maximum likelihood model for estimating origin-destination matricesTransportation Research Part B: Methodological, 1987
- Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimatorTransportation Research Part B: Methodological, 1984
- Inferences on trip matrices from observations on link volumes: A Bayesian statistical approachTransportation Research Part B: Methodological, 1983