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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem


    Contributors:
    Wang, Zewen (author) / Zhang, Kai (author) / Chen, Xinyuan (author) / Wang, Meng (author) / Liu, Renwei (author) / Liu, Zhiyuan (author)

    Published in:

    Publication date :

    2022-12-02


    Size :

    25 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown






    Large-scale urban traffic network flow monitoring method based on block coordinate descent

    LIU ZHIYUAN / CHEN XINYUAN / ZHANG KAI et al. | European Patent Office | 2021

    Free access

    Distributed coordinate descent for generalized linear models with regularization

    Trofimov, I. / Genkin, A. | British Library Online Contents | 2017


    A Distributed Algorithm for the Dynamic Traffic Equilibrium Assignment Problem

    Wisten, M. B. / Smith, M. J. | British Library Conference Proceedings | 1996