Details
Dynamic Network Flows with Adaptive Route Choice based on Current Information
Mathematische Optimierung und Wirtschaftsmathematik | Mathematical Optimization and Economathematics
CHF 83.00 |
|
Verlag: | Spektrum Akademischer Verlag bei Elsevier |
Format: | |
Veröffentl.: | 05.08.2024 |
ISBN/EAN: | 9783658449483 |
Sprache: | englisch |
Anzahl Seiten: | 189 |
Dieses eBook enthält ein Wasserzeichen.
Beschreibungen
<p>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.</p>
<p>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.</p>
<p>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.</p>
<p><strong>About the author</strong></p>
<p>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.</p>
<p><strong>About the author</strong></p>
<p>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.</p>
Diese Produkte könnten Sie auch interessieren:
Linear and Integer Programming vs Linear Integration and Counting
von: Jean-Bernard Lasserre
CHF 118.00
Reactive Search and Intelligent Optimization
von: Roberto Battiti, Mauro Brunato, Franco Mascia
CHF 118.00