Abstract
In a parallel network, the Wardrop equilibrium is the optimal distribution of the given total one unit flow across alternative parallel links that minimizes the effective costs of the links which are defined as the sum of the latency at the given flow and the price of the link. Meanwhile, the system optimum is the optimal distribution of the given total one unit flow for which the average effective cost is minimal. In this paper, we study the so-called Wardrop optimal flow that is the Wardrop equilibrium as well as the system optimum of the network. We propose a replicator equation on a Wardrop optimal network for which the Nash equilibrium, the Wardrop equilibrium and the system optimum are the same flow distribution of the network. We present a new algorithm for simulation of dynamic flow distribution in networks, and describe the conceptual and functional structure of intelligent information system for dynamic traffic flow assignment in transportation networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Acemoglu, D., Ozdaglar, A.: Competition and efficiency in congested markets. Math. Oper. Res. 32(1), 1–31 (2007)
Nash, J.F.: Equilibrium points in \(n\)-person games. Proc. Nat. Acad. Sci. USA 36(1), 48–49 (1950)
Nash, J.F.: Non-cooperative games. Ann. Math. 54, 287–295 (1951)
Hofbauer, J., Sigmund, K.: Evolutionary game dynamics. Bull. Amer. Math. Soc. 40, 479–519 (2003)
Sigmund, K.: Evolutionary Game Dynamics. AMS, Providence (2010)
Hofbauer, J., Sigmund, K.: Evolutionary Games and Replicator Dynamics. Cambridge University Press, Cambridge (1998)
Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, The Netherlands (1994)
Acemoglu, D., Srikant, R.: Incentives and prices in communication networks. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 107–132, Cambridge University Press (2007)
Carlier, G., Jimenez, C., Santambrogio, F.: Optimal transportation with traffic congestion and Wardrop equilibria. SIAM J. Control. Optim. 47, 1330–1350 (2008)
Beckmann, M., McGuir, C., Winsten, C.: Studies in Economics of Transportation. Yale University Press, New Haven (1956)
Larsson, T., Patriksson, M.: Equilibrium characterizations of solutions to side constrained traffic equilibrium models. Matematiche (Catania) 49, 249–280 (1994)
Larsson, T., Patriksson, M.: Side constrained traffic equilibrium models: analysis, computation and applications. Transportation Res. 33, 233–264 (1999)
Cressman, R.: Evolutionary Dynamics and Extensive Form Games. MIT (2003)
Saburov, M.: On replicator equations with nonlinear payoff functions defined by the Ricker models. Adv. Pure Appl. Math. 12, 139–156 (2021)
Saburov, M.: On discrete-time replicator equations with nonlinear payoff functions. Dyn. Games Appl. 12, 643–661 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bagdasaryan, A., Kalampakas, A., Saburov, M. (2023). Dynamic Traffic Flow Assignment on Parallel Networks. In: Karabegovic, I., Kovačević, A., Mandzuka, S. (eds) New Technologies, Development and Application VI. NT 2023. Lecture Notes in Networks and Systems, vol 687. Springer, Cham. https://doi.org/10.1007/978-3-031-31066-9_82
Download citation
DOI: https://doi.org/10.1007/978-3-031-31066-9_82
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-31065-2
Online ISBN: 978-3-031-31066-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)