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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wardrop, J. G.: Some theoretical aspects of road traffic research. In ICE Proceedings: Engineering Divisions, volume 1, pages 325–362. Thomas Telford. Road paper (1952).
Haurie, A., and Marcotte, P.: On the relationship between nashcournot and wardrop equilibria. Networks, vol. 15 (3), pp. 295–308 (1985).
Harker, T.P.,: Multiple equilibrium behaviours on networks, Transportation Science, 22(1), pp. 39–46, 1988.
Vuren, T. V., Vliet, D. V. and Smith, M. J.: Combined equilibrium in a network with partial route guidance. In Traffic control methods. Proceedings of the fifth NG foundation conference, California. (1990).
Wie, B.-W.: A differential game model of nash equilibrium on a congested traffic network. Networks, vol. 23(6), pp. 557–565 (1993).
Wie, B.-W.: A differential game approach to the dynamic mixed behavior traffic network equilibrium problem. European Journal of Operational Research, 83(1), pp. 117–136 (1995).
Friez, T.L., Mookherjee, R., and Yao, T.,: Securitizing congestion: the congestion call option, Transportation Research, Part B: Methodological, 42(5), pp. 407–437, 2008.
Kumar, A. and Peeta, S.: Strategies to Enhance the Performance of Path-Based Static Traffic Assignment Algorithms, Computer-Aided Civil and Infrastructure Engineering, 29:5, pp. 330–341 (2014).
Korilis, A.Y., Lazar, A.A., and Orda, A.: Achieving network optima using Stackelberg routing strategies, IEEE/ACM Transactions on Networking, 5(1), pp. 161–173, 1997.
Altman, E., Basar, T and Srikant, R.: Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users. Automatic Control, IEEE Transactions on, 47(6), pp. 917–930 (2002).
La, R. J. and Anantharam, V.: Optimal routing control: Repeated game approach. Automatic Control, IEEE Transactions on, 47(3), pp. 437–450 (2002).
Sislak, D., Volf, P. and Pechoucek, M.: Agent-based cooperative decentralized airplane-collision avoidance. Intelligent Transportation Systems, IEEE, 12(1), pp. 36–46 (2011).
Tong, C. O. and Wong, S. C.: A predictive dynamic traffic assignment model in congested capacity-constrained road networks. Transportation Research Part B: Methodological, 34(8), pp. 625–644 (2000).
Altman, E., Basar, T, Jimenez, T and Shimkin, N.: Competitive routing in networks with polynomial costs. Automatic Control, IEEE Transactions on, 47(1), pp. 92–96 (2002).
Huang, H. J. and Lam, W. H.: Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transportation Research Part B: Methodological, 36(3), pp. 253–273 (2002).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Li, C., Anavatti, S.G., Ray, T., Shim, H. (2017). A Game-Theoretic Approach to the Analysis of Traffic Assignment. In: Leu, G., Singh, H., Elsayed, S. (eds) Intelligent and Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-49049-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-49049-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49048-9
Online ISBN: 978-3-319-49049-6
eBook Packages: EngineeringEngineering (R0)