A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem

Honggang Zhang, Zhiyuan Liu (), Yicheng Zhang, Weijie Chen and Chenyang Zhang
Additional contact information
Honggang Zhang: Southeast University
Zhiyuan Liu: Southeast University
Yicheng Zhang: Southeast University
Weijie Chen: Southeast University
Chenyang Zhang: Southeast University

Networks and Spatial Economics, 2024, vol. 24, issue 2, No 3, 381 pages

Abstract: Abstract This paper presents two novel algorithmic frameworks to address the logit-based stochastic user equilibrium traffic assignment problem (SUE-TAP). Following the different variant of the gradient projection (termed as GP2) algorithm, we propose an improved GP2 algorithm (IGP) for the SUE-TAP. This study initially presents a smart approach for determining the allocation of more or less effort to specific origin–destination (OD) pairs. Subsequently, the TAP can be decomposed by different OD pairs, whereas the proposed IGP algorithm is designed based on the serial scheme (i.e., the Gauss–Seidel method). Therefore, a new parallel algorithm P-IGP is proposed, which integrates the block coordinate descent (BCD) method and the IGP algorithm. In specific, the independent OD pairs can be separated into several blocks, and the OD-based restricted subproblems within each block can be solved in parallel. Then, we outline the entire process of implementing the P-IGP algorithm to address the SUE-TAP. Several numerical experiments are conducted to verify the proposed algorithms. The results reveal that the proposed IGP algorithm demonstrates significantly speeder convergence in comparison to the traditional GP2 algorithm, achieving a remarkable acceleration of approximately 12%. Furthermore, the performance of the P-IGP algorithm surpasses that of the proposed IGP algorithm, and it can further achieve a notable 4–5-fold enhancement in convergence efficiency.

Keywords: Stochastic user equilibrium; Gradient projection; Intelligent scheme; Parallel computing (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11067-024-09617-3 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:netspa:v:24:y:2024:i:2:d:10.1007_s11067-024-09617-3

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11067/PS2

DOI: 10.1007/s11067-024-09617-3

Access Statistics for this article

Networks and Spatial Economics is currently edited by Terry L. Friesz

More articles in Networks and Spatial Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().