Traffic has become a major problem in metropolitan areas across the world. It is critical to understand the complex interplay of a road network and its traffic states so that researchers and planners can improve the city planning and traffic logistics. The authors propose a novel framework to estimate urban traffic states using GPS traces. Their approach begins with an initial estimation of network travel times by solving a convex optimisation programme based on Wardrop equilibria. Then, they iteratively refine the estimated network travel times and vehicle traversed paths. Lastly, using the refined results as input, they perform a nested optimisation process to derive traffic states in areas without data coverage to obtain full traffic estimations. The evaluation and comparison of their approach over two state‐of‐the‐art methods show up to 96% relative improvements. In order to study urban traffic, the authors have further conducted field tests in Beijing and San Francisco using real‐world GIS data, which involve 128,701 nodes, 148,899 road segments, and over 26 million GPS traces.
Estimating urban traffic states using iterative refinement and Wardrop equilibria
IET Intelligent Transport Systems ; 12 , 8 ; 875-883
2018-10-01
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
traffic logistics , real‐world GIS data , urban traffic state estimation , metropolitan areas , urban traffic , road traffic , convex programming , network travel time estimation , nested optimisation process , vehicle traversed paths , Wardrop equilibria , GPS traces , convex optimisation programme , iterative refinement , city planning , iterative methods
Estimating urban traffic states using iterative refinement and Wardrop equilibria
IET | 2018
|Wardrop Equilibria with Risk-Averse Users
Online Contents | 2010
|Wardrop Equilibria with Risk-Averse Users
British Library Online Contents | 2010
|