A Spatiotemporal Adaptive Local Search Method for Tracking Congestion Propagation in Dynamic Networks

Abstract

Traffic congestion propagation poses significant challenges to urban sustainability, disrupting spatial accessibility. The cascading effect of traffic congestion propagation can cause large-scale disruptions to networks. Existing studies have laid a solid foundation for characterizing the cascading effects. However, they typically rely on predefined graph structures and lack adaptability to diverse data granularities. To address these limitations, we propose a spatiotemporal adaptive local search (STALS) method, which feeds the dynamically adaptive adjacency matrices into the local search algorithm to learn propagation rules. Specifically, the STALS is composed of two data-driven modules. One is a dynamic adjacency matrix learning module, which learns the spatiotemporal relationship from congestion graphs by fusing four node features. The other one is the local search module, which introduces local dominance to identify multi-scale congestion bottlenecks and search their propagation pathways. We test our method on the four benchmark networks with an average of 15,000 nodes. The STALS remains a Normalized Mutual Information (NMI) score at 0.97 and an average execution time of 27.66s, outperforming six state-of-the-art methods in robustness and efficiency. We also apply the STALS to three large-scale traffic networks in New York City, the United States, Shanghai, China, and Urumqi, China. The ablation study reveals an average modularity of 0.78 across three cities, demonstrating the spatiotemporal-scale invariance of frequencytransformed features and the spatial heterogeneity of geometric topological features. By integrating dynamic graph learning with Geo-driven spatial analytics, STALS provides a scalable tool for congestion mitigation.

References in corpus (13)

• Finding and evaluating community structure in networks
• Graph Neural Network for Traffic Forecasting: A Survey
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• A simple contagion process describes spreading of traffic jams in urban networks
• GED: the method for group evolution discovery in social networks
• The Large Scale Curvature of Networks
• Towards Explainable Traffic Flow Prediction with Large Language Models
• Local Leaders in Random Networks
• Local dominance unveils clusters in networks
• Car-Following Models: A Multidisciplinary Review
• Modularity-based approach for tracking communities in dynamic social networks
• DuETA: Traffic Congestion Propagation Pattern Modeling via Efficient Graph Learning for ETA Prediction at Baidu Maps
• Dissipation of traffic congestion using agent-based car-following model with modified optimal velocity