000			a
999			_c34910 _d34910
008			251013b xxu||||| |||| 00| 0 eng d
020			_a9783658449476
082			_a519 _bGRA
100			_aGraf, Lukas
245			_aDynamic Network Flows with Adaptive Route Choice based on Current Information
260			_bSpringer, _c2024 _aCham :
300			_axiv, 280 p. ; _bill., _c21 cm.
365			_b69.99 _c€ _d104.36
490			_aMathematische Optimierung und Wirtschaftsmathematik / Mathematical Optimization and Economathematics.
504			_aIncludes bibliographic reference.
520			_aIn this book Lukas Graf studies dynamic network flows which are a model for individual car traffic in road networks. It is assumed that drivers choose their routes based on information about the current state of the network in such a way as to selfishly minimize their own arrival time at their destination. Whilst on their journey the drivers adapt their current route choices based on the changing state of the network. A dynamic flow wherein every (infinitesimally small) flow particle behaves in this way is then called an instantaneous dynamic equilibrium. After giving a mathematically precise definition of this equilibrium concept the author shows existence of those equilibrium flows, studies their computational complexity and derives bounds on their quality. About the author After receiving his PhD from the University of Augsburg, Lukas Graf now works as a research assistant at the chair for mathematical optimization at the University of Passau.
650			_aApplications of Mathematics
650			_a Mathematical optimization
650			_a Mathematics
650			_aGraph Theory and Optimization
942			_2ddc _cBK