Modeling and solving continuous-time instantaneous dynamic user equilibria: A differential complementarity systems approach

被引:47
作者
Ban, Xuegang [1 ]
Pang, Jong-Shi [2 ]
Liu, Henry X. [3 ]
Ma, Rui [1 ]
机构
[1] Rensselaer Polytech Inst, Dept Civil & Environm Engn, Troy, NY 12180 USA
[2] Univ Illinois, Dept Ind & Enterprise Syst Engn, Urbana, IL 61801 USA
[3] Univ Minnesota, Dept Civil Engn, Minneapolis, MN 55455 USA
基金
美国国家科学基金会;
关键词
Dynamic traffic assignment; Continuous-time instantaneous dynamic user equilibrium; Differential variational inequality; Differential complementarity system; Time delay ordinary differential equation; Convergence; TRAFFIC ASSIGNMENT; CONTROLLABILITY; EXISTENCE; QUEUES;
D O I
10.1016/j.trb.2011.11.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper is the second of a two-part research wherein we undertake a mathematically rigorous investigation of the continuous-time dynamic user equilibrium (DUE) problem using the recently introduced mathematical paradigm of differential complementarity systems (DCSs). Based on the thorough study of continuous-time single-destination point-queue models in the previous part, we first extend this special case to multiple destinations respecting the First-In-First-Out property of travel flows. A DCS with constant time delay is then introduced to formulate the continuous-time model of instantaneous dynamic traffic equilibria (IDUE) with a fixed demand profile. We develop a time decomposition scheme based on link free flow travel times to convert the delay DCS to a series of DCSs without time delays that are solved by a numerical time-stepping method. We provide rigorous numerical treatment of the time-decomposed IDUE model, including solvability of the discrete-time complementarity problems and convergence of the numerical trajectories to a continuous-time solution. We present numerical results to validate the IDUE on a small network and also on the Sioux Falls network. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:389 / 408
页数:20
相关论文
共 52 条
[31]   Dynamic user optimal assignment with physical queues for a many-to-many OD pattern [J].
Kuwahara, M ;
Akamatsu, T .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (05) :461-479
[32]   Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern. [J].
Kuwahara, M ;
Akamatsu, T .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1997, 31 (01) :1-10
[33]   Dynamic user optimal traffic assignment model for many to one travel demand [J].
Lam, WHK ;
Huang, HJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1995, 29 (04) :243-259
[34]  
Merchant D. K., 1978, Transportation Science, V12, P200, DOI 10.1287/trsc.12.3.200
[35]   MODEL AND AN ALGORITHM FOR THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS. [J].
Merchant, Deepak K. ;
Nemhauser, George L. .
1600, (12)
[36]   A comparative study of some macroscopic link models used in dynamic traffic assignment [J].
Nie, XJ ;
Zhang, HM .
NETWORKS & SPATIAL ECONOMICS, 2005, 5 (01) :89-115
[37]  
Pang J., MATH PROGRA IN PRESS
[38]   Solution dependence on initial conditions in differential variational inequalities [J].
Pang, Jong-Shi ;
Stewart, David E. .
MATHEMATICAL PROGRAMMING, 2009, 116 (1-2) :429-460
[39]   Differential variational inequalities [J].
Pang, Jong-Shi ;
Stewart, David E. .
MATHEMATICAL PROGRAMMING, 2008, 113 (02) :345-424
[40]   Strongly regular differential variational systems [J].
Pang, Jong-Shi ;
Shen, Jinglai .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (02) :242-255