Dynamic Multi-class Network Loading Problem

The dynamic network loading problem (DNLP) 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. The objective of this pap er is to present the formulation of an analytical dynamic multi-class network loading model. The mo del does not require the assumption of the FIFO condition. The existence of a solution to the model is shown.