arrow
Return

An ADMM-based splitting algorithm with multiplier sequential updates for solving traffic assignment

delete2025-07-05
delete0
PRE
AI
刘鹏杰 cover
刘鹏杰 (Pengjie Liu)
H
Hu Shao *
S
Shengbei Xu
C
Chunkai Tang
DOI:10.1080/23249935.2025.2528952delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Efficient algorithms for solving traffic assignment (TA) problems have garnered significant attention in transportation research. This study focuses on designing a splitting algorithm for the user equilibrium (UE)-TA problem by leveraging decomposition and parallelisation techniques. First, we employ the origin-based form of the UE-TA problem, which facilitates the decomposition of the original problem into independent block-based (also referred to as link-based) subproblems. This decomposition strategy enables the algorithm to handle large-scale scenarios with minimal storage requirements. Then, we propose an alternating direction method of multipliers-based algorithm that utilises parallel computing techniques to solve the UE-TA problem. The Lagrange multiplier update, which has lower computational costs compared to solving the block-based subproblem, is performed before solving each decomposed block-based subproblem, resulting in a sequential update scheme in each iteration. In addition, a relaxation factor is introduced in each Lagrange multiplier update step to improve numerical performance. Our update scheme follows a Gauss-Seidel structure for updating both Lagrange multipliers and block-based link flows. Moreover, parallel computing is applied separately to Lagrange multiplier updates and link-based subproblems. Within each block of decision variables, the separable link-based subproblems are solved simultaneously using the gradient projection method. Finally, we demonstrate the computational performance and potential of the proposed algorithm through numerical experiments conducted on four different traffic networks.
Keywords:
Traffic assignment
user equilibrium
alternating direction method of multipliers
sequential updates of the Lagrange multiplier
parallel computing mode

Journal

Transportmetrica A-Transport Science cover
Transportmetrica A-Transport Science
IF:
3.1
Papers:
939
Citations:
2.2K

Organization

T
texas state university
Scholars:
243
Papers: 165
Citations: 2
C
China University of Mining and Technology
Scholars:
8.6K
Papers: 3.1K
Citations: 3.1W
Cited Papers

Cited Papers

A partial linearization method for the traffic assignment problem
err2007-03-20
err0
errOAAI
errT. Larsson; A. Migdalas; M. Partriksson
errShare
errSave
A Column Generation Algorithm for Optimal Traffic Assignment
err1973-05-01
err0
PREAI
errT. Leventhal; G. Nemhauser; L. Trotter
errShare
errSave
A non-convex regularization approach for compressive sensing
err2018-08-09
err0
errOAAI
errYa-Ru Fan; Alessandro Buccini; Marco Donatelli; Ting-Zhu Huang
errShare
errSave
An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem
err2021-06-24
err10
PREAI
errWang, Zewen; Zhang, Kai; Chen, Xinyuan; Wang, Meng; Liu, Renwei; Liu, Zhiyuan
errShare
errSave
Urban multimodal traffic assignment
err2022-09-01
err0
errOAAI
errYu Jiang; Otto Anker Nielsen
errShare
errSave
researcher View more