DocumentCode :
3191754
Title :
Combined Traffic Assignment Model with Game Theory
Author :
Huapu, Lu ; Xinxin, Yu ; Yue, Li ; Jianan, Zhu ; Nan, Cheng
Author_Institution :
Inst. of Transp. Eng., Tsinghua Univ., Beijing, China
Volume :
1
fYear :
2010
fDate :
11-12 May 2010
Firstpage :
978
Lastpage :
981
Abstract :
The classical Wardrop principle assumes that users minimize either individual travel cost or overall system cost. Unlike the pure Wardrop equilibrium, this study deals with the problem of user equilibrium traffic assignment with game theory. We present a Stackelberg game on the network in which the SO player is the leader and the Cournot-Nash and user equilibrium players are the followers. The Cournot-Nash and user equilibrium players select the route, which is given the SO player´s routing. In contrast, the SO player select the routes to minimize total system travel cost. Based on combined model, the traffic assignment method was discussed, and the VI and generalized Lagrange multiplier method was used to get the solution. A simple example is presented. The example result shows that the efficient of Stackelberg model is higher than that of the UE system or SO system.
Keywords :
cost reduction; game theory; road traffic; Cournot-Nash player; Stackelberg game; Wardrop equilibrium; game theory; generalized Lagrange multiplier method; system travel cost minimization; traffic assignment; user equilibrium; Automation; Contracts; Cost function; Game theory; Intelligent transportation systems; Lagrangian functions; Nash equilibrium; Routing; Telecommunication traffic; Traffic control; Nash equilibrium; game theory; traffic assignment; user equilibrium;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on
Conference_Location :
Changsha
Print_ISBN :
978-1-4244-7279-6
Electronic_ISBN :
978-1-4244-7280-2
Type :
conf
DOI :
10.1109/ICICTA.2010.600
Filename :
5522694
Link To Document :
بازگشت