An improved distance metric for the interpolation of link-based traffic data using kriging: a case study of a large-scale urban road network

Abstract

The interpolation of link-based traffic data is an important topic for transportation researchers and engineers. In recent years the kriging method has been used in traffic data interpolation from the viewpoint of spatial analysis. This method has shown promising results, especially for a large-scale road network. However, existing studies using the Euclidean distance metric, which is widely used in traditional kriging, fail to accurately describe the spatial distance in a road network. In this article we introduce road network distance to describe spatial distance between road links, and we propose an improved distance metric called approximate road network distance (ARND), based on the isometric embedding theory, for solving the problem of the invalid spatial covariance function in kriging caused by the non-Euclidean distance metric. An improved Isomap algorithm is also proposed for obtaining the ARND metric. This study is tested on a large-scale urban road network with sparse road-link travel speeds derived from approximately 1200 ‘floating cars’ (GPS-enabled taxis). Comparison was conducted on both the Euclidean distance metric and the ARND metric. The validation results show that the use of the ARND metric can obtain better interpolation accuracy in different time periods and urban regions with different road network structures. Therefore, we conclude that the improved distance metric has the ability for improving kriging interpolation accuracy for link-based traffic data within real situations, providing more reliable basic traffic data for various traffic applications.