An Improved Deep Spatial-Temporal Hybrid Model for Bus Speed Prediction
For resolving or alleviating the transportation problems, it is necessary to efficiently manage the public transportation and provide public transport services with high quality and advocate green travel, which rely on accurate traffic data. In order to obtain more accurate bus speed in the future, this paper proposed a novel dynamic hierarchical spatial-temporal network model based on Grey Relation Analysis (EGRA), the convolutional neural network (CNN), and the gated recurrent unit (GRU). The proposed model is named the DHSTN; it exploited EGRA to analyze and choose the suitable candidate line sections with high impacts on the target section and, then, construct a multilayer structure based on the CNN, GRU, and attention mechanism to analyze and capture the spatial and temporal dependency, and finally, the extreme learning machine (ELM) is exploited for the fusion of the long-term and short-term dependency to predict the bus speed variation in the next time interval. Comparative experiments indicate that the DHSTN has better performances, the mean absolute error is around 2.6, and it meets the real requirements.
With the urbanization, urban population grows rapidly, the increase in the aggregate amount of urban automobiles is still high on the way, and urban public resources are limited or insufficient; these lead to the urban transportation problems which are more and more serious such as traffic congestion, traffic overload, and traffic accidents which are the major problems facing widespread life. Thus, green travels advocated by related organizations and urban public transport system are the main forces of urban transportation, which play an important role. Urban buses are the basic of urban public transport system, and it is crucial to analyze the urban buses and their relative information, such as bus speed and bus travel time.
Bus speed is the vital information, and it is essential for improving the performances of the urban public transport system . For the public transportation agencies, they can manage the whole public transportation, schedule the buses and other resources to meet the travel requirements efficiently, and hence, mitigate crowdedness at bus stations and in buses and increase ridership . For travelers, they can plan their trips based on these information reasonably. Besides, accurate and timely information about the bus speed and time is crucial; it could attract more travelers, reduce the waiting time, and improve their satisfaction [3, 4]. Therefore, for providing public transportation agencies and travelers with more timely and accurate information, efficient models need to be developed to predict the bus speed more accurately.
As is known, the bus speed prediction has gradually attracted the attention of researchers and public transportation agencies , it is significantly different from traditional traffic speed prediction, and its impacts are more, such as traffic congestions and bus operation schedules. But, nowadays, lots of cities set the bus lane in traffic peak hours, and to some extent, this alleviates the problems within prediction. Thus, the bus speed prediction is more similar to the traffic speed prediction in some time without considering scheduling and other relative factors, and it can refer to more traffic speed prediction models, but it remains facing many challenges.
Similar to traffic speed prediction, it is necessary to consider sufficient factors to construct the prediction model for achieving accurate results. Thus, this paper proposes an efficient prediction model for bus speed, called the Dynamic Hierarchical Spatial-Temporal Network, (DHSTN). The contributions of the DHSTN mainly involve four aspects: (1) The dynamic weights method is proposed to calculate the bus travel average speed of the bus line section; it makes full use of the each bus speed passing the bus line section and improves the accuracy of average speed. (2) The Entropy-based Grey Relation Analysis (EGRA) is introduced to analyze the spatial correlations of nearby line sections and the target section, in order to extract the spatial line sections from candidates as the analyzed objects together with target section. (3) For making full use of the long-term temporal features, the attention mechanism is introduced to analyze the long-term temporal feature, so as to improve the prediction accuracy. (4) A multilayer structure is proposed; it combines the CNN, GRU, and attention mechanism, in order to capture the spatial and long-term/short-term temporal features within the travel speed.
2. Related Works
In the recent years, the bus speed prediction has gradually drawn researchers’ attention, and various prediction models have been proposed. Different from traditional traffic speed prediction, these models rarely used linear models (such as ARIMA [6, 7]) to predict the bus speed because the bus speed is not a standard problem, and the prediction results are not better. For analyzing the nonlinear features within bus speed data, many nonlinear models are exploited by researchers, such as the Bayesian network , Support Vector Machine (SVM) , radial basis function neural networks (RBFNN) , Kalman filter , back propagation neural network (BPNN) , and extreme learning machine (ELM). The core idea of nonlinear models is to capture the nonlinear relationship within speed data and mine more potential information without prior knowledge . Both the linear and nonlinear prediction models are based on the time-dependent features of bus speed data and only analyze the short-term temporal dependency.
Each prediction model mentioned above has its own limitations and advantages; to some extent, it captures one or more features of bus speed, and it is hard to cover all or most of features and provide better prediction performances by a single model . Thus, for making full use of each prediction model, researchers proposed the hybrid models, which combine two or more prediction models, and they make up for the limitations of the single model and show better prediction performances. Yang et al.  proposed the GA-SVM model based on SVM and genetic algorithm (GA) in analyzing the features of bus travel speed data, it still considered the time period, road length, weather, and other factors, and testing results showed that GA-SVM is superior to the single SVM model and Artificial Neural Network (ANN). Hashi et al.  proposed a novel hybrid model based on SVM and the Kalman filter to predict bus arrival time, and test results showed that it has better performances than GA-SVM.
The linear prediction models, nonlinear prediction models, and the hybrid prediction models mentioned above are exploited to capture the temporal dependency within the data and still have good performances. As is known, the bus speed has obvious temporal features, which are made full use of by many prediction models, but it is noted that the speed has still spatial dependency. Thus, in analyzing the features within the data, the prediction models should capture the spatial and temporal dependency. Liu et al.  proposed a comprehensive prediction model based on the long short-term memory (LSTM) and ANN, and it utilized the spatial-temporal features vector to predict the bus arrival time. Cui et al.  proposed a novel multivariate conditional autoregressive (MCAR) model, and it is exploited to analyze the spatial and temporal correlations of the bus speeds. Sun et al.  proposed a hybrid prediction model based on the LSTM and attention mechanism, it can capture the spatial and temporal features, but it is weak in capturing the long-term temporal dependency. Hu et al.  proposed a novel Bayesian model to characterize space-time interaction patterns and to construct a bus speed prediction model further. Gu et al.  proposed a fusion model based on LSTM, EGRA, and the gated recurrent unit (GRU), and a double-layer structure is constructed based on the LSTM and GRU in order to resolve the problem that the single-layer LSTM or GRU cannot capture the short-term temporal dependency. Lu et al.  proposed a novel hybrid model for lane-level traffic prediction; it is based on the complete ensemble empirical mode (CEEMDAN) and extreme gradient boosting (XGBoost), CEEMDAN is exploited to decompose the raw data into two components, and the XGBoost is used to analyze each component and predict its changes, respectively, and finally, the prediction results are integrated to obtain the final prediction result; experimental results confirm that the hybrid model outperforms the state-of-the-art models in the term of prediction accuracy and stability. Guo et al.  proposed a novel prediction fusion framework; it can combine multiple individual predictors and use different fusion strategies to improve the model performances. Gu et al.  proposed an improved Bayesian combination model with deep learning (IBCM-DL); it analyzes the relevance between the historical traffic data and current data, and three subpredictors are incorporated into the IBCM framework to take advantages of each model. Bachu et al.  developed a new prediction method which considers both temporal and spatial variation in travel time; first, it rewrites the conservation of vehicles equation in terms of flow and density instead of speed, then discretizes the novel equation, and finally, it is used in the prediction scheme which is based on the Kalman filter, and experimental results confirm that the proposed method is able to perform better. Ma et al.  also proposed a novel segment-based approach to predict bus travel time using a combination of real-time taxi and bus datasets, and the experimental results confirm that the novel approach improves the accuracy of bus travel time prediction, especially under abnormal traffic conditions.
In the section, after analyzing the urban bus net and bus trajectory data, we give a novel method for getting the average speed of each bus line section.
Different from the urban road net, the urban bus line is irregular, and the urban bus net is complex, as shown in Figure 1, in which the black points are the stations, green means that the traffic in the line sections is smooth, yellow means it is slow traffic, and red means it is congested. Before analyzing the bus running trajectory data, the bus net needs to be gridded based on the stations. But, it is generally known that several bus lines may overlap in some area; this leads to the stations to get too close, and the bus net being gridded is too complex. So, the stations in the overlapping area of bus lines are merged, in order to simplify the bus net after being gridded, and the result is shown in Figure 2.
Based on the gridding bus net, the bus running data can be matched to the corresponding line section, by the following equations:where and are the position of any two adjacent stations and is the trajectory point position of any running bus.
When the bus runs from station to station , its running speed is not constant, and it is sometimes in the process of acceleration or deceleration, as shown in Figure 3.
The state of acceleration and deceleration is not conductive to get the average speed from station to station (or line section). Thus, the trajectory point data in the speed buffer area is not considered.
In general, the average speed of bus in line section is obtained by the following equation:where is the length of line section , and are the projection time of bus passing endpoints and of line section , and . But, due to various reasons, in real bus trajectory data, it is hard to get time and . Based on these bus trajectory points in the line section, a novel method (Dynamic Weight Computing Method, DWCM) for computing the average speed is given, and it performs in two sequential steps.
The first step is to compute the average speed of each bus passing the line section. Based on the running trajectory of the bus, the first trajectory point and the last trajectory point data in the line section are selected to compute its average speed as follows:where and are the sampling time of the first trajectory point and the last trajectory point in the line section, respectively, and is the length of the line between the first trajectory point and the last trajectory point.
The second step is to compute the average speed of buses in the line section. In general, the average of one or several buses cannot fully reflect the real average speed of the line section, and it is partial. Thus, the impact factor , a novel conception is proposed, and it can dynamically show the influences of each bus average speed on the real average speed of the line section. It is obtained by the following equations:where is the number of buses passing line section . Finally, based on and , the average speed of the line section can be obtained by the following equation:
4.1. Temporal Dependency Mining
As a basic part of the urban intelligent transportation system, urban bus speed exhibits higher correlation in a short time period, due to the nature of the transportation system , and the short-term temporal dependency is the key factor for prediction. Moreover, similar to traffic flow, it also exists long-term temporal dependency within bus speed data. The special example is that because of extreme congestion or extreme weather, the buses will take a long time to travel from the last line section to current line section. Hence, during temporal dependency mining, both the short-term and long-term temporal dependency must be taken into account. Traditional methods only consider the short-term temporal dependency and ignore coexistence of short-term temporal dependency and long-term temporal dependency. In the recent years, many research findings have explored the fusion methods to mine the temporal dependency within the data [25–29]. The long short-term memory network (LSTM) is an important RNN and introduced to analyze temporal features of traffic data [27, 30], and it can fully capture both short-term and long-term memories within traffic data and avoid gradient vanishing or exploding problems.
As is known, the LSTM is an ideal structure , has good performances, and avoids some unnecessary problems, but its learning parameters are a little more, to some extent, which affects the time performance. The Gated Recurrent Unit (GRU) is a variant of the LSTM; it is essentially an LSTM without an output gate, and its structure is simpler and learning parameters are less, but the GRU can achieve equal or even better performances . The GRU only has two gates, update gate and reset gate , is to control the degree which the previous hidden state inputs current new hidden state , and is to control the degree of ignoring the previous hidden state. Thus, for current input , , , , and the final output are calculated by the following equation :where , , , , , , and are the weight matrix. and are the activation functions, , , and . represents the Hadamard product of two vectors.
4.2. Spatial Dependency Mining
Only analyzing the temporal features of bus speed will weaken the prediction performances. It is well known that traffic data shows the spatial features obviously; for example, the traffic state of the current line section may be affected by its upstream or downstream line sections. In what follows, it is to focus on exploring the spatial features within bus speed, for which the convolutional neural network (CNN) is selected. The CNN originates from tackling the image processing problems, and it is a highly efficient tool and, naturally, has been utilized in many works [26, 33–36]. Moreover, analyzing the whole urban bus net is a very complex task; it needs lots of data, more resources, and much more time. In real application, it may find out various problems, e.g., only analyzing bus arrival time. These need to transform the whole net to many small segments, which is analyzed easily. In the study, based on the characteristics of current bus lines and data, the 1D-CNN is exploited to mine the spatial features within the data, and thus, it performs the 1D convolution on the vectors of matrix from upstream to downstream by the equation (9) ( is the speed matrix, , and is the line section id, where ).where and are the output and input of the -th convolution layer, respectively, represents the bias, represents the convolutional weights, represents the activation function, and is the convolution.
One of advantages of the deep neural network is that it could improve its performances by increasing hidden layers; the more the hidden layer is, the better its representation capability is, but it is weak in time performances and data demands and also leads to be over fitting easily, and the appropriate hidden layers can balance the performances and make the better results. Thus, based on multiaspect factors, it sets the hidden layers as 3, . As mentioned above, the CNN is weak in the time performances, for converging fast, the Rectified Linear Units (ReLUs) are exploited as the nonlinear activation function, and it can also tackle the gradient vanishing or exploding problems .
It is well known that, for the CNN, the convolutional layer is the key component, in which, the filter is applied to capture the features from input data. Moreover, Springenberg et al.  proposed a novel CNN, whose pooling layer is replaced by a convolutional layer; it has state-of-the-art or competitive performances on the object recognition with small images. Thus, after fully analyzing existing data and its limited space dimension, the special 1D-CNN without the pooling layer is exploited to capture the spatial features.
The GRU described above only uses previous data, which are usually a few hours’ data, and it does not consider the long-term dependency within the data; long-term dependency has great influences on the final prediction and it is still. As is known, urban bus speed data show obvious periodicity, the same as other traffic data. Thus, it needs to capture both long-term and short-term dependency during prediction and consider the previous short-term data and long-term historical data. Since the shallow single-layer GRU does not capture the long-term memory , it needs to be extended further.
In this paper, the data of previous days are used to capture the long-term information, and for each day, only limited data near predicted time are chosen, which can reduce influences of redundant data on the final performances. In analyzing the periodicity of bus speed, it finds out the same problem as traffic flow, which is the temporal shifting of periodicity . Thus, it needs to analyze the importance of each input data on the final prediction result, , for this the attention mechanism is exploited to analyze each input data. Some researches [40–42] show could be analyzed by linear or nonlinear methods.
The attention mechanism is that, before inputting data into the GRU, it needs to analyze its importance, as shown in Figure 4. We set , where it is assumed that the values near the time have impacts on the prediction, is the weight of each input, and the relation between and iswhere is the bias. Equation (10) is a multiple regression function; it needs to get optimal by minimizing the error between and the predicted value , , and is the function calculating the error. For the time performance, the idea of Extreme Learning Machine (ELM) is exploited to solve the problem, and and are learning parameters. Finally, the importance of is obtained by the following equation:and then, the new input of the GRU is , where is the analyzing results by minimizing the error .
4.4. Fusion Method
Based on the analysis mentioned above, a novel fusion is proposed, called the Dynamic Hierarchical Spatial-Temporal Network (DHSTN). Figure 5 is the model architecture. Considering the periodicity and continuity of the urban bus speed, continuous time series data of previous days and the same day last three week are selected as the inputs of the DHSTN with the near-term bus speed data, which are highly correlated to the future bus speed.
The DHSTN is includes six steps. (a) The first step is the feature extracting, showing the “a” in Figure 5. As is known, bus speed data have obvious spatial feature, and it needs to choose the nearby line sections from candidates. For more correlated spatial variables, the correlation analysis is exploited to recognize the line sections with high impacts on the target section. After analyzing lots of related methods, the Entropy-based Grey Relation Analysis (EGRA) is chosen to analyze the candidate line sections, and detail description refers to the literature [43, 44]. (b) The second step is the spatial dependency mining and, in fact, spatial feature analysis has already started in the first step, and in spatial mining, the CNN is chosen, detailed in the section “Spatial Dependency Mining.” (c) The third step is the attention. In the paper, the previous days data , , are chosen to analyze the long-term dependency, for each previous day, and it needs to know the importance of near-term time data on the final predicting time , in order to generate more reasonable input data . (d) The fourth step is the temporal dependency mining, including the short-term and long-term dependency. The short-term dependency analysis is in the first GRUs, and for each previous day , the final time data are obtained. The long-term dependency analysis is in the second GRUs, and for each , the long-term information could be preserved by , , and is the output of the -th GRU and is the input of the -th GRU. (e)The fifth step is the short-term dependency analysis for the target line section. It also includes spatial and temporal dependency mining, which is similar to the step (b), (c), and (d), and the main difference is that step (e) uses one GRU layer to analyze the short-term dependency of target line section. The final output is the concatenation of and , , which preserves the short-term and long-term temporal dependency information. (f) The sixth step is the final prediction, and it uses ELM to fit and get the final result. It is noted that the data during the whole processing are all centered on the target line section, and the superscript “0” indicates the day of time to predict.
For verifying the proposed fusion model (DHSTN), real bus speed datasets are used to conduct experiments by comparing with other models (ARIMA, MLP , RBFNN , TM-CNN , FDL , DNN-BTF , RS-DHSTN (its feature extracting strategy is replaced with random selection), KNN-DHSTN (its feature extracting strategy is the k-nearest neighbor method), and NAM-DHSTN (it is a special DHSTN without attention module)). These data are sampled from the Huangpu road of Dalian city, shown in Figure 6, where the line sections include LS001, LS002, …, LS009, and LS006 is the target line section. The sampling period is from November 5, 2018, to November 18, 2018, and from December 3, 2018, to December 16, 2018. For real requirements, original data are aggregated into time series in a 5-minute interval so as to generate an average speed time series, based on the equation (4)–(7), shown in Figure 7. Moreover, the model performances are evaluated by the mean absolute error (MAE), the mean absolute percent error (MAPE), and the root mean-squared error (RMSE).
5.1. Average Speed Analysis
For testing the performances of the average speed analysis method (DWCM) proposed in the paper, we use the method based on speed integral (SI method) proposed by Quiroga and Augusto . Figure 8 is the average speed analyzing result. As is shown, comparing with the SI-method, the proposed method could compute the average speed of line sections more accurately.
In addition, the unstable states of bus entering and leaving the station have impacts on analyzing average speed. For verifying these, the comparing tests are carried out under considering/not considering the unstable states (C-US and NC-US). Table 1 is the result error of the two methods. Under considering the unstable state, the MAPE of the DWCM is only 6.53%, which is far less than that of the SI method, 9.47%. As is shown, it is indicated that independent of whether the unstable states are considered or not, the DWCM method for analyzing the average speed is better than the SI method.
Figure 7(a) is the average speed of a weekday. The tendency of speed is different from traditional traffic speed, on weekdays, its peak time is delay, and its changes are not much greater than that of traditional traffic speed in peak time. The reason is that, in the peak time, there are bus lanes, whose time is from 6:30 am to 8:30 am in the morning and from 16:00 pm to 19:00 pm. After the time, the traffic peak is almost over. Because of the works and other reasons, the traffic state on weekends is stable, and the bus speed is much smoother, as shown in Figure 7(b).
5.2. Feature Extraction
Table 2 is the results of extracting spatial features within the bus line sections given in Figure 6. As is shown, GRG values of the candidate line sections near the target section are larger, and it means that these sections are more likely to be chosen as inputs of the DHSTN. Besides, GRG values of upstream sections are larger than that of downstream ones, and it indicates that the upstream line state has greater impacts on the target section than that of the downstream ones. If , the candidates with top 5 GRGs are selected to construct the input matrix.
5.3. Prediction and Analysis
Figure 9 shows the prediction results of the DHSTN on a weekday/weekend. From the figure, it is known that the DHSTN is capable of efficiently fitting the tendency of bus speed and also capturing the sudden change with an excellent performance. Table 3 is the analysis of prediction performances of the DHSTN. It indicates that the DHSTN is working better for the weekend than that for the weekday due to relatively stable speed, and its performance for weekends is superior to that for weekdays, which is improved of 0.61, 0.89%, and 0.56 on MAE, MAPE, and RMSE, respectively, because on weekends, the buses run more smoothly.
To evaluate the performances of the DHSTN and test the importance of the two modules of the DHSTN, the feature extracting module and attention module, the comparison experiments with the RS-DHSTN, KNN-DHSTN, and NAM-DHSTN are conducted. Table 4 shows the average evaluation results for week datasets. From Table 4, it is observed that the DHSTN is better and has smaller error. Comparing with random selection and the KNN, the DHSTN improves by 45.60% and 29.09% on MAE, respectively, and 38.80% and 24.03% on MAE, respectively. It indicates that the feature extracting module is the basic, and better candidate selection strategy could improve the performances of the DHSTN. Comparing with the NAM-DHSTN, it improves by 16.93%, 15.88%, and 17.45% on MAE, MAPE, and RMSE, respectively, and it means that the attention module could analyze the importance of each near-term time data and improve the prediction accuracy.
For verifying the performances of the DHSTN further, several methods are exploited to carry out the comparative experiments. Table 5 is the comparison of prediction results by considering a week as a whole. From the table contents, the DHSTN works better than other methods, it outperforms the second better model DNN-BTF with the improvement of 21.06% and 8.36% on MAE and MAPE, respectively, and compared with the nonparameter method MLP, it improves with 41.30%, 49.62%, and 47.69% on MAE, MAPE, and RMSE, respectively. The results indicate that the DHSTN can efficiently capture the spatial and temporal features of urban bus speed and has better performances. Among these models, ARIMA and MLP only analyzed the time series information, but their performances are better than those of RBFNN, which considered spatial and temporal features. It means that the temporal features are essential for short-term prediction, and spatial information may lead predictor worse, so reasonable utilization of spatial and temporal information is of vital importance.
Figures 10 and 11 are the part prediction results of each model on the weekday and weekend, respectively (from 7:30 to 9:30 on the weekday and from 16:30 to 18:30 on the weekend). From the changing tendency, these models can capture the features of bus speed, while the spatial-temporal models are better. The difference between real data and prediction results of the DHSTN is around 2.6, and the least difference of other predictors is about 3.1. Thus, the DHSTN proposed in the paper has the better performances.
Table 6 is the comparison analysis of different models on weekdays and weekends. The error of the DHSTN is the least among these models, the least MAE is 2.3898, comparing with others, and its accuracy is improved by 41.38%, 45.73%, 26.72%, 16.71%, and 12.25% on weekdays and 46.25%, 49.84%, 56.05%, 39.76%, 31.03%, and 19.18% on weekends, respectively. It is noted that the MAE and RMSE of each models on weekends are similar to that on weekdays, while the MAPE on weekdays is much larger than that on weekends, which means that the prediction results on weekends are better. The reason is that different from weekdays, the urban traffic on weekends is more stable and the bus speed is smoother.
In this paper, the original bus speed data were deeply analyzed and constructed as the time series with the time interval of 5 minutes based on the proposed dynamic weight computing method to generate the bus travel average speed in each line section. Referring to relative models, the Dynamic Hierarchical Spatial-Temporal Network model (DHSTN) is proposed, which consists of the GRU, CNN, EGRA, and attention mechanism. First, it exploits EGRA to analyze the candidate line sections based on the correlations, in order to choose the suitable candidates with high impacts on the target section. In the next, the DHSTN constructs multilayer structure by using the CNN, GRU, and attention mechanism to analyze and capture the spatial dependency, long-term and short-term temporal dependency. Finally, by ELM, it fuses the spatial dependency of nearby line sections and temporal dependency of the target section to predict the bus speed variation in the next time interval. For verifying the model performances, the comparative experiments are conducted with ARIMA, MLP, RBF, TM-CNN, FDL, and DNN-BTF, and the results show that the proposed prediction model can accurately capture and predict the bus speed variation.
The urban bus travel speed data used to support the findings of this study have not been made available, because the data are from the operation system of relevant enterprise, according to the operation specifications, these data are still in the confidential stage, and we are not authorized to release the data.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
This work was supported in part by the Fundamental Research Funds for the Central Universities under Grant 3132019354, Scientific Research Fund of Liaoning Provincial Education Department under Grant JYT2019LQ01, National Natural Science Foundation of China under Grant 51679025, and Science and Technology Program Foundation of Liaoning Province under Grant 2019JH2/10300052.
R. H. Jeong, The Prediction of Bus Arrival Time using Automatic Vehicle Location Systems Data, Texas A & M University, 2004.
M. Napiah and I. Kamaruddin, “ARIMA models for bus travel time prediction,” Journal of Industrial Engineering and Management Malaysia, vol. 71, pp. 49–58, 2010.View at: Google Scholar
J. Wang, B. Yu, and Y. zhong, “Bus travel-time prediction based on bus speed,” Proceedings of the Institution of Civil Engineers-Transport, vol. 163, pp. 3–7, 2010.View at: Google Scholar
J. Pan, X. Dai, X. Xu, and Y. Li, “A self-learning algorithm for predicting bus arrival time based on historical data model,” in Proceedings of the 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems, pp. 1112–1116, Hangzhou, China, October 2012.View at: Publisher Site | Google Scholar
T. Bogaerts, A. D. Masegosa, J. S. Angarita-Zapata, E. Onieva, and P. Hellinckx, “A graph CNN-LSTM neural network for short and long-term traffic forecasting based on trajectory data,” Transportation Research Part C: Emerging Technologies, vol. 112, pp. 62–77, 2020.View at: Publisher Site | Google Scholar
H. Yao, X. Tang, H. Wei, G. Zheng, and Z. Li, “Modeling spatial-temporal dynamics for traffic prediction,” 2018.View at: Google Scholar
K. Cho, B. V. Merrienboer, C. Gulcehre et al., “Learning phrase representations using RNN encoder-decoder for statistical machine translation,” in Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), Doha, Qatar, October 2014.View at: Publisher Site | Google Scholar
Z. Cui, R. Ke, and Y. Wang, “Deep bidirectional and unidirectional LSTM recurrent neural network for network-wide traffic speed prediction,” 2018.View at: Google Scholar
G. Hinton, “Rectified linear units improve restricted Boltzmann machines Vinod Nair,” in Proceedings of ICML, pp. 807–814, Haifa, Israel, June 2010.View at: Google Scholar
J. T. Springenberg, A. Dosovitskiy, T. Brox, and M. Riedmiller, “Striving for simplicity: the all convolutional net,” 2014.View at: Google Scholar
A. Karpathy, J. Johnson, and L. Fei-Fei, “Visualizing and understanding recurrent networks,” 2015.View at: Google Scholar
A. W. Kuang and Z. X. Huang, “Short-term traffic flow prediction based on RBF neural network,” Systems Engineering, vol. 22, no. 2, pp. 63–65, 2004.View at: Google Scholar
R. Ke, W. Li, Z. Cui, and Y. Wang, “Two-stream multi-channel convolutional neural network for multi-lane traffic speed prediction considering traffic volume impact,” Transportation Research Record: Journal of the Transportation Research Board, vol. 2674, no. 4, pp. 459–470, 2020.View at: Publisher Site | Google Scholar
C. Quiroga and C. Augusto, An Integrated GPS-GIS Methodology for Performing Travel Time Studies, Louisiana State University, Baton Rouge, LA, USA, 1997.