Dynamic capacitated user-optimal route choice problem

Huey Kuo Chen, Chung Yung Wang

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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.

Original languageEnglish
Pages (from-to)16-24
Number of pages9
JournalTransportation Research Record
Issue number1667
StatePublished - 1999


Dive into the research topics of 'Dynamic capacitated user-optimal route choice problem'. Together they form a unique fingerprint.

Cite this