An improved parallel block coordinate descent (iPBCD) algorithm for solving the user equilibrium traffic assignment problem is proposed. The iPBCD algorithm is developed based on the parallel block coordinate descent algorithm (PBCD). The hybrid flow update policy is investigated to enhance the robustness and performance of the PBCD algorithm. Two update order rules, namely a cyclic rule and a greedy rule are compared for block indices. Then, the block size is optimized using a sensitivity analysis test. Finally, five index-grouping rules are tested for comparative purposes. Numerical experiments indicate that index-grouping rules have a significant influence on convergence: the information-based drop-out rule performs better in terms of convergence and efficiency.
An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem
Transportmetrica A: Transport Science ; 18 , 3 ; 1376-1400
2022-12-02
25 pages
Article (Journal)
Electronic Resource
Unknown
An extended coordinate descent method for distributed anticipatory network traffic control
Online Contents | 2015
|Large-scale urban traffic network flow monitoring method based on block coordinate descent
European Patent Office | 2021
|Distributed coordinate descent for generalized linear models with regularization
British Library Online Contents | 2017
|A Distributed Algorithm for the Dynamic Traffic Equilibrium Assignment Problem
British Library Conference Proceedings | 1996
|