Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
