Search

Smart cities can effectively improve urban life quality. But, with the rise in population size, there is an increase in the use of vehicles for transportation. In smart city development, traffic control and route planning are the primary tasks to address the problem of travel time estimation. It has become complex due to concerns of wrapped spatio-temporal data on dynamic real-time traffic conditions. The existing methods failed to estimate travel time efficiently due to not considering the spatio-temporal features and lack of computing resources. There is a need for a system like intelligent transportation system to monitor and accurately predict traffic flow to avoid traffic congestion and reduce the impact on the ecological system. This paper developed a novel hybrid deep learning model to estimate optimized travel time and possible trajectories. In this work, U-Net used to reduce the number of feature points for each temporal data and GNN is used to build the graph with connectivity between vehicular nodes. This hybrid model helps us predict traffic flow and aims to estimate accurate travel time from one location (node) to another. The model's performance is evaluated on the standard benchmark datasets Q-Traffic, TaxiBJ, and Chengdu. The experimental results show that the proposed framework significantly improves performance in extracting travel patterns and provides an optimal route with an estimated travel time than existing methods with RMSE 4%, MAE 20.49%, and MAPE 18%. The proposed model has accurately predicted the estimation of travel time of the vehicle for the given urban traffic data. [ABSTRACT FROM AUTHOR]

Accurate traffic flow forecasting (TFF) is a prerequisite for urban traffic control and guidance, which has become the key to avoiding traffic congestion and improving traffic management in intelligent transportation systems. To precisely characterize the spatial structure of road networks and discover temporal and spatial characteristics, we propose an attention-based spatial–temporal adaptive dual-graph convolutional network (ASTA-DGCN) for TFF in this paper. Specifically, we employ a spatial–temporal attention module to explore the hidden temporal correlation information of traffic data and the implicit influence of weights among road network nodes and to further capture the dynamic influence of different spatial–temporal positions on the current spatial–temporal position. Then, we utilize an adaptive graph modeling module to automatically extract the one-way relationship between variables and integrate external knowledge into the module. The FastDTW algorithm is exploited to measure the similarity of road network nodes, and the non-Euclidean pairwise association between regions is encoded into graphs to discover the hidden temporal pattern similarity effectively. Furthermore, temporal and spatial correlations are explicitly modeled using dual-graph convolution and sequential convolution based on the obtained graphs to mine the spatial–temporal patterns in dynamic traffic flow, and the final prediction result is produced based on the weighted fusion of the output values of the recent, daily, and weekly components. Finally, the ASTA-DGCN algorithm is successfully applied to TFF on two real-world traffic datasets. The experimental results indicate that our ASTA-DGCN algorithm outperforms ARIMA, VAR, FNN, GCN, GAT, GWNet, STGCN, ASTGCN, and STSGCN. [ABSTRACT FROM AUTHOR]

Predicting future traffic state (e.g., traffic speed, volume, travel time, etc.) accurately is highly desirable for traffic management and control. However, network-wide traffic flow has complicated spatial-temporal dependencies, making it challenging to predict. This study proposes a multi-weighted graph 3D convolution network (MWG3D) to predict future network-wide traffic speed, considering the spatial-temporal heterogeneous effects of multiple external factors (i.e., points of interests (POIs), roadway physical characteristics and incidents). The network is composed of a Graph-3D convolution (G3D) module and an incident impact module. In G3D module, a weighted graph convolution is developed first, which extracts complex spatial dependencies of traffic flow considering heterogeneous effects of POIs and roadway physical characteristics. These external factors have great influence on the periodicity of human daily activities, which in turn cyclically affect traffic flow. The weighted graph convolution is further connected with 3D convolutions to extract temporal dependencies of traffic flow, accounting for temporal heterogeneous effects of these external factors. An incident impact module is separately developed to account for spatial-temporal heterogeneous effects of incidents. These external factors could lead to abrupt and temporary changes in traffic flow. The proposed network is evaluated on two real-world datasets. The results show that MWG3D outperforms a selection of the state-of-the-art models. Furthermore, the spatial-temporal heterogeneous effects of external factors are crucial to prediction accuracy. [ABSTRACT FROM AUTHOR]

Urban mobility is one of the critical challenges in modern cities that should be tackled carefully. The exponential growth of cars number badly impacts the transportation system (TS) on which most cities are living on. Traffic control is one of the most critical issues in TS, which depends on a set of cooperative traffic lights. Smart Traffic lights, which can receive and analyze traffic data, can solve traffic problems by efficiently predict the accurate waiting time for each traffic lane at the intersections. This can improve the traffic flow and accordingly promotes the transportation system performance. This paper introduces a Fog-Based Traffic Light Management Strategy (TLMS) based on Fuzzy Inference Engine. TLMS can accurately calculate the optimal waiting time for each traffic lane at the intersections to decrease the average waiting time for the stopped vehicles. TLMS applies Vehicle to infrastructure protocol (V2I) that allows vehicles to interact directly with the infrastructure of the road such as GPS sensors and the traffic light signals. At each traffic intersection, the number of waiting vehicles, their locations relative to TLMS, and their sizes are detected and sent to TLMS in real time. Then, based on fuzzy inference, TLMS can calculate the optimal waiting time for each lane, which optimizes the traffic flow at the intersection by minimizing the waiting time for the vehicles. The performance of the proposed TLMS has been compared and tested against recently proposed techniques via simulation. The results of the experiment showed that TLMS outperforms recent technologies as it minimizes the average waiting time of vehicles around the intersections and accordingly maximizes the performance of the traffic system. [ABSTRACT FROM AUTHOR]

Traffic flow forecasting (TFF) is critical for constructing intelligent transportation systems and offering real-time traffic applications, and especially accurate flow forecasting based on traffic big data can drive reliable strategies for traffic management and control. To consider the weight of the influence of the spatial correlation among the road segments and capture the nonlinear characteristics of traffic flow, this paper presents a parallel Normal Distribution and Attention Mechanism Weighted Deep Bidirectional Long Short-Term Memory (NAW-DBLSTM) algorithm on Spark. Specifically, we employ the resilient distributed data set (RDD) to preprocess large-scale mobile trajectory data (e.g., taxi GPS trajectory data), and then Kalman Filter (KF) is utilized to smooth the taxi trajectory big data. Next, the parallel NAW-DBLSTM algorithm is put forward on a Spark distributed computing platform to enhance the accuracy and scalability of TFF, combined with the attention mechanism and the normal distribution, and then the time window is used for TFF. Finally, the traffic flow is forecasted successfully on Spark by our NAW-DBLSTM algorithm with the real-world GPS trajectories of taxicabs. The experimental results demonstrate that, compared with LSTM, BiLSTM, DBLSTM, DNN, SVR, KNN, SAEs, BP, CNN, GRU, and ANNs, NAW-DBLSTM can produce better performance with the MAPE value that is 85.1%, 80.1%, 85.8%, 73.1%, 78.2%, 77.9%, 78.8%, 84.6%, 96.4%, 86.2%, and 73.2% lower than that of comparable algorithms, respectively. Particularly, the MAPE value of NAW-DBLSTM is 28.3%, 20.1%, 71.1%, and 79.1% lower than that of LSTM weighted with the normal distribution and the attention mechanism (NAW-LSTM), BiLSTM weighted with the normal distribution and the attention mechanism (NAW-BiLSTM), DBLSTM weighted with the normal distribution (NW-DBLSTM), and NAW-DBLSTM weighted without the time window (NT-NAW-DBLSTM), respectively. [ABSTRACT FROM AUTHOR]