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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Wang, Zewen (Autor:in) / Zhang, Kai (Autor:in) / Chen, Xinyuan (Autor:in) / Wang, Meng (Autor:in) / Liu, Renwei (Autor:in) / Liu, Zhiyuan (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    2022-12-02


    Format / Umfang :

    25 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt






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

    LIU ZHIYUAN / CHEN XINYUAN / ZHANG KAI et al. | Europäisches Patentamt | 2021

    Freier Zugriff

    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