Traffic Prediction on Large Scale Traffic Networks Using ARIMA and K-Means

Author(s):  
Fatih Acun ◽  
Ebru Aydin Gol
Author(s):  
Athanasios I. Salamanis ◽  
George A. Gravvanis ◽  
Christos K. Filelis-Papadopoulos ◽  
Dimitrios Michail

Author(s):  
Weida Zhong ◽  
Qiuling Suo ◽  
Abhishek Gupta ◽  
Xiaowei Jia ◽  
Chunming Qiao ◽  
...  

With the popularity of smartphones, large-scale road sensing data is being collected to perform traffic prediction, which is an important task in modern society. Due to the nature of the roving sensors on smartphones, the collected traffic data which is in the form of multivariate time series, is often temporally sparse and unevenly distributed across regions. Moreover, different regions can have different traffic patterns, which makes it challenging to adapt models learned from regions with sufficient training data to target regions. Given that many regions may have very sparse data, it is also impossible to build individual models for each region separately. In this paper, we propose a meta-learning based framework named MetaTP to overcome these challenges. MetaTP has two key parts, i.e., basic traffic prediction network (base model) and meta-knowledge transfer. In base model, a two-layer interpolation network is employed to map original time series onto uniformly-spaced reference time points, so that temporal prediction can be effectively performed in the reference space. The meta-learning framework is employed to transfer knowledge from source regions with a large amount of data to target regions with a few data examples via fast adaptation, in order to improve model generalizability on target regions. Moreover, we use two memory networks to capture the global patterns of spatial and temporal information across regions. We evaluate the proposed framework on two real-world datasets, and experimental results show the effectiveness of the proposed framework.


2019 ◽  
Vol 68 (12) ◽  
pp. 12301-12313 ◽  
Author(s):  
Lingyi Han ◽  
Kan Zheng ◽  
Long Zhao ◽  
Xianbin Wang ◽  
Xuemin Shen

2004 ◽  
Vol 14 (04) ◽  
pp. 579-601 ◽  
Author(s):  
MICHAEL HERTY ◽  
AXEL KLAR

Simplified dynamic models for traffic flow on networks are derived from network models based on partial differential equations. We obtain simplified models of different complexity like models based on ordinary differential equations or algebraic models. Optimization problems for all models are investigated. Analytical and numerical properties are studied and comparisons are given for simple traffic situations. Finally, the simplified models are used to optimize large scale networks.


2019 ◽  
Vol 33 (02) ◽  
pp. 1950001
Author(s):  
Dayong Wang ◽  
Guozhu Jia ◽  
Hengshan Zong ◽  
Wei He

Robustness of infrastructure networks is essential for our modern society. Cascading failures are the cause of most large-scale network outages. We study the cascading failure of networks due to overload, using the betweenness centrality of an edge as the measure of its initial load. Taking into account the congestion effect of a slightly overloading edge, we define two capacities (the basic capacity and the removal capacity) of every edge and give three possible states (the free state, the congestion state, and the removal state) of every edge according to its current load. We propose a new method to dynamically adjust two capacities of the slightly overloading edge and study the dynamical features of cascading propagation induced by removing the edge with the highest load in two artificial networks, two traffic networks, and two power grids. We mainly focus on the relationship between the capacity parameters and two robust metrics. By simulations, we find two interesting and counterintuitive results, i.e. enhancing the basic capacity of every edge may weaken the network robustness, and fixing the basic capacity of every edge, simply improving the removal capacity of every edge sometimes makes the whole network more invulnerable. These findings show that investing more maintenance resources to alleviate flow congestion is not always better to avoid the cascading propagation, which is similar to Braess’s paradox in traffic networks.


Sign in / Sign up

Export Citation Format

Share Document