Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Abstract Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.

[1]  Haris N. Koutsopoulos,et al.  Path inference from sparse floating car data for urban networks , 2013 .

[2]  Erik Jenelius,et al.  Non-parametric estimation of route travel time distributions from low-frequency floating car data , 2015 .

[3]  Feng Lu,et al.  A ST-CRF Map-Matching Method for Low-Frequency Floating Car Data , 2017, IEEE Transactions on Intelligent Transportation Systems.

[4]  S. Banach.  Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .

[5]  Toshiyuki Yamamoto,et al.  Development of map matching algorithm for low frequency probe data , 2012 .

[6]  Nikolas Geroliminis,et al.  Estimation of Arterial Route Travel Time Distribution with Markov Chains , 2012 .

[7]  Michel Bierlaire,et al.  Solving Noisy, Large-Scale Fixed-Point Problems and Systems of Nonlinear Equations , 2006, Transp. Sci..

[8]  Alexandre M. Bayen,et al.  The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data , 2011, IEEE Transactions on Intelligent Transportation Systems.

[9]  Satish V. Ukkusuri,et al.  Urban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information , 2013 .

[10]  Alexandre M. Bayen,et al.  The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data , 2011, IEEE transactions on intelligent transportation systems (Print).

[11]  P. Jean-Jacques Herings,et al.  A Fixed Point Theorem for Discontinuous Functions , 2004, Oper. Res. Lett..

[12]  L. Brouwer.  Über Abbildung von Mannigfaltigkeiten , 1921 .

[13]  Jon Alan Bottom,et al.  Consistent anticipatory route guidance , 2000 .

[14]  Marcus P. Enoch,et al.  Estimating Link Travel Time from Low-Frequency GPS Data , 2013 .

[15]  Liping Fu,et al.  Decomposing Travel Times Measured by Probe-based Traffic Monitoring Systems to Individual Road Segments , 2008 .

[16]  Chengyang Zhang,et al.  Map-matching for low-sampling-rate GPS trajectories , 2009, GIS.

[17]  Fangfang Zheng,et al.  Urban link travel time estimation based on sparse probe vehicle data , 2013 .

[18]  M. Ben-Akiva,et al.  MODELLING INTER URBAN ROUTE CHOICE BEHAVIOUR , 1984 .

[19]  V. Berinde.  Iterative Approximation of Fixed Points , 2007 .

[20]  Maria Nadia Postorino,et al.  Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested Networks , 2001, Transp. Sci..

[21]  Shane G. Henderson,et al.  Travel time estimation for ambulances using Bayesian data augmentation , 2013, 1312.1873.

[22]  She Xi-wei,et al.  On-line map-matching framework for floating car data with low sampling rate in urban road networks , 2013 .

[23]  Carlos F. Daganzo,et al.  Stochastic network equilibrium with multiple vehicle types and asymmetric , 1983 .

[24]  Alexandre M. Bayen,et al.  This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 1 Learning the Dynamics of Arterial Traffic From Probe , 2022 .

[25]  John Krumm,et al.  Hidden Markov map matching through noise and sparseness , 2009, GIS.

[26]  Simon Washington,et al.  Shortest path and vehicle trajectory aided map-matching for low frequency GPS data , 2015 .

[27]  Mohammed A. Quddus,et al.  Weight-Based Shortest-Path Aided Map-Matching Algorithm for Low-Frequency Positioning Data , 2011 .

[28]  Haris N. Koutsopoulos,et al.  Investigation of Route Guidance Generation Issues by Simulation with DynaMIT , 1999 .

[29]  Haris N. Koutsopoulos,et al.  Travel time estimation for urban road networks using low frequency probe vehicle data , 2013, Transportation Research Part B: Methodological.

[30]  Marcus P. Enoch,et al.  Developing travel time estimation methods using sparse GPS data , 2016, J. Intell. Transp. Syst..

[31]  H. Robbins.  A Stochastic Approximation Method , 1951 .

[32]  D.E. Kaufman,et al.  An iterative routing/assignment method for anticipatory real-time route guidance , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[33]  Yang Wen,et al.  A dynamic traffic assignment model for highly congested urban networks , 2012 .