Content area

Abstract

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.[PUBLICATION ABSTRACT]

Details

Title
Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback
Author
Nie, Yu (marco); Zhang, H M
Pages
49-71
Publication year
2010
Publication date
Mar 2010
Publisher
Springer Nature B.V.
ISSN
1566113X
e-ISSN
15729427
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
205821299
Copyright
Springer Science+Business Media, LLC 2010