Advances in the continuous dynamic network loading problem

The continuous dynamic network loading problem (CDNLP) consists in determin ing, on a congested network, time-dependent are volumes, together with are and path travel times, given the time-varying path flour departue rates ove r 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 are traffic volumes. We prove, under a boundedness condition, that there exists a uniq ue solution to the problem and propose for its solution a finite-step algor ithm. Some computational results are reported for a discretized version of the algorithm.