Deep Learning Methods for Adjusting Global MFD Speed Estimations to Local Link Configurations

TL;DR

This paper introduces a deep learning framework combining Graph Attention Networks and Gated Recurrent Units to improve local traffic speed estimations from macroscopic models, significantly reducing errors in diverse urban scenarios.

Contribution

The study presents a novel Local Correction Factor using deep learning to adjust MFD-based traffic speeds for local link variations, integrating spatial and temporal network features.

Findings

Achieved approximately 84% error reduction in travel time estimation.

Demonstrated robustness across various urban traffic scenarios.

Enhanced link-level speed estimation accuracy.

Abstract

In large-scale traffic optimization, models based on Macroscopic Fundamental Diagram (MFD) are recognized for their efficiency in broad network analyses. However, they fail to reflect variations in the individual traffic status of each road link, leading to a gap in detailed traffic optimization and analysis. To address the limitation, this study introduces a Local Correction Factor (LCF) that represents local speed deviations between the actual link speed and the MFD average speed based on the link configuration. The LCF is calculated using a deep learning function that takes as inputs the average speed from the MFD and the road network configuration. Our framework integrates Graph Attention Networks (GATs) with Gated Recurrent Units (GRUs) to capture both the spatial configurations and temporal correlations within the network. Coupled with a strategic network partitioning method, our model enhances the precision of link-level traffic speed estimations while preserving the computational advantages of aggregate models. In our experiments, we evaluate the proposed LCF across various urban traffic scenarios, including different levels of origin-destination trip demand and distribution, as well as diverse road configurations. The results demonstrate the robust adaptability and effectiveness of the proposed model. Furthermore, we validate the practicality of our model by calculating the travel time of each randomly generated path, achieving an average error reduction of approximately 84% relative to MFD-based results.