A Framework of Robust Congestion Mitigation with Traffic Estimation, Split Ratio Optimisation and Path Planning

被引:0
|
作者
Jia, Guangyu [1 ]
Kong, Bing [2 ]
Yang, Lijin [2 ]
Zhang, Yong [2 ]
Zeng, Jin [2 ]
Li, Cong [2 ]
Zhu, Yong [1 ]
Zhang, Jie [1 ]
机构
[1] Huawei Technol Co Ltd, Shenzhen, Peoples R China
[2] Ind & Commercial Bank China, Beijing, Peoples R China
关键词
Traffic engineering; Robust optimisation; Network routing; Traffic estimation;
D O I
10.1109/ICCWORKSHOPS57953.2023.10283723
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Extensive traffic micro-bursts as well as limited capabilities of network infrastructures result in unpredictable network congestions which have large impacts on the quality of service. In order to effectively and robustly mitigate network congestions, this paper proposes a framework which incorporates future traffic estimation with edge learning, split ratio optimisation via the multi-step linear programming, as well as path planning using a revised column generation algorithm. The combination of traffic prediction and the proposed optimisation framework takes future traffic into consideration and guarantees the robustness of segment routing process. The revised column generation algorithm enables flexible re-routing of traffic distributed to congested links and significantly reduces congestion areas. Extensive experiments on a specific traffic dataset and three benchmark datasets show the feasibility and effectiveness of the proposed algorithms.
引用
收藏
页码:837 / 842
页数:6
相关论文
共 20 条
  • [1] Dynamic Path Planning Based on Improved Ant Colony Algorithm in Traffic Congestion
    Wu, Chunjiang
    Zhou, Shijie
    Xiao, Licai
    [J]. IEEE ACCESS, 2020, 8 (180773-180783) : 180773 - 180783
  • [2] BaroSense: Using Barometer for Road Traffic Congestion Detection and Path Estimation with Crowdsourcing
    Dimri, Anuj
    Singh, Harsimran
    Aggarwal, Naveen
    Raman, Bhaskaran
    Ramakrishnan, K. K.
    Bansal, Divya
    [J]. ACM TRANSACTIONS ON SENSOR NETWORKS, 2020, 16 (01)
  • [3] Autonomous UAV Path Planning and Estimation An Online Path Planning Framework for Cooperative Search and Localization
    Tisdale, John
    Kim, ZuWhan
    Hedrick, J. Karl
    [J]. IEEE ROBOTICS & AUTOMATION MAGAZINE, 2009, 16 (02) : 35 - 42
  • [4] A stochastic programming model for emergency supply planning considering transportation network mitigation and traffic congestion
    Wang, Qingyi
    Nie, Xiaofeng
    [J]. SOCIO-ECONOMIC PLANNING SCIENCES, 2022, 79
  • [5] Urban traffic control and path planning for vehicles in game theoretic framework
    Harmati, Istvan
    [J]. Robot Motion and Control 2007, 2007, 360 : 437 - 444
  • [6] A Hybrid Traffic Light Control Strategy Based on Branching Ratio Estimation and Congestion Identification
    Zhang, Yicheng
    Chen, Qixing
    Su, Rong
    Zhang, Yi
    Sun, Chunyang
    [J]. 2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 1255 - 1260
  • [7] Research on Intelligent Traffic Congestion Degree Collaborative Algorithm and Path Planning Based on Sensor Data
    Sun, Hanzheng
    Zhang, Xuejing
    Li, Dan
    Tan, Jianling
    [J]. TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2024, 31 (04): : 1154 - 1162
  • [8] Tackling Airspace Congestion: A Scalable and Robust Framework for End-to-End UAS Traffic Management
    Sung, Minjun
    Karumanchi, Sambhu H.
    Hiltebrandt-McIntosh, Christophe J.
    Kim, Hunmin
    Hovakimyan, Naira
    [J]. 2023 IEEE 26TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, ITSC, 2023, : 1468 - 1473
  • [9] Robust and resilient equilibrium routing mechanism for traffic congestion mitigation built upon correlated equilibrium and distributed optimization
    Ning, Yuqiang
    Du, Lili
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2023, 168 : 170 - 205
  • [10] A robust optimisation framework in composite generation and transmission expansion planning considering inherent uncertainties
    Mansouri, Seyed Amir
    Javadi, Mohammad Sadegh
    [J]. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2017, 29 (04) : 717 - 730