Link capacity side constraints are explicitly incorporated into the variational inequality-based dynamic user-optimal route choice problem. The corresponding dynamic capacitated user-optimal conditions for each origin-destination pair and time interval state that the generalized route travel times (composed of route travel times and queuing delays) experienced by travelers are equal and minimal. An augmented Lagrangian dual method that embeds the gradient projection algorithm is then proposed and validated with a numerical example. The computational performance of the gradient projection algorithm is also compared with the disaggregate simplicial decomposition algorithm in a preliminary attempt.
Dynamic Capacitated User-Optimal Route Choice Problem
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 1667 , 1 ; 16-24
1999-01-01
Article (Journal)
Electronic Resource
English
Dynamic Capacitated User-Optimal Route Choice Problem
Online Contents | 1999
|Dynamic Capacitated User-Optimal Route Choice Problem
British Library Conference Proceedings | 1999
|A model and an algorithm for the dynamic user-optimal route choice problem
Online Contents | 1998
|British Library Conference Proceedings | 1999
|Transportation Research Record | 1999
|