Solving the dynamic user optimal assignment problem considering queue spillback

Yu Marco Nie, H. M. Zhang

Research output: Contribution to journalArticlepeer-review

58 Scopus citations


This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to encapsulate traffic dynamics. The presented DNL model is capable of capturing realistic traffic phenomena such as queue spillback. Various VI solution algorithms, particularly those based on feasible directions and a line search, are applied to solve the formulated DUO problem. Two examples are constructed to check equilibrium solutions obtained from numerical algorithms, to compare the performance of the algorithms, and to study the impacts of traffic interacts across multiple links on equilibrium solutions.

Original languageEnglish (US)
Pages (from-to)49-71
Number of pages23
JournalNetworks and Spatial Economics
Issue number1
StatePublished - Feb 2010


  • Dynamic network loading
  • Dynamic user optimal traffic assignment
  • Feasible direction algorithms
  • Variational inequality

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Solving the dynamic user optimal assignment problem considering queue spillback'. Together they form a unique fingerprint.

Cite this