A game theory based traffic assignment using queueing networks

Author

Caixia Li ; Anavatti, Sreenatha G. ; Ray, Tapabrata

Author_Institution

Sch. of Eng. & Inf. Technol., Univ. of New South Wales at ADFA, Canberra, ACT, Australia

fYear

2013

fDate

5-7 Nov. 2013

Firstpage

210

Lastpage

215

Abstract

Traffic assignment models can be classified according to the behavioral assumption governing route choice: the User Equilibrium (UE) and System Optimum (SO) traffic assignment. The first model refers to the “user-optimal” model, that is the users´ least cost model, while the latter is based on overall cost minimization. The paradox of benefit between UE and SO makes it impractical. In addition, the dynamic and stochastic characteristic of traffic flow in the congested traffic network makes it difficult to be modeled by the deterministic method. It is necessary to make queueing analysis in the congested network. This paper presents a game theory based traffic assignment using queueing networks, which can balance between UE and SO and give more feasible traffic assignment. A comparative experiment is conducted among SO, UE and noncooperative models to validate the model.

Keywords

cost reduction; game theory; minimisation; queueing theory; stochastic processes; telecommunication network routing; telecommunication traffic; SO; UE; congested traffic flow network; cost minimization; deterministic method; game theory based traffic assignment model; noncooperative model; queueing network; stochastic characteristic; system optimum traffic assignment; user equilibrium; user least cost model; user-optimal model; Analytical models; Game theory; Games; Queueing analysis; Roads; Routing; Stochastic processes; System Optimum; User Equilibrium; game theory;

fLanguage

English

Publisher

ieee

Conference_Titel

ITS Telecommunications (ITST), 2013 13th International Conference on

Conference_Location

Tampere

Type

conf

DOI

10.1109/ITST.2013.6685547

Filename

6685547