Comparison of Parallel B Static Traffic Assignment Algorithm Implementation in Java and C++
This paper compares sequential and parallel Java and C++ implementations of the B algorithm, a relatively new algorithm for user-equilibrium (UE) (road) traffic assignment (TA). All the versions were implemented in an optimized way while using best practices in both languages. Their performances were thoroughly tested using multiple large real road traffic networks. The tests showed that the C++ version is indeed faster in most cases, but only by 8.54 % on average.
Authors
- Tomáš Potužák (ORCID: https://orcid.org/0000-0002-8140-5178)
- František Kolovský (ORCID: https://orcid.org/0000-0002-2070-5871)
- Petr Pernicka
Institutions
- University of West Bohemia in Pilsen (CZ)
Publication Details
- Published
- 2024-10-07
- DOI
- https://doi.org/10.1109/ds-rt62209.2024.00032
- Citations
- 2
- Primary Topic
- Real-Time Systems Scheduling
- Type
- article
- Field-Weighted Citation Impact
- 0.98