All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parallelization of the B Static Traffic Assignment Algorithm

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallelization of the B Static Traffic Assignment Algorithm

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Ain Shams Engineering Journal

  • ISSN

    2090-4479

  • e-ISSN

    2090-4495

  • Volume of the periodical

    13

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    19

  • Pages from-to

    1-19

  • UT code for WoS article

    000829965500009

  • EID of the result in the Scopus database

    2-s2.0-85115150142