Short-Term traffic condition prediction of urban road network based on improved SVM

Author(s):  
He Yan ◽  
Dong-Jun Yu
Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1412
Author(s):  
Ei Ei Mon ◽  
Hideya Ochiai ◽  
Chaiyachet Saivichit ◽  
Chaodit Aswakul

The traffic bottlenecks in urban road networks are more challenging to investigate and discover than in freeways or simple arterial networks. A bottleneck indicates the congestion evolution and queue formation, which consequently disturb travel delay and degrade the urban traffic environment and safety. For urban road networks, sensors are needed to cover a wide range of areas, especially for bottleneck and gridlock analysis, requiring high installation and maintenance costs. The emerging widespread availability of GPS vehicles significantly helps to overcome the geographic coverage and spacing limitations of traditional fixed-location detector data. Therefore, this study investigated GPS vehicles that have passed through the links in the simulated gridlock-looped intersection area. The sample size estimation is fundamental to any traffic engineering analysis. Therefore, this study tried a different number of sample sizes to analyze the severe congestion state of gridlock. Traffic condition prediction is one of the primary components of intelligent transportation systems. In this study, the Long Short-Term Memory (LSTM) neural network was applied to predict gridlock based on bottleneck states of intersections in the simulated urban road network. This study chose to work on the Chula-Sathorn SUMO Simulator (Chula-SSS) dataset. It was calibrated with the past actual traffic data collection by using the Simulation of Urban MObility (SUMO) software. The experiments show that LSTM provides satisfactory results for gridlock prediction with temporal dependencies. The reported prediction error is based on long-range time dependencies on the respective sample sizes using the calibrated Chula-SSS dataset. On the other hand, the low sampling rate of GPS trajectories gives high RMSE and MAE error, but with reduced computation time. Analyzing the percentage of simulated GPS data with different random seed numbers suggests the possibility of gridlock identification and reports satisfying prediction errors.


2021 ◽  
Author(s):  
Jiawei Zhang ◽  
Maosi Geng ◽  
Jiangsa Gu ◽  
Xiqun (Michael) Chen

Author(s):  
Jingyi Wang ◽  
Guohua Song ◽  
Lei Yu ◽  
Hongyu Lu ◽  
Jianping Sun ◽  
...  

The waste of fuel causing by traffic congestion is a challenge faced by urban traffic management authorities and travelers. At the same time, massive traffic data allows high-resolution understanding of on-road operating conditions. The development of an algorithm to estimate total fuel consumption from primary traffic condition indices, for example, network average speed, will simplify the evaluation of fuel consumption from the management perspective and guide strategy at the local area level. The objective of this study is to develop a macroscopic relationship between total fuel consumption and the network average speed for an urban road network. Floating car data (FCD) covering 13 weekdays was collected in the field in Beijing, China. FCD from 10 ordinary weekdays are used to develop a quantitative model to define the macroscopic relationship between total fuel consumption and network average speed. The model is then validated by the FCD of the other three weekdays when the traffic demand is low. The average of the resultant absolute relative errors from the validation is found to be 4.65%, which indicates a reasonably high reliability of the developed model under various traffic conditions. The facility- and speed-specific distributions of vehicle kilometers traveled (VKT) are analyzed to explain the macroscopic relationship. The result indicates that the link VKT distribution at different speeds varies greatly when the traffic became congested on expressways. The link VKT distributions are similar for different traffic conditions on arterials and collectors.


2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Tianyi Lan ◽  
Fei Yan ◽  
Hui Lin

In order to improve the traffic condition, a novel iterative learning control (ILC) algorithm with forgetting factor for urban road network is proposed by using the repeat characteristics of traffic flow in this paper. Rigorous analysis shows that the proposed ILC algorithm can guarantee the asymptotic convergence. Through iterative learning control of the traffic signals, the number of vehicles on each road in the network can gradually approach the desired level, thereby preventing oversaturation and traffic congestion. The introduced forgetting factor can effectively adjust the control input according to the states of the system and filter along the direction of the iteration. The results show that the forgetting factor has an important effect on the robustness of the system. The theoretical analysis and experimental simulations are given to verify the validity of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document