Parallelization of the B Static Traffic Assignment Algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43963331" target="_blank" >RIV/49777513:23520/22:43963331 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S2090447921003403" target="_blank" >https://www.sciencedirect.com/science/article/pii/S2090447921003403</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.asej.2021.09.003" target="_blank" >10.1016/j.asej.2021.09.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallelization of the B Static Traffic Assignment Algorithm

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Parallelization of the B Static Traffic Assignment Algorithm

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Ain Shams Engineering Journal

ISSN

2090-4479

e-ISSN

2090-4495

Svazek periodika

13

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

19

Strana od-do

1-19

Kód UT WoS článku

000829965500009

EID výsledku v databázi Scopus

2-s2.0-85115150142