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.

In this paper, we describe the method for the Road Traffic Network Division for Dynamic Network Loading (RTND-DNL), which is based on our formerly developed Imp-roved Dividing Genetic Algorithm with Graph Coarsening and Refining (IDGA-GC-R) method. The IDGA-GC-R method was originally designed for a detailed distributed road traffic simulation. Hence, some modifications were necessary to meet slightly different requirements of the dynamic network loading. However, the RTND-DNL method still employs a genetic algorithm, a graph coarsening, and a refining. The description of the RTND-DNL method along with its testing is the main contribution of this paper.