An improved alternating direction method of multipliers for solving deterministic user equilibrium

被引:0
作者
Zhang, Honggang [1 ]
Liu, Zhiyuan [1 ,2 ,5 ]
Xu, Xiangyang [3 ]
Chen, Xinyuan [4 ]
Wu, Yunchi [1 ]
Liu, Pan [1 ,2 ]
机构
[1] Southeast Univ, Jiangsu Prov Collaborat Innovat Ctr Modern Urban T, Jiangsu Key Lab Urban ITS, Sch Transportat, Nanjing, Peoples R China
[2] Minist Transport, Key Lab Transport Ind Comprehens Transportat Theor, Nanjing Modern Multimodal Transportat Lab, Nanjing, Peoples R China
[3] Soochow Univ, Sch Rail Transportat, Suzhou, Peoples R China
[4] Nanjing Univ Aeronaut & Astronaut, Coll Civil Aviat, Nanjing, Peoples R China
[5] Southeast Univ, Sch Transportat, Nanjing 211189, Peoples R China
基金
中国国家自然科学基金;
关键词
Deterministic user equilibrium; parallel computing; alternating direction method of multipliers; primal residual; PATH-BASED ALGORITHM; TRAFFIC ASSIGNMENT; DECOMPOSITION;
D O I
10.1080/23249935.2024.2328209
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
An improved alternating direction method of multipliers (iADMM) algorithm is proposed for solving the deterministic user equilibrium (DUE) problem. The iADMM algorithm introduces a key improvement wherein the primal variables can be updated sequentially, possibly multiple times, before updating the dual variables. Subsequently, a sensitivity analysis method is applied to optimise the update frequency of primal variable, and two indices are introduced to evaluate the performance of various policies. Additionally, eliminating equality constraints through the augmented Lagrangian function makes it challenging to completely satisfy flow conservation conditions, resulting in the presence of primal residual. To address this issue, two schemes are proposed to handle the primal residual, involving modifications to the primal variables based on iterative messages. Numerical experiments highlight that the convergence of ADMM algorithm is significantly influenced by the update frequency of primal variable, and addressing the primal residual after each cycle enhances the convergence of ADMM algorithm.
引用
收藏
页数:19
相关论文
共 41 条
  • [1] [Anonymous], 1998, Modern Graph Theory. Graduate Texts in Mathematics
  • [2] Reduced gradient algorithm for user equilibrium traffic assignment problem
    Babazadeh, Abbas
    Javani, Babak
    Gentile, Guido
    Florian, Michael
    [J]. TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2020, 16 (03) : 1111 - 1135
  • [3] Origin-based algorithm for the traffic assignment problem
    Bar-Gera, H
    [J]. TRANSPORTATION SCIENCE, 2002, 36 (04) : 398 - 417
  • [4] Traffic assignment by paired alternative segments
    Bar-Gera, Hillel
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2010, 44 (8-9) : 1022 - 1046
  • [5] Bertsekas D. P., 1989, Parallel and Distributed Computation: Numerical Methods, V23
  • [6] Distributed optimization and statistical learning via the alternating direction method of multipliers
    Boyd S.
    Parikh N.
    Chu E.
    Peleato B.
    Eckstein J.
    [J]. Foundations and Trends in Machine Learning, 2010, 3 (01): : 1 - 122
  • [7] Boyd S., 2004, Convex optimization, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
  • [8] Faster Frank-Wolfe traffic assignment with new flow update scheme
    Chen, A
    Jayakrishnan, R
    Tsai, WK
    [J]. JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2002, 128 (01): : 31 - 39
  • [9] A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm
    Chen, Xinyuan
    Liu, Zhiyuan
    Zhang, Kai
    Wang, Zewen
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 120
  • [10] TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK
    DAFERMOS, SC
    SPARROW, FT
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02): : 91 - +