.png){kind=icon}
.png){kind=icon}
Return
An enhanced parallel block coordinate descent algorithm with shared memory for solving large-scale user equilibrium problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.tre.2025.104377.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• OpenMP-based parallelization of the PBCD algorithm to leverage shared memory parallelism efficiently. • Design of thread-private data structures to resolve data race issues in parallel computation. • Proposal of the Dynamic Block Reduction (DBR) method to adaptively adjust the parallel level during iterations. • Two schemes for DBR parameter selection: fixed parameters and self-adaptive parameters using the Armijo Rule. • Evaluation of a practical parallel computing framework, highlighting its substantial reduction in computation time and enhancement of performance in real-world, large-scale transportation networks.
Journal
IF:
8.8
Papers:
623
Citations:
2.0W