End-to-end heterogeneous graph neural networks for traffic assignment

被引:0
|
作者
Liu, Tong [1 ]
Meidani, Hadi [1 ]
机构
[1] Department of Civil and Environmental Engineering University of Illinois, Urbana-Champaign, United States
基金
美国国家科学基金会;
关键词
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 link flow and flow-capacity ratios. We present numerical experiments on urban transportation networks and show that the proposed heterogeneous graph neural network model outperforms other conventional neural network models in terms of convergence rate and prediction accuracy. Notably; by introducing two different training strategies; the proposed heterogeneous graph neural network model can also be generalized to different network topologies. This approach offers a promising solution for complex traffic flow analysis and prediction; enhancing our understanding and management of a wide range of transportation systems. © 2024;
D O I
10.1016/j.trc.2024.104695
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] An End-to-End Dense Connected Heterogeneous Graph Convolutional Neural Network
    Yan, Ranhui
    Cai, Jia
    [J]. NEURAL INFORMATION PROCESSING, ICONIP 2023, PT I, 2024, 14447 : 462 - 475
  • [2] Heterogeneous Relational Graph Neural Networks with Adaptive Objective for End-to-End Task-Oriented Dialogue
    Liu, Qingbin
    Bai, Guirong
    He, Shizhu
    Liu, Cao
    Liu, Kang
    Zhao, Jun
    [J]. KNOWLEDGE-BASED SYSTEMS, 2021, 227
  • [3] End-to-End Radio Traffic Sequence Recognition with Recurrent Neural Networks
    O'Shea, Timothy J.
    Hitefield, Seth
    Corgan, Johnathan
    [J]. 2016 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2016, : 277 - 281
  • [4] End-to-end QoS support for IP and multimedia traffic in heterogeneous mobile networks
    Jamalipour, A
    Lorenz, P
    [J]. COMPUTER COMMUNICATIONS, 2006, 29 (06) : 671 - 682
  • [5] Traffic sampling methods for end-to-end QoS evaluation in large heterogeneous networks
    Cozzani, I
    Giordano, S
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (16-18): : 1697 - 1706
  • [6] Node delay assignment strategies to support end-to-end delay requirements in heterogeneous networks
    Znati, TF
    Melhem, R
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (05) : 879 - 892
  • [7] An end-to-end heterogeneous network for graph similarity learning
    Huang, Yan
    Huang, Jing
    Chen, Xiaoqiang
    Wang, Qicong
    Meng, Hongying
    [J]. NEUROCOMPUTING, 2022, 504 : 210 - 222
  • [8] An Effective End-to-End Image Matching Network with Attentional Graph Neural Networks
    Fu, Kuiyuan
    Liu, Zhong
    Wu, Xingming
    Sun, Chongshang
    Chen, Weihai
    [J]. 2022 IEEE 17TH CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2022, : 1628 - 1633
  • [9] Characterization of the End-to-End Delay in Heterogeneous Networks
    Fadhil, Diyar
    Oliveira, Rodolfo
    [J]. PROCEEDINGS OF THE 2021 12TH INTERNATIONAL CONFERENCE ON NETWORK OF THE FUTURE (NOF 2021), 2021,
  • [10] End-to-end service provisioning in heterogeneous optical grid networks under scheduled traffic
    Zhou, Luying
    Saradhi, Chava Vijaya
    [J]. 2006 10TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS, VOLS 1 AND 2, 2006, : 521 - +