Loading...
Please wait, while we are loading the content...
Similar Documents
A Game-Theoretic Approach to the Analysis of Traffic Assignment
| Content Provider | Semantic Scholar |
|---|---|
| Author | Li, Caixia Sreenatha G. Anavatti Ray, Tapabrata Shim, Hyungbo |
| Copyright Year | 2017 |
| Abstract | In order to improve the cooperation between traffic management and travellers, traffic assignment is the key component. In terms of the traffic assignment, it can be classified into two models based on the behavior assumption governing route choices: the User Equilibrium (UE) and System Optimum (SO) traffic assignment. By the definition of UE and SO traffic assignment, traffic users usually competitively choose the least cost routes to minimize their own travel cost, while system optimum traffic assignment requires traffic users work cooperatively to minimize overall cost in road network. Thus, the paradox of benefits between UE and SO makes both of them are not practical. Thus, a solution technique needs to be proposed to balance between UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment, which can achieve the trade-off process between traffic management and travellers. Since the traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve the efficiency of the traffic assignment. |
| Starting Page | 17 |
| Ending Page | 30 |
| Page Count | 14 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-3-319-49049-6_2 |
| Alternate Webpage(s) | https://www.springer.com/cda/content/document/cda_downloaddocument/9783319490489-c2.pdf?SGWID=0-0-45-1594415-p180398085 |
| Alternate Webpage(s) | https://doi.org/10.1007/978-3-319-49049-6_2 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
