Dynamic user equilibrium problem with link capacity and first-in-first-out constraints

The paper incorporates both the link capacity and first-in-first-out constraints into the dynamic user equilibrium problem. The corresponding dynamic equilibrium conditions for each origin-destination pair and time interval state that the generalized route travel times experienced by travelers are equal and minimal. A nested Lagrangian method embedding the gradient projection algorithm is then proposed and demonstrated with a numerical example.