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
相关论文
共 50 条
  • [41] Alternating direction method of multipliers for linear hyperspectral unmixing
    Yu-Hong Dai
    Fangfang Xu
    Liwei Zhang
    Mathematical Methods of Operations Research, 2023, 97 : 289 - 310
  • [42] An alternating direction method of multipliers for tensor complementarity problems
    Haoran Zhu
    Liping Zhang
    Computational and Applied Mathematics, 2021, 40
  • [43] Alternating direction method of multipliers with difference of convex functions
    Sun, Tao
    Yin, Penghang
    Cheng, Lizhi
    Jiang, Hao
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2018, 44 (03) : 723 - 744
  • [44] Decentralizing Consensus-Alternating Direction Method of Multipliers
    Routray, Chinmay
    Sahoo, Soumya Ranjan
    2023 EUROPEAN CONTROL CONFERENCE, ECC, 2023,
  • [45] A Unified Alternating Direction Method of Multipliers by Majorization Minimization
    Lu, Canyi
    Feng, Jiashi
    Yan, Shuicheng
    Lin, Zhouchen
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2018, 40 (03) : 527 - 541
  • [46] Alternating direction method of multipliers for linear hyperspectral unmixing
    Dai, Yu-Hong
    Xu, Fangfang
    Zhang, Liwei
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 97 (03) : 289 - 310
  • [47] An Alternating Direction Method of Multipliers for Inverse Lithography Problem
    Chen, Junqing
    Liu, Haibo
    NUMERICAL MATHEMATICS-THEORY METHODS AND APPLICATIONS, 2023, 16 (03): : 820 - 846
  • [48] Phase Retrieval via the Alternating Direction Method of Multipliers
    Liang, Junli
    Stoica, Petre
    Jing, Yang
    Li, Jian
    IEEE SIGNAL PROCESSING LETTERS, 2018, 25 (01) : 5 - 9
  • [49] Dual Alternating Direction Method of Multipliers for Inverse Imaging
    Song, Li
    Ge, Zhou
    Lam, Edmund Y.
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2022, 31 : 3295 - 3308
  • [50] An inexact proximal generalized alternating direction method of multipliers
    V. A. Adona
    M. L. N. Gonçalves
    J. G. Melo
    Computational Optimization and Applications, 2020, 76 : 621 - 647