Research Article  Open Access
Multidimensional ScalingBased Data Dimension Reduction Method for Application in ShortTerm Traffic Flow Prediction for Urban Road Network
Abstract
This study develops a multidimensional scaling (MDS) based data dimension reduction method. The method is applied to shortterm traffic flow prediction in urban road networks. The data dimension reduction method can be divided into three steps. The first is data selection based on qualitative analysis, the second is data grouping using the MDS method, and the last is data dimension reduction based on a correlation coefficient. Backpropagation neural network (BPNN) and multiple linear regression (MLR) models are employed in four kinds of urban traffic environments to test whether the proposed method improves the prediction accuracy of traffic flow. The results show that prediction models using traffic data after dimension reduction outperform the same prediction models using other datasets. The proposed method provides an alternative to existing models for urban traffic prediction.
1. Introduction
The success of ITS technology is heavily dependent on the availability of timely and accurate estimates of prevailing and emerging traffic conditions. Hence, there is a strong need for traffic prediction. The method used for prediction should be able to utilize advanced traffic models to analyze data, especially realtime traffic data, from different sources to estimate and predict traffic conditions. Accurate prediction of traffic conditions makes it possible to implement proactive ATMS and ATIS strategies in advance to meet various traffic control, management, and operation objectives.
Urban road systems have a greater need for traffic prediction than freeway and intercity highway systems. Increases in urban populations and vehicle ownership in the last few decades have resulted in severe traffic congestion, with serious economic and social consequences [1]. Therefore, an advanced shortterm traffic flow prediction method is required to support the implementation of realtime traffic management measures, such as a dynamic signal control schemes, traffic information release, and realtime traffic induction.
1.1. Literature Review
Shortterm traffic flow prediction has been an important subject in the field of intelligent transportation research since the 1970s. Up to 200 kinds of shortterm traffic flow prediction models have been developed in the past 50 years.
The first prediction model relies on statistical theory and assumes that traffic flow follows a linear system. Prediction models mainly include the time series model [2], historical average model [3], the Kalman filter [4], and linear regression model [5]. However, traffic flow is very uncertain and nonlinear [6]. Hence, nonlinear theoretical prediction models based on classification theory [7], chaos theory [8], wavelet theory [9], mutation theory [10], and the nonparametric regression method [11] have been developed to address this issue. Over the last decade, studies on traffic prediction models have emphasized the use of the artificial intelligence (AI) model rather than the traditional statistical model. The AI model has no strict mathematical relationship between input and output data but tries to obtain knowledge through training. The most popular AI models are the support vector machinebased model [12, 13] and the neural networkbased model [14, 15]. Certain traffic flow theorybased simulation models have also been used for traffic flow prediction. In the simulation models, a series of mathematical models, such as the motion wave model [16], cellular automata model [17], and threephase traffic flow theory [18], have been used to capture the dynamic characteristics of traffic.
Among the aforementioned prediction models, each has its own advantages and disadvantages [19]. Therefore, researchers have tried to combine different prediction models to improve the stability and accuracy of a single model. Bates et al. [20] first combined two separate sets of forecasts of airline passenger data to form a composite set of forecasts, which showed the superiority and potential of a combined model. Fuzzy logic [21], Bayesian theory [22], and Grey relation analysis [23] are all commonly employed tools used to combine different models. The idea of combining different models has confirmed the need to keep improving the stability and accuracy of single prediction models.
1.2. Challenges in ShortTerm Traffic Prediction
In 2014, Vlahogianni [24] pointed out that recent developments in technology and the widespread use of powerful computers and mathematical models give researchers an unprecedented opportunity to expand their horizons and direct work in 10 challenging, yet relatively underresearched, directions. The main motivations of this paper lie in overcoming two of these challenges.
The first challenge involves the fact that most shortterm traffic forecasting algorithms were built to function at a freeway, arterial, or corridor level. Shortterm traffic forecasting for urban arterials is more complex than that for freeways due to constraints such as signalization. This was pointed out by Kirby [25] 20 years ago, but there has not yet been any change. The limited research on urban traffic focuses on either arterial streets or small local areas. Yin et al. [26] used a fuzzyneural approach to predict urban traffic flow, but only two adjacent junctions were adopted as examples. Stathopoulos and Karlaftis [27] presented a multivariate state space approach to predict traffic flow on urban arterial streets near a downtown. In almost all existing research on urban traffic prediction, the input data for prediction models only consist of historical data from one or several road sections. Moreover, only arterial streets or suburban roads, rather than central streets, are studied. Generally speaking, the characteristics of urban road traffic flow have not been suitably considered in existing prediction models. Hence, it is likely that the prediction results will be unstable and inaccurate if existing prediction models are directly applied to urban road networks.
The second challenge is that identifying spatial and temporal flow patterns has been an important consideration in shortterm traffic forecasting research. The most striking feature of urban traffic is that the source of road flow is very complex and the flow is affected by signal control. In order to obtain accurate prediction results, a large amount of traffic flow data should be collected and the relationships between these data should be analyzed. Traffic flow from different road sections is relevant in terms of both time and space. In other words, a spatialtemporal correlativity analysis is required in urban traffic prediction. Some attempts at such an analysis have been made, such as Cheng’s [28] study of spatiotemporal autocorrelation and Wang’s [29] study of bipattern recognition. The principal methods for spatialtemporal correlativity analysis include the spatiotemporal random effects model [30], aggregation method [31], and state space approach [27]. The main purpose of this study is to combine spatialtemporal correlativity analysis and existing prediction models and to test whether the combined method can reach a better prediction result.
1.3. Motivations and Contributions of the Paper
Shortterm traffic prediction models have been developed for more than half a century. However, their application to urban traffic is limited. With increasing vehicle ownership and network complexity, there are increasing challenges in shortterm traffic prediction for urban traffic. In addition, developments in detection and communication techniques can provide more comprehensive information about traffic conditions for prediction. Hence, the aim of the study is urban traffic flow prediction.
Although large amount of data of urban road traffic can be collected, there are two factors that prevent these data from been directly used in urban road traffic prediction models. The first is computation speed. As the study focuses on shortterm prediction, large amounts of data may reduce the computation speed of the models, decreasing the value of the shortterm predictions. The second is the accuracy of the prediction results. Traffic data from adjacent or homogeneous road sections are highly similar. In other words, large amounts of data contain duplicate and redundant data, which affect the prediction results. Therefore, a method for reducing data dimensions should be applied to the prediction model. To the best of our knowledge, multidimensional scaling (MDS) has not been applied to urban traffic prediction. The advantage MDSbased data dimension reduction is its ability to visualize the level of similarity of a traffic flow data set. Hence, the proposed data dimension reduction method makes it possible to use less data to represent a whole data set, resulting in improved prediction accuracy.
To summarize, the research goals are as follows:
(a) To propose an MDSbased data dimension reduction method that can be used to conduct spatialtemporal correlativity analysis of urban traffic data and divide large amount of traffic flow data into smaller groups according to the level of similarity.
(b) To demonstrate that the proposed method can be combined with existing prediction models. The proposed method will be used to generate a smaller data set to represent all the traffic flow data. The accuracy of the prediction result using the small data set will then be evaluated against those obtained using other data sets.
(c) To illustrate that the proposed method can be combined with different kinds of prediction models and that the combined methods can be adapted to different traffic environments in urban road networks.
2. Data Collection
As previously stated, the main characteristic of urban traffic is its complex direction and signal control management. Compared to that in a single freeway or intercity highway, the traffic direction in urban road networks is more fluid, and signal control results in poor continuity in traffic flow. To collect enough traffic flow data for the study, a virtual network was built in VISSIM to run a simulation, as shown in Figure 1. To reflect the complexity of an urban network, the virtual network is comprised of five main streets and six collector streets. The distance between adjacent streets is randomly set. It is assumed that the structure of the network has no effect on the prediction process; hence, other networks with different structures are not discussed. At each crosssection, lanes with the same driving direction are denoted as one road section. There are 142 road sections in total, and each section has a detector for collecting traffic flow information.
The traffic flow is input into the network through link origins, and the traffic flow subjects to Poisson distribution. In order to test the effectiveness of the proposed method under different environments, four kinds of OD input data are employed: OD_{1}, OD_{2}, OD_{3}, and OD_{4}. OD_{1}, OD_{2}, and OD_{3} have the same flow pattern, but OD_{4} has a different pattern. The same flow pattern means the same number of traffic origins and destinations, and the same main flow direction. The first three kinds of OD differ in the traffic loading level, with a low loading for OD_{1}, medium loading for OD_{2}, and high loading for OD_{3}, while OD_{4} has a medium traffic loading. A fixed signal timing scheme is adopted, and the scheme is optimized using builtin modules in VISSIM.
Based on existing research [32], common prediction intervals for shortterm prediction include 5 min, 10 min, 15 min, and 20 min. Considering the signal cycle at intersections is ~2 min, using a prediction interval of 5 min may lead to instability of prediction result. Alternatively, a long prediction interval reduces the significance of the shortterm traffic prediction. Hence, an interval of 10 min was used. Traffic data are collected on different days, and data should be collected in the same time period to obtain enough historical data. Hence, random seeds are renewed every hour while running the simulation. Thirtynine groups of effective traffic flow data can be collected from each road section for simulation.
3. Application of MDSBased Data Dimension Reduction Method
3.1. Basic Idea of Proposed Data Dimension Reduction Method
The proposed data dimension reduction method is composed of three steps, as follows.
Step 1 (selection of historical data based on qualitative analysis). The road section for which predictions are going to be made is denoted as the target section. All the road sections of the network are connected, and the relationship between them is either strong or weak. It is not necessary to consider the influence of all road sections on the target section. Two principles should be observed when selecting appropriate road sections that have an obvious influence on the target section. Firstly, road sections can be included if vehicles on the section can reach the target section in the upcoming prediction interval. Secondly, road sections where traffic is moving away from the target section are excluded, as there is a low possibility of traffic reaching the target section.
Only the historical data of sections that are supposed to exert an obvious influence on the target section can be used for prediction.
Step 2 (data grouping using MDS method). There are many road sections that remain that must be considered after Step 1 is completed. Hence, the next step is to divide the sections into several groups, making it easier to reduce their dimensions. Similarity is the best criterion for grouping; however, as each section has 39 groups of traffic flow data, it is difficult to directly identify the level of similarity between the different sections. Hence, the MDS method is used here (a detailed explanation of it will be given in a later section). However, the MDS method only provides a visual representation of the patterns of similarities or differences. The final grouping result should involve grouping of road sections on the same street based on the MDS analysis results.
Step 3 (data dimension reduction based on correlation coefficients). After the data grouping in Step 2, it can be assumed that road sections in the same group have affect the target section in similar ways. Hence, the data dimensions can be reduced by choosing one representative road section from each group. The data of the selected road sections will serve as the input data for the prediction section to which the BPNN model and MLR model will be applied. The BPNN model requires a low correlation of input data to enhance its robustness, while the MLR model requires a high correlation of input data. Considering that the historical data of the target section will also serve as the input data, the road sections with highest and lowest correlation with the target section in each group will be extracted. The input data for prediction can then be determined according to the requirements of the prediction model. The Pearson productmoment correlation coefficient, denoted as , will be employed to analyze the degree of correlation between the target section and the other road sections.where is the Pearson productmoment correlation coefficient between the and the sections (i and j are section numbers) and , , , , and are the expectations for , respectively (i and are traffic data for different road sections).
3.2. MDS Method
MDS is a means of visualizing the level of similarity between individual cases in a dataset. It is a form of nonlinear dimensionality reduction. The MDS algorithm places each object in an Ndimensional space, such that the betweenobject distances are preserved as well as possible.
If the traffic data set used for prediction is obtained from n road sections and the number of data values for each section is m, the data to be analyzed can be expressed in an n×m matrix X. As traffic flow data are of the nonmetric multidimensional type, X should be normalized before the Euclidean distance is calculated. The Euclidean distance will be employed to describe the distance and dissimilarity between objects. The Euclidean distance from to is given by the Pythagorean formula. The Euclidean distances between each road section can be expressed using the distance matrix . where is the traffic flow data of road section i ( and ) and is the Euclidean distance from to (which are data from the and sections, respectively).
The goal of the MDS method is to find an embedding from n section vectors into , an Ndimensional vector space, such that the distances are preserved. If N is 2 or 3, n section vectors should be plotted to visualize the similarities. Supposing n vectors can be found in , whose Euclidean distance matrix is close to , then matrix , which is composed of the n vectors, is called the fitting chart of . where is a matrix composed of n vectors in ; is the vector in , denoted as ; and is the Euclidean distance between and .
There are various approaches to determine . Usually, MDS is formulated as an optimization problem, where is a minimizer of the cost function .
The most common approach used to determine is an iterative process commonly referred to as the Shepard–Kruskal algorithm. However, the algorithm is not a major focus of this study. SPASS can be employed to solve the algorithm problem. The goodnessoffit statistic Stress, which is based on the differences between the actual distances and their predicted values, is adopted to express how well is represented by . The smaller the Stress value, the better the fit. The goodnessoffit is excellent when the Stress is less than 0.025, good when it is 0.025–0.050, fair when it is 0.050–0.100, and poor when it is 0.100–0.200.
3.3. Dimension Reduction of Test Data Using Proposed Method
Road section 104 in the virtual network in Figure 1 is used as a case study. The proposed data dimension reduction method is applied to reduce the dimensions of the collected data. According to the principles in Step 1, only 56 road sections should be considered, including the target section. All 56 road sections are renumbered as shown in Figure 2, where the target section is No. 42.
The historical data for 56 road sections can be expressed in a 56×39 X matrix. According to Step 2 of the method, X matrices under four kinds of ODs are analyzed using the MDS method, and the results are shown in Figure 3. The Stress values for all the OD types are under 0.050, which indicates a good goodnessoffit. Based on the similarity analysis, road sections on the same street are grouped with a priority. The 56 road sections can be divided into four groups for each OD. For each kind of OD, there are several road sections that are not within the group, such as section 6 for OD_{2} and OD_{3}, and section 18 for OD_{4}. Apart from these exceptions, the first three ODs have the same grouping result, but OD_{4} has a different grouping result. Figure 4 illustrates the grouping results more clearly, where each color represents a group.
Based on the grouping result, the sections with the lowest and highest correlation with the target section are selected by employing the Pearson productmoment correlation coefficient. The results are shown in Table 1.

4. Prediction Model Construction and Prediction Result Analysis
The BPNN and MLR models were employed to test the effectiveness of the proposed method for data dimension reduction. The BPNN model is a widely accepted knowledge discovery model, and its main feature is its ability to learn and adapt to any uncertain system with complex nonlinear relationships. The MLR model relies on linear relationships. Ideally, the input data should have a low correlation for the BPNN model and a high correlation for the MLR model. This difference makes it impossible to test the effectiveness of proposed data dimension reduction method on different prediction models.
4.1. Evaluation Index Selection
To test the prediction performance of the two prediction methods, two measures, the mean absolute percentage error (MAPE) and the rootmeansquare deviation (RMSE), are employed. They are calculated as follows:where is the observed value, is the predicted value, and S is the number of observed values.
4.2. Construction of BPNN Model
The BPNN model employed contains three layers: input layer, hidden layer, and output layer. The other components are set as follows.
Input data: Three groups of input data for each OD are used for prediction: group AX, group SX, and group TY. Group AX contains all 56 road sections selected via qualitative analysis. Group SX contains the four sections with the lowest correlation and the target section, i.e., five sections in total. Group TY contains only the target section.
Temporal correlation: Based on the concept of the time series prediction model, for all sections, the prediction input data are composed of the historical data of the last three intervals before the prediction period. In other words, if the goal is to predict the traffic flow of the target section in time period t, the input data for section X include X(t1), X(t2), and X(t3).
Data assignment for each section: There are 39 data values for each section. Eighteen are used for training, eight are used for testing, and ten are used for prediction.
Number of neurons: The range of the number of neurons is , where and are the number of nodes of the input and output layer, respectively. The final number of neurons is determined via training and testing.
Function setting: The functions that prove to be most effective based on several attempts of testing are selected and assigned to the BPNN model. All the BPNN models have the same functions. The transmission function for the hidden layer is ‘tansig’ and that for the output layer is ‘purelin’. The training function is ‘trainlm’ and the weight learning function is ‘learndm’.
4.3. Construction of MLR Model
The dependent variable in the analysis is the traffic of the target section. The independent variables are divided into three groups for each OD, i.e., group AX, group SX, and group TY. ANOVA is used to select sections with a significant difference, owing to the large error that occurs when 56 road sections are used for MLR analysis. The ANOVA results are shown in Table 2. Group AX contains all the sections after implementing ANOVA. Group SX contains the four sections with the highest correlation and the target section. Group TY contains only the target section.

As with the BPNN model, temporal correlation is also considered in the MLR model. For each section that is used as an independent variable, the input data are composed of the historical data of the last three time intervals before the prediction period. Only the data from the last 10 intervals of the target section are used for prediction, while the others are used for fitting.
4.4. Assessment of Prediction Results
Because the initial weights in the BPNN model are random, the prediction result varies when the model is rerun. The prediction process is repeated 30 times using the BPNN model. The 10 best results are selected, and the mean values of the evaluation indices are calculated, as shown in Table 3. The prediction result obtained using the MLR model is shown in Table 4.


In most existing research, only the historical data of the target section are used in the prediction model. Therefore, group TY is treated as the representative of regular prediction method. Group AX uses the data of all the related sections for prediction, without considering the spatialtemporal correlativity of the sections. Group SX uses the selected sections by employing the proposed data dimension reduction method, which takes the spatialtemporal correlativity of the sections into consideration. The improvements in the results for methods using group SX and group AX are compared against the method that uses group TY. The degree of improvement is denoted as P in Tables 3 and 4.
The following conclusions can be made from the comparison of the prediction results:(a)According to the MAPE index, the prediction accuracy of the BPNN model is more than 85%, while that of the MLR model is ~80%. The BPNN model is better than the MLR model when a single prediction method is employed.(b)For the two kinds of OD flow patterns, both the method using group AX and that using group SX result in greater improvements in the prediction accuracy than the method using group TY.(c)For the three different levels of traffic loading, both the method using group AX and that using group SX result in greater improvements in the prediction accuracy than the method using group TY.(d)When using the BPNN model for prediction, the prediction accuracy of the method using group AX and that of the method using group SX are very similar. However, because of the difference in the size of the input data, the method using group AX requires more time for prediction than that using group SX.(e)When using the MLR model for prediction, the prediction accuracy of the method using group SX is better than that of the method using group AX.(f)Based on the above, it can be concluded that the proposed data dimension reduction method can improve the prediction accuracy for different conditions, using different prediction models and conditions under different traffic environments.
4.5. Application in Urban Traffic Management
The most common problem in urban traffic management is traffic jams. When a traffic jam occurs, administrators have a limited amount of time to stop it from spreading and causing other problems. More time for management can be obtained if traffic jams can be prejudged. In addition, if the traffic flow on roads that lead to an intersection can be predicted, the occurrence of congestion at the intersection can be determined in advance. The proposed shortterm traffic flow prediction method can play an important role in predicting traffic flow towards intersections and identifying possible traffic jams. Then, based on the prediction results, the management measures can be appropriately adjusted.
The proposed method enables the application of existing prediction models to the urban traffic environment, as it overcomes the complexity and instability limitations of existing prediction models. Large amounts of historical traffic data from different road sections can be collected for each road leading to an intersection. Then, the data dimension can be reduced using the proposed MDSbased data dimension reduction method and a smaller dataset can be obtained to represent the larger dataset. By using a small dataset as the input data in existing prediction models, such as the BPNN and MLR models, a better prediction result is likely to be reached. The result is the basis for predicting traffic jams. The proposed MDSbased data dimension reduction method can also be combined with other prediction models.
5. Concluding Remarks
This study presents an MDSbased data dimension reduction method and applies it to shortterm traffic flow prediction in urban road networks. A virtual network is built to generate traffic flow data, and the proposed method is used to reduce the data dimensions. The test results show significant advantages of applying the proposed method to shortterm traffic flow prediction over the regular prediction method, which only considers the target section’s historical data. Additionally, the proposed prediction method is better at considering all the related sections, in terms of both efficiency and accuracy.
The key contributions of the study are as follows:
First, an MDSbased data dimension reduction method was developed and successfully applied to shortterm traffic flow prediction in an urban road network.
Second, this research has demonstrated that the proposed data dimension reduction method can be combined with existing prediction models and adapted to different traffic environments, regardless of the flow patterns or traffic loading levels. Furthermore, the proposed method is compatible with different types of prediction models, both nonlinear and linear.
Third, an alternative method to apply various prediction methods to urban traffic prediction is presented. In urban traffic systems, the network is more complex and analysis of the spatialtemporal correlativity is necessary.
During the course of this study, several elements for future research were identified, which are as follows. The results reported here are from a hypothetical network. Hence, results from realworld implementation would make the conclusions stronger. Although different ODs are tested in the research, the same network is used. Networks with different structures should be analyzed to prove the effectiveness of the method. The proposed method can also be applied to other prediction models, such as combined prediction models or models that can predict more sections at one time.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Disclosure
An earlier version of this paper has been presented at “Transportation Research Board 97th Annual Meeting” as a presentation.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
References
 I. Thomson and A. Bull, “Urban traffic congestion: its economic and social causes and consequences,” Cepal Review, pp. 105–116, 2002. View at: Google Scholar
 M. Zare and M. Shirazi, “Arima Model for Network Traffic Prediction and Anomaly Detection,” in Proceedings of the International Symposium on Information Technology, vol. 4, pp. 1–6, 2008. View at: Google Scholar
 M. Billy and P. K. D. D. Williams, “Urban Freeway Traffic Flow Prediction,” Transportation Research Record, vol. 1644, pp. 132–141, 2014. View at: Google Scholar
 I. Okutani and Y. J. Stephanedes, “Dynamic prediction of traffic volume through Kalman filtering theory,” Transportation Research Part B: Methodological, vol. 18, no. 1, pp. 1–11, 1984. View at: Google Scholar
 H. Sun, H. X. Liu, H. Xiao, R. R. He, and B. Ran, “Use of Local Linear Regression Model for ShortTerm Traffic Forecasting,” Transportation Research Record, vol. 1836, pp. 143–150, 2014. View at: Publisher Site  Google Scholar
 W. Hui, “Vehicle speed prediction based on clustering and adaptive neurofuzzy inference,” Computer Engineering and Applications, vol. 44, no. 6, pp. 240–242, 2008. View at: Google Scholar
 A. S. Nair, J. C. Liu, L. Rilett, and S. Gupta, “NonLinear Analysis of Traffic Flow,” in Proceedings of the IEEE Conference on Intelligent Transportation Systems, pp. 681–685, Oakland, CA, USA, 2001. View at: Publisher Site  Google Scholar
 S. Y. Chen and W. Wang, “Chaos Forecasting for Traffic Flow based on Lyapunov Exponets,” China Civil Engineering Journal, vol. 37, no. 9, pp. 96–99, 2004. View at: Publisher Site  Google Scholar  MathSciNet
 G. He, S. F. Ma, and Y. Li, “Study on the Shortterm Forecasting for Traffic Flow Based on Wavelet Analysis,” Systems Engineeering—Theory & Pratictice, vol. 22, no. 9, pp. 101–106, 2002. View at: Google Scholar
 X.J. Cheng, J. Liu, and M.S. Ma, “Algorithm of shortterm traffic flow forecasting using fractal theory,” Journal of Transportation Systems Engineering and Information Technology, vol. 10, no. 4, pp. 106–110, 2010. View at: Google Scholar
 G. A. Davis and N. L. Nihan, “Nonparametric Regression and Short‐Term Freeway Traffic Forecasting,” Journal of Transportation Engineering, vol. 117, no. 2, pp. 178–188, 1991. View at: Publisher Site  Google Scholar
 V. N. Vapnik, The Nature of Statistical Learning Theory, Springer, NY, USA, 1995. View at: Publisher Site  MathSciNet
 Q. H. Xu and R. Yang, “Traffic Flow Prediction Using Support Vector Machine Based Method,” Journal of Highway and Transportation Research and Development, vol. 22, no. 12, pp. 131–134, 2005. View at: Google Scholar
 J. Hua and A. Faghri, “AppHcations of Artificial Neural Networks to Intelligent VehicleHighway Systems,” Transportation Research Record, vol. 1453, pp. 83–90, 1994. View at: Google Scholar
 B. L. Smith and M. J. Demetsky, “Shortterm traffic flow prediction modelsa comparison of neural network and nonparametric regression approaches,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 1706–1709, San Antonio, TX, USA, 1994. View at: Google Scholar
 G. F. Newell, “A simplified theory of kinematic waves in highway traffic, Part I: general theory,” Transportation Research Part B: Methodological, vol. 27, no. 4, pp. 281–287, 1993. View at: Publisher Site  Google Scholar
 K. Nagel and M. Schreckenberg, “A cellular automaton model for freeway traffic,” Journal de Physique I, vol. 2, no. 12, pp. 2221–2229, 1992. View at: Publisher Site  Google Scholar
 B. S. Kerner, The physics of traffic, SpringerVerlag, 2004. View at: Publisher Site
 E. I. Vlahogianni, J. C. Golias, and M. G. Karlaftis, “Shortterm traffic forecasting: overview of objectives and methods,” Transport Reviews, vol. 24, no. 5, pp. 533–557, 2004. View at: Publisher Site  Google Scholar
 J. M. Bates and C. W. J. Granger, “The combination of forecasts,” Operational Research Quarterly, vol. 20, no. 4, pp. 451–468, 1969. View at: Publisher Site  Google Scholar
 J. E. Jarrett and J. S. Plouffe, “The fuzzy logic method for simpler forecasting,” International Journal of Engineering Business Management, vol. 3, no. 3, pp. 18–52, 2011. View at: Google Scholar
 J. Wang, W. Deng, and Y. Guo, “New Bayesian combination method for shortterm traffic flow forecasting,” Transportation Research Part C: Emerging Technologies, vol. 43, pp. 79–94, 2014. View at: Publisher Site  Google Scholar
 H. Y. Chen, J. B. Zhao, and C. L. Liu, “Properties of combination forecasting model based on degree of grey incidence,” Journal of Southeast University (Natural Science Edition), vol. 34, no. 1, pp. 130–134, 2004. View at: Google Scholar  MathSciNet
 E. I. Vlahogianni, M. G. Karlaftis, and J. C. Golias, “Shortterm traffic forecasting: where we are and where we're going,” Transportation Research Part C: Emerging Technologies, vol. 43, pp. 3–19, 2014. View at: Publisher Site  Google Scholar
 H. R. Kirby, S. M. Watson, and M. S. Dougherty, “Should we use neural networks or statistical models for shortterm motorway traffic forecasting?” International Journal of Forecasting, vol. 13, no. 1, pp. 43–50, 1997. View at: Publisher Site  Google Scholar
 H. B. Yin, S. C. Wong, J. Xu, and C. K. Wong, “Urban traffic flow prediction using a fuzzyneural approach,” Transportation Research Part C: Emerging Technologies, vol. 10, no. 2, pp. 85–98, 2002. View at: Publisher Site  Google Scholar
 A. Stathopoulos and M. G. Karlaftis, “A multivariate state space approach for urban traffic flow modeling and prediction,” Transportation Research Part C: Emerging Technologies, vol. 11, no. 2, pp. 121–135, 2003. View at: Publisher Site  Google Scholar
 T. Cheng, J. Haworth, and J. Wang, “Spatiotemporal autocorrelation of road network data,” Journal of Geographical Systems, vol. 14, no. 4, pp. 389–413, 2012. View at: Publisher Site  Google Scholar
 J. Wang, P. Shang, and X. Zhao, “A new traffic speed forecasting method based on bipattern recognition,” Fluctuation and Noise Letters, vol. 10, no. 1, pp. 59–75, 2011. View at: Publisher Site  Google Scholar
 Y. Wu, F. Chen, C. Lu, and S. Yang, “Urban Traffic Flow Prediction Using a Spatio Temporal Random Effects Model,” Journal of Intelligent Transportation Systems, vol. 20, no. 3, pp. 282–293, 2015. View at: Publisher Site  Google Scholar
 R. Giacomini and C. W. Granger, “Aggregation of spacetime processes,” Journal of Econometrics, vol. 118, no. 12, pp. 7–26, 2004. View at: Publisher Site  Google Scholar  MathSciNet
 S. Oh, Y.J. Byon, K. Jang, and H. Yeo, “Shortterm traveltime prediction on highway: a review of the datadriven approach,” Transport Reviews, vol. 35, no. 1, pp. 4–32, 2015. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2018 Yi Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.