A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem

•A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is proposed to solve the CMSTA problem. The first parallel stage of the TP algorithm is used in the path generation phase, and the second paral...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & operations research Ročník 154; s. 106193
Hlavní autori: Zhang, Kai, Zhang, Honggang, Cheng, Qixiu, Chen, Xinyuan, Wang, Zewen, Liu, Zhiyuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.06.2023
Predmet:
Distributed Parallel computing
Gradient Projection
Modal Split
Traffic Assignment Problem
Gradient Projection
Traffic Assignment Problem
Distributed Parallel computing
Modal Split
ISSN:0305-0548, 1873-765X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•A block-decomposed model is proposed for solving the combined modal split and traffic assignment (CMSTA) problem.•A customized two-stage parallel algorithm is proposed to solve the CMSTA problem. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase.•An optimal parallel computing resource schedule is proposed to solve each block problem.•The parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources.•To validate the two-stage parallel method with large-scale networks. Efficiently solving the traffic assignment problem (TAP) for large-scale transport networks is a critical problem for transportation studies. Most of the existing algorithms for TAP are serial ones based on single-computer mode, which has inherently limited the computational efficiency, compared with parallel computing methods. Thus, this paper aims to propose an efficient distributed multi-computer cluster resource allocation method for the parallel computing of TAP. Previous studies on the parallel computing of TAP are mainly based on a single-mode, which is extended to a more complex combined modal split and traffic assignment (CMSTA) case in this paper. In order to decompose the CMSTA problem, we proposed a block-decomposed model for solving the CMSTA problem. Then we designed an optimal parallel computing resource schedule for solving each block problem more quickly on the huge transportation network. Therefore, we implemented a customized two-stage parallel (TP) algorithm that can fully use parallel resources. The first parallel stage of the TP algorithm is used in the path generation phase, and the second parallel stage is used in the path flow adjustment phase. Besides, the parallel slowdown is uncovered in calculating each block problem of the path flow adjustment phase by using parallel resources. Numerical examples are taken to validate the efficiency and robustness of the proposed TP algorithm.
ISSN:0305-0548
1873-765X
DOI:10.1016/j.cor.2023.106193