Computing Individual Path Marginal Cost in Networks with Queue Spillbacks

被引:15
作者
Qian, Zhen [1 ]
Zhang, H. Michael [1 ]
机构
[1] Univ Calif Davis, Dept Civil & Environm Engn, Davis, CA 95616 USA
关键词
CELL TRANSMISSION MODEL; TRAFFIC ASSIGNMENT; FLOWS;
D O I
10.3141/2263-02
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
"Individual path marginal cost" (IPMC) is defined as the change in travel cost of one unit of flow on a time-dependent path caused by one unit of flow on another time-dependent path. Knowledge of IPMC is central to dynamic transportation modeling, for instance, to compute system-optimal network performance, to solve a dynamic origin-destination (O-D) estimation problem, and to analyze equity issues for travelers with different origins and destinations. This paper proposes a method of approximating IPMC for general networks, in which a cell transmission model-based kinematic wave model is used to model traffic dynamics. By tracing the changes in the cumulative flow curves of the bottleneck links on which queues form during dynamic network loading, an approximation method is developed to obtain the IPMC for the cases of merge junctions, diverge junctions, and general junctions. This method was applied to compute the total path marginal cost in a network. The results showed that vehicles at the beginning of the congestion duration had significantly larger marginal travel costs than other vehicles. The method was then applied to solve a dynamic O-D estimation problem with partial link-flow counts and historical O-D trip tables. With the incorporation of IPMC into the estimation procedure, both the O-D demands and the observed path travel times were successfully reproduced.
引用
收藏
页码:9 / 18
页数:10
相关论文
共 16 条
[1]   OPTIMAL TIME-VARYING FLOWS ON CONGESTED NETWORKS [J].
CAREY, M .
OPERATIONS RESEARCH, 1987, 35 (01) :58-69
[2]   THE CELL TRANSMISSION MODEL - A DYNAMIC REPRESENTATION OF HIGHWAY TRAFFIC CONSISTENT WITH THE HYDRODYNAMIC THEORY [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1994, 28 (04) :269-287
[3]   THE CELL TRANSMISSION MODEL .2. NETWORK TRAFFIC [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1995, 29 (02) :79-93
[4]   DYNAMIC NETWORK TRAFFIC ASSIGNMENT CONSIDERED AS A CONTINUOUS-TIME OPTIMAL-CONTROL PROBLEM [J].
FRIESZ, TL ;
LUQUE, J ;
TOBIN, RL ;
WIE, BW .
OPERATIONS RESEARCH, 1989, 37 (06) :893-901
[5]   A MODEL FOR THE DYNAMIC SYSTEM OPTIMUM TRAFFIC ASSIGNMENT PROBLEM [J].
GHALI, MO ;
SMITH, MJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1995, 29 (03) :155-170
[6]   On the distribution schemes for determining flows through a merge [J].
Jin, WL ;
Zhang, HM .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :521-540
[7]   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
[8]  
Merchant D. K., 1978, Transportation Science, V12, P200, DOI 10.1287/trsc.12.3.200
[9]   MODEL AND AN ALGORITHM FOR THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS. [J].
Merchant, Deepak K. ;
Nemhauser, George L. .
1600, (12)
[10]  
NIE Y, 2006, THESIS U CALIFORNIA