End-to-End Heterogeneous Graph Neural Networks for Traffic Assignment
Tong Liu, Hadi Meidani

TL;DR
This paper introduces a novel end-to-end heterogeneous graph neural network model for traffic assignment that captures spatial traffic patterns and ensures flow conservation, outperforming traditional models in accuracy and convergence.
Contribution
The paper proposes a new heterogeneous graph neural network with adaptive attention and virtual links for improved traffic assignment prediction.
Findings
Outperforms conventional neural networks in accuracy and convergence.
Effectively captures spatial traffic patterns across links.
Generalizes well to different network topologies.
Abstract
The traffic assignment problem is one of the significant components of traffic flow analysis for which various solution approaches have been proposed. However, deploying these approaches for large-scale networks poses significant challenges. In this paper, we leverage the power of heterogeneous graph neural networks to propose a novel end-to-end surrogate model for traffic assignment, specifically user equilibrium traffic assignment problems. Our model integrates an adaptive graph attention mechanism with auxiliary "virtual" links connecting origin-destination node pairs, This integration enables the model to capture spatial traffic patterns across different links, By incorporating the node-based flow conservation law into the overall loss function, the model ensures the prediction results in compliance with flow conservation principles, resulting in highly accurate predictions for both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTraffic Prediction and Management Techniques · Traffic control and management · Neural Networks and Applications
MethodsGraph Neural Network
