相關主題
商品描述
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.
商品描述(中文翻譯)
在這本書中,Lukas Graf 研究了動態網路流,這是一種用於模擬道路網路中個別汽車交通的模型。假設駕駛者根據網路的當前狀態資訊選擇路徑,以自私的方式最小化他們到達目的地的時間。在旅途中,駕駛者根據網路狀態的變化調整他們的當前路徑選擇。每個(無窮小的)流動粒子以這種方式行為的動態流被稱為瞬時動態均衡。在給出這一均衡概念的數學精確定義後,作者展示了這些均衡流的存在性,研究了它們的計算複雜性,並推導出它們質量的界限。
作者簡介
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.
作者簡介(中文翻譯)
在奧格斯堡大學獲得博士學位後,盧卡斯·格拉夫目前在帕紹大學的數學優化研究所擔任研究助理。