A NEW DYNAMIC TRAFFIC MODEL AND THE EXISTENCE AND CALCULATION OF DYNAMIC USER EQUILIBRIA ON CONGESTED CAPACITY-CONSTRAINED ROAD NETWORKS

被引:115
作者
SMITH, MJ
机构
[1] Department of Mathematics, University of York, Heslington, York
关键词
D O I
10.1016/0191-2615(93)90011-X
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper presents a new dynamic model of peak period traffic flows on congested capacity-constrained urban road networks. While respecting the first in, first out (FIFO) discipline of road traffic queues and the exit capacities of road links, the model determines the (time-varying) costs incurred in traversing the various routes when (time-varying) route inflows are specified. It is proved that if this model is used to find route costs then a dynamic user equilibrium exists. The paper also gives four optimisation formulations of the dynamic user equilibrium problem. A descent algorithm is suggested; there is, as yet, no proof that the algorithm converges to an equilibrium. Finally, the paper introduces a family of alternative methods of determining dynamic flows which (almost) satisfy FIFO, and specifies one member of this family in some detail. These alternative methods arise as a consequence of using different ways of specifying the priority of a vehicle or a group of vehicles.
引用
收藏
页码:49 / 63
页数:15
相关论文
共 23 条
[1]   DEPARTURE RATE AND ROUTE ASSIGNMENT OF COMMUTER TRAFFIC DURING PEAK PERIOD [J].
ALFA, AS .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (05) :337-344
[2]   A REVIEW OF MODELS FOR THE TEMPORAL DISTRIBUTION OF PEAK TRAFFIC DEMAND [J].
ALFA, AS .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (06) :491-499
[3]   DYNAMIC NETWORK EQUILIBRIUM RESEARCH [J].
BENAKIVA, M .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1985, 19 (5-6) :429-431
[4]   NONCONVEXITY OF THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEM [J].
CAREY, M .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1992, 26 (02) :127-133
[5]   A CONSTRAINT QUALIFICATION FOR A DYNAMIC TRAFFIC ASSIGNMENT MODEL [J].
CAREY, M .
TRANSPORTATION SCIENCE, 1986, 20 (01) :55-58
[6]   OPTIMAL TIME-VARYING FLOWS ON CONGESTED NETWORKS [J].
CAREY, M .
OPERATIONS RESEARCH, 1987, 35 (01) :58-69
[7]  
*FED HIGHW ADM, 1980, TRAFF NETW AN NETSIM
[8]  
Hearn D. W., 1982, Operations Research Letters, V1, P67, DOI 10.1016/0167-6377(82)90049-9
[9]  
HURDLE VF, 1974, 6TH P INT S TRANSP T, P519
[10]  
KUWAHARA M, 1987, 10 INT S TRANSP TRAF, P21