scholarly journals Widespread Traffic Congestion Prediction for Urban Road Network Based on Synergetic Theory

2014 ◽  
Vol 2 (4) ◽  
pp. 366-371 ◽  
Author(s):  
Liangliang Zhang ◽  
Yuanhua Jia ◽  
Zhonghai Niu ◽  
Cheng Liao

AbstractThe traffic congestion often occurs in urban road network. When one of the sections becomes congested, it will lead to a series of congestions in other sections. The traffic congestion spreads rapidly until part of road network becomes congestion ultimately. In this case, the paper investigates the mechanism of the traffic congestion in urban road network and points out that subsystems of the traffic congestion always perform completive and cooperative functions in the process of traffic congestion. The process behaves in a manner of self-organized criticality, which can be forecasted. The paper also establishes synergetic predictive models based on self-organized criticality of the synergetic theory. Finally, the paper takes Beijing road network as an example to forecast the widespread traffic congestion. The result shows that the established models are accuracy, and the traffic congestion is featured of self-organized criticality.

2014 ◽  
Vol 641-642 ◽  
pp. 916-922 ◽  
Author(s):  
Chen Yao ◽  
Jiu Chun Gu ◽  
Qi Yang

This paper proposes a generalized model based on the granular computing to recognize and analyze the traffic congestion of urban road network. Using the method of quotient space to reduce the attributes associating with traffic congestion, the identification of traffic congestion evaluation system is established including 3 first class indexes and second class indexes of 11. The weight of evaluation indexes are sorted by value in descending order, which are calculated based on rough set theory. In order to improve the efficiency of traffic congestion identification, the appropriate granular is determined by the model parameter μ. When μ is larger, the identification is more effective and the run time of model is longer conversely. Experiments show when the value of μ is between 0.8 and 0.98, the effect of traffic congestion identification is comprehensive optimal.


10.29007/cxkb ◽  
2019 ◽  
Author(s):  
Ei Ei Mon ◽  
Hideya Ochiai ◽  
Chaiyachet Saivichit ◽  
Chaodit Aswakul

Traffic congestion on not only highways but also complex urban road networks has attracted the attention of many researchers. Traffic congestion growing in urban road net- works is an inevitably important problem especially for populated cities during rush hours. A traffic blockage can be realized as the source of traffic congestion, which can propagate to form queues and sometimes a gridlock. Traffic blockages are triggered by complicated factors ranging from temporal and spatial situations. Recurrent congestion is a traffic congestion that occurs during morning and evening rush hours e.g. from school buses and parent vehicles to drive their children to-and-from schools. In addition, unforeseen, unexpected events that can cause as non-recurrent traffic congestion e.g. car breakdowns, accidents, road maintenance, and severe weather conditions, which can disorder normal traffic flows and reduce road capacity. Traffic blockage may spread its negative impacts to neighbouring upstream and downstream links. And that can lead to the formation of congestion gridlock, which further reduce traffic flow efficiency in a complex urban road network. These problems are vital but often tough to resolve in urban road networks. In this paper, the Chula-Sathorn SUMO Simulator (Chula-SSS) dataset has been used with Simulation of Urban Mobility (SUMO) to simulate recurrent and non-recurrent congestion cases. The detection is based on the information from simulated lane area detectors. For non-recurrent case, lanes are closed to simulate the gridlock occurrences. With the morning case of calibrated Chula-SSS dataset, both recurrent and nonrecurrent congestion based gridlock have been studied with upstream and downstream nearby detectors and preliminary results are herein reported upon the gridlock status as detected by using different combinations of traffic jam length and mean speed conditions at both the upstream and downstream detectors of every intersection within the critical looped road segments.


Author(s):  
S R Samal ◽  
P Gireesh Kumar ◽  
J Cyril Santhosh ◽  
M Santhakumar

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