Short-term traffic flow prediction with optimized Multi-kernel Support Vector Machine

Author(s):  
Xianyao Ling ◽  
Xinxin Feng ◽  
Zhonghui Chen ◽  
Yiwen Xu ◽  
Haifeng Zheng

Congestion is the primary issue related to traffic flow. Avoiding congestion after getting into is not possible. So the only way is to make the informed decision by knowing the traffic situation in advance. This can be achieved with the help of traffic flow prediction. In the proposed work, short term traffic flow prediction is performed using support vector machine in combination with rough set. Traffic data used for analysis is collected from three adjacent intersections of Nagpur city and traffic flow is predicted at downstream junction. The work has attempted to study the effect of aggregation intervals and past samples on the prediction performance using MSE threshold variation. Rough set is used as a post processor to validate the prediction result. Accurate and timely prediction can provide reliability for optimized traffic control and guidance.


Author(s):  
Trinh Dinh Toan ◽  
Viet-Hung Truong

Short-term prediction of traffic flow is essential for the deployment of intelligent transportation systems. In this paper we present an efficient method for short-term traffic flow prediction using a Support Vector Machine (SVM) in comparison with baseline methods, including the historical average, the Current Time Based, and the Double Exponential Smoothing predictors. To demonstrate the efficiency and accuracy of the SVM method, we used one-month time-series traffic flow data on a segment of the Pan Island Expressway in Singapore for training and testing the model. The results show that the SVM method significantly outperforms the baseline methods for most prediction intervals, and under various traffic conditions, for the rolling horizon of 30 min. In investigating the effect of the input-data dimension on prediction accuracy, we found that the rolling horizon has a clear effect on the SVM’s prediction accuracy: for the rolling horizon of 30–60 min, the longer the rolling horizon, the more accurate the SVM prediction is. To look for a solution for improvement of the SVM’s training performance, we investigate the application of k-Nearest Neighbor method for SVM training using both actual data and simulated incident data. The results show that the k- Nearest Neighbor method facilitates a substantial reduction of SVM training size to accelerate the training without compromising predictive performance.


2019 ◽  
Vol 534 ◽  
pp. 120642 ◽  
Author(s):  
Jinjun Tang ◽  
Xinqiang Chen ◽  
Zheng Hu ◽  
Fang Zong ◽  
Chunyang Han ◽  
...  

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Fengkai Liu ◽  
Xingmin Ma ◽  
Xingshuo An ◽  
Guangnan Liang

Urban traffic flow prediction has always been an important realm for smart city build-up. With the development of edge computing technology in recent years, the network edge nodes of smart cities are able to collect and process various types of urban traffic data in real time, which leads to the possibility of deploying intelligent traffic prediction technology with real-time analysis and timely feedback on the edge. In view of the strong nonlinear characteristics of urban traffic flow, multiple dynamic and static influencing factors involved, and increasing difficulty of short-term traffic flow prediction in a metropolitan area, this paper proposes an urban traffic flow prediction model based on chaotic particle swarm optimization algorithm-smooth support vector machine (CPSO/SSVM). The prediction model has built a new second-order smooth function to achieve better approximation and regression effects and has further improved the computational efficiency of the smooth support vector machine algorithm through chaotic particle swarm optimization. Simulation experiment results show that this model can accurately predict urban traffic flow.


Sign in / Sign up

Export Citation Format

Share Document