A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium

被引:96
作者
Smith, MJ [1 ]
Wisten, MB [1 ]
机构
[1] YORK UNIV,DEPT MATH,YORK YO1 5DD,N YORKSHIRE,ENGLAND
关键词
dynamical traffic assignment; user-equilibrium; dynamical system; Lyapunov function;
D O I
10.1007/BF02031940
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Suppose that a road network model is given, together with some given demand for travel by (say) car and that the demand for travel varies with time of day but not from day to day. Suppose that this demand is given in the form of specified total outflow rates from each origin headed towards each destination, for each origin-destination pair and for each time of day, and that some initial time-dependent route-inflow rates, meeting the given demand, are given. Finally, suppose that within-day time is represented by a continuous variable. This paper specifies a natural smooth day-to-day route-swapping procedure wherein drivers swap toward less expensive routes as day succeeds day, and shows that under reasonable conditions there is an equilibrium state of this dynamical system. If such a collection of route-inflows has arisen today, say, then there is no incentive for any route-inflow to change tomorrow, in the sense that at each moment of today each of today's route-inflows is already on a route which today yielded the smallest travel cost. Such a set of ''no-incentive-to-change'' route-inflows is called a dynamic equilibrium, or a dynamic user-equilibrium, and may be regarded as a solution of the dynamic equilibrium traffic assignment problem. Thus, the paper introduces a smooth day-to-day dynamic assignment model and, using this model, shows that there is a dynamic user-equilibrium in a continuous time setting. The paper briefly considers the day-to-day stability of the route-swapping process, also in a continuous setting. Finally, the paper gives a simple dynamical example illustrating the stability of the route-swapping process in a simple two-route network when there is deterministic queueing at bottlenecks.
引用
收藏
页码:59 / 79
页数:21
相关论文
共 22 条
[1]  
ADDISON JD, 1993, 12TH PINT S TRANS TR, P171
[2]  
BERNSTEIN D, 1993, 12TH PINT S TRANS TR, P107
[4]  
Cascetta E, 1987, FLOW CONTROL CONGEST
[5]   LARGE POPULATION APPROXIMATIONS OF A GENERAL STOCHASTIC TRAFFIC ASSIGNMENT MODEL [J].
DAVIS, GA ;
NIHAN, NL .
OPERATIONS RESEARCH, 1993, 41 (01) :169-178
[6]  
DAVIS GA, 1992, 33RD ORSA TIMS JOINT
[7]   STOCHASTIC EQUILIBRIUM-MODEL OF PEAK PERIOD TRAFFIC CONGESTION [J].
DEPALMA, A ;
BENAKIVA, M ;
LEFEVRE, C ;
LITINAS, N .
TRANSPORTATION SCIENCE, 1983, 17 (04) :430-453
[8]  
DIGANGI M, 1992, JOINT ITALY US SEMIN
[9]  
DRISSIKAITOUNI O, 1992, 1ST P M EURO WORK GR
[10]   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