Cantitate/Preț
Produs

Dynamic Network Flows with Adaptive Route Choice based on Current Information

Autor Lukas Graf
en Limba Engleză Paperback – 6 aug 2024
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.
Citește tot Restrânge

Preț: 45190 lei

Preț vechi: 53165 lei
-15% Nou

Puncte Express: 678

Preț estimativ în valută:
7995 9315$ 6982£

Carte tipărită la comandă

Livrare economică 19 ianuarie-02 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783658449476
ISBN-10: 3658449470
Pagini: 296
Ilustrații: Approx. 190 p. Textbook for German language market.
Dimensiuni: 148 x 210 x 17 mm
Greutate: 0.39 kg
Ediția:2024
Editura: Springer Fachmedien Wiesbaden
Locul publicării:Wiesbaden, Germany

Notă biografică

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.

Textul de pe ultima copertă

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.