Solving the dynamic user optimal assignment problem considering queue spillback

Yu Marco Nie; H. M. Zhang

doi:10.1007/s11067-007-9022-y

Solving the dynamic user optimal assignment problem considering queue spillback

Yu Marco Nie, H. M. Zhang

Civil and Environmental Engineering

Research output: Contribution to journal › Article › peer-review

58 Scopus citations

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.

Original language	English (US)
Pages (from-to)	49-71
Number of pages	23
Journal	Networks and Spatial Economics
Volume	10
Issue number	1
DOIs	https://doi.org/10.1007/s11067-007-9022-y
State	Published - Feb 2010

Keywords

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

ASJC Scopus subject areas

Software
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1007/s11067-007-9022-y

Cite this

@article{5c171be92a5c403b93ba45f32874247d,

title = "Solving the dynamic user optimal assignment problem considering queue spillback",

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.",

keywords = "Dynamic network loading, Dynamic user optimal traffic assignment, Feasible direction algorithms, Variational inequality",

author = "Nie, {Yu Marco} and Zhang, {H. M.}",

year = "2010",

month = feb,

doi = "10.1007/s11067-007-9022-y",

language = "English (US)",

volume = "10",

pages = "49--71",

journal = "Networks and Spatial Economics",

issn = "1566-113X",

publisher = "Kluwer Academic Publishers",

number = "1",

}

TY - JOUR

T1 - Solving the dynamic user optimal assignment problem considering queue spillback

AU - Nie, Yu Marco

AU - Zhang, H. M.

PY - 2010/2

Y1 - 2010/2

N2 - 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.

AB - 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.

KW - Dynamic network loading

KW - Dynamic user optimal traffic assignment

KW - Feasible direction algorithms

KW - Variational inequality

UR - http://www.scopus.com/inward/record.url?scp=77149171785&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77149171785&partnerID=8YFLogxK

U2 - 10.1007/s11067-007-9022-y

DO - 10.1007/s11067-007-9022-y

M3 - Article

AN - SCOPUS:77149171785

SN - 1566-113X

VL - 10

SP - 49

EP - 71

JO - Networks and Spatial Economics

JF - Networks and Spatial Economics

IS - 1

ER -

Solving the dynamic user optimal assignment problem considering queue spillback

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this