Toward System-Optimal Routing in Traffic Networks: A Reverse Stackelberg Game Approach

被引:43
作者
Groot, Noortje [1 ]
De Schutter, Bart [1 ]
Hellendoorn, Hans [1 ]
机构
[1] Delft Univ Technol, Delft Ctr Syst & Control, NL-2628 Delft, Netherlands
基金
欧盟第七框架计划;
关键词
Dynamic traffic assignment; incentives; route guidance; Stackelberg games; urban and freeway traffic control; FUEL CONSUMPTION; DEPARTURE TIME; BILEVEL; CHOICE; MODEL; ASSIGNMENT; FLOW;
D O I
10.1109/TITS.2014.2322312
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
In the literature, several road pricing methods based on hierarchical Stackelberg games have been proposed to reduce congestion in traffic networks. We propose three novel schemes to apply the extended reverse Stackelberg game, through which traffic authorities can induce drivers to follow routes that are computed to reach a system-optimal distribution of traffic on the available routes of a freeway, e.g., to minimize the total time spent of traffic in the network and to reduce traffic emissions in urban traffic networks. In this game-theoretical approach, the leader player representing the traffic authority communicates with the followers (drivers) via an onboard computer, in which the main instrument of the leader is the so-called leader function. This function maps the follower's decision space into the leader's decision space, resulting in a leader decision that is directly dependent on the follower's decision variables. Compared with the original game, we can rely on solution methods developed for the general reverse Stackelberg game and show that a system-optimal behavior can be reached, while taking heterogeneous driver classes into account.
引用
收藏
页码:29 / 40
页数:12
相关论文
共 42 条
[1]  
Ahuja RA., 1993, NETWORK FLOWS THEORY
[2]  
[Anonymous], 2000, 49 EUR ENV AG
[3]   DEPARTURE TIME AND ROUTE CHOICE FOR THE MORNING COMMUTE [J].
ARNOTT, R ;
DEPALMA, A ;
LINDSEY, R .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1990, 24 (03) :209-228
[4]  
Basar T., 1999, SOC IND APPL MATH, V2nd
[5]   Value of travel time: a theoretical legitimization of some nonlinear representative utility in discrete choice models [J].
Blayac, T ;
Causse, A .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :391-400
[6]   Properties of system optimal traffic assignment with departure time choice and its solution method [J].
Chow, Andy H. F. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2009, 43 (03) :325-344
[7]   An overview of bilevel optimization [J].
Colson, Benoit ;
Marcotte, Patrice ;
Savard, Gilles .
ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) :235-256
[8]   Ant Colony Routing algorithm for freeway networks [J].
Cong, Zhe ;
De Schutter, Bart ;
Babuska, Robert .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 37 :1-19
[9]  
Cramer J.S., 1991, The Logit model : an introduction for economists
[10]  
DeSerpa A.C., 1973, Regional and Urban Economics, V3, P401, DOI DOI 10.1016/0034-3331(73)90005-5