Normal view MARC view ISBD view

Dynamic Network Flows with Adaptive Route Choice based on Current Information

By: Graf, Lukas.
Series: Mathematische Optimierung und Wirtschaftsmathematik / Mathematical Optimization and Economathematics.Publisher: Cham : Springer, 2024Description: xiv, 280 p. ; ill., 21 cm.ISBN: 9783658449476.Subject(s): Applications of Mathematics | Mathematical optimization | Mathematics | Graph Theory and OptimizationDDC classification: 519 Summary: In 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books DAU
519 GRA (Browse shelf) Available 036215

Includes bibliographic reference.

In 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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha