Parallelization of the B static traffic assignment algorithm

A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This technique assigns trips from origins to destinations in a road traffic network so that all trips use the cheapest path. The cost of the path,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Ain Shams Engineering Journal Ročník 13; číslo 2; s. 101576
Hlavní autoři: Potuzak, Tomas, Kolovsky, Frantisek
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.03.2022
Elsevier
Témata:
Algorithm parallelization
B algorithm
Shared memory environment
Static traffic assignment
User equilibrium
User equilibrium
Static traffic assignment
B algorithm
Shared memory environment
Algorithm parallelization
ISSN:2090-4479
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A widely used technique for predicting traffic flows in individual roads of a road traffic network is the user-equilibrium (UE) traffic assignment (TA). This technique assigns trips from origins to destinations in a road traffic network so that all trips use the cheapest path. The cost of the path, which consists of roads (edges), is the sum of the roads costs. These costs increase with increasing flow in these roads. In this paper, we describe the parallelization of the B algorithm – a relatively new TA algorithm with a fast convergence to a solution. Since the nature of the algorithm and the nature of its fast convergence complicate the parallelization itself, we considered and implemented three parallel variants and tested them on real road traffic networks to investigate their convergence, usability, and speed. The parallelization is intended for a shared memory parallel computing environment. The description of the parallelization along with the performed tests is the main contribution of this paper.
ISSN:2090-4479
DOI:10.1016/j.asej.2021.09.003