Advances in the continuous dynamic network loading problem

The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departure rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. In this paper, we present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes. We prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for a discretized version of the algorithm.