The General Link Transmission Model for Dynamic Network Loading and a Comparison with the DUE Algorithm

The Continuous Dynamic Network Loading problem is here addressed for giv-en splitting rates, hence allowing for implicit path enumeration. To this aim, a macroscopic flow model for road links based on the Kinematic Wave Theory is coupled with a node model with priority rules at intersections, thus reproducing congested networks including queue spillback. The result is the General Link Transmission Model (GLTM), which extends previous results to the case of any concave fundamental diagram and node topology, without introducing spatial discretization of links into cells. The GLTM is compared with the DUE algorithm in terms of solution accuracy, computation efficiency and memory usage.