Travel Time Prediction Using k Nearest Neighbor Method with Combined Data from Vehicle Detector System and Automatic Toll Collection System

2011 ◽  
Vol 2256 (1) ◽  
pp. 51-59 ◽  
Author(s):  
Jiwon Myung ◽  
Dong-Kyu Kim ◽  
Seung-Young Kho ◽  
Chang-Ho Park
Keyword(s):  
Travel Time ◽  
Nearest Neighbor ◽  
Detector System ◽  
K Nearest Neighbor ◽  
Collection System ◽  
Travel Time Prediction ◽  
Time Prediction ◽  
Toll Collection ◽  
Vehicle Detector System ◽  
Combined Data

scholarly journals Highway Travel Time Prediction Using Sparse Tensor Completion Tactics and K-Nearest Neighbor Pattern Matching Method

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jiandong Zhao ◽  
Yuan Gao ◽  
Jinjin Tang ◽  
Lingxi Zhu ◽  
Jiaqi Ma
Keyword(s):  
Travel Time ◽  
Traffic Congestion ◽  
Nearest Neighbor ◽  
Sensor Nodes ◽  
Tensor Completion ◽  
Volume Data ◽  
K Nearest Neighbor ◽  
Travel Time Prediction ◽  
Data Sparseness ◽  
Time Prediction

Remote transportation microwave sensor (RTMS) technology is being promoted for China’s highways. The distance is about 2 to 5 km between RTMSs, which leads to missing data and data sparseness problems. These two problems seriously restrict the accuracy of travel time prediction. Aiming at the data-missing problem, based on traffic multimode characteristics, a tensor completion method is proposed to recover the lost RTMS speed and volume data. Aiming at the data sparseness problem, virtual sensor nodes are set up between real RTMS nodes, and the two-dimensional linear interpolation and piecewise method are applied to estimate the average travel time between two nodes. Next, compared with the traditional K-nearest neighbor method, an optimal KNN method is proposed for travel time prediction. optimization is made in three aspects. Firstly, the three original state vectors, that is, speed, volume, and time of the day, are subdivided into seven periods. Secondly, the traffic congestion level is added as a new state vector. Thirdly, the cross-validation method is used to calibrate the K value to improve the adaptability of the KNN algorithm. Based on the data collected from Jinggangao highway, all the algorithms are validated. The results show that the proposed method can improve data quality and prediction precision of travel time.

scholarly journals Travel-time Prediction Using K-nearest Neighbor Method with Distance Metric of Correlation Coefficient

2019 ◽  
Vol 13 (1) ◽  
pp. 141-150
Author(s):  
Jinhwan Jang
Keyword(s):  
Travel Time ◽  
Real Time ◽  
Correlation Coefficient ◽  
Nearest Neighbor ◽  
Modern Society ◽  
K Nearest Neighbor ◽  
Travel Time Prediction ◽  
Significance Level ◽  
Dedicated Short Range Communications ◽  
Road Users

Background: Real-time Travel Time (TT) information has become an essential component of daily life in modern society. With reliable TT information, road users can increase their productivity by choosing less congested routes or adjusting their trip schedules. Drivers normally prefer departure time-based TT, but most agencies in Korea still provide arrival time-based TT with probe data from Dedicated Short-Range Communications (DSRC) scanners due to a lack of robust prediction techniques. Recently, interest has focused on the conventional k-nearest neighbor (k-NN) method that uses the Euclidean distance for real-time TT prediction. However, conventional k-NN still shows some deficiencies under certain conditions. Methods: This article identifies the cases where conventional k-NN has shortcomings and proposes an improved k-NN method that employs a correlation coefficient as a measure of distance and applies a regression equation to compensate for the difference between current and historical TT. Results: The superiority of the suggested method over conventional k-NN was verified using DSRC probe data gathered on a signalized suburban arterial in Korea, resulting in a decrease in TT prediction error of 3.7 percent points on average. Performance during transition periods where TTs are falling immediately after rising exhibited statistically significant differences by paired t-tests at a significance level of 0.05, yielding p-values of 0.03 and 0.003 for two-day data. Conclusion: The method presented in this study can enhance the accuracy of real-time TT information and consequently improve the productivity of road users.

scholarly journals Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Cong Bai ◽  
Zhong-Ren Peng ◽  
Qing-Chang Lu ◽  
Jian Sun
Keyword(s):  
Travel Time ◽  
Dynamic Model ◽  
Kalman Filtering ◽  
Prediction Models ◽  
Support Vector ◽  
Travel Times ◽  
Travel Time Prediction ◽  
Real World Data ◽  
Time Prediction ◽  
Bus Travel Time

Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes.

Sign in / Sign up

Export Citation Format

Share Document