scispace - formally typeset
Search or ask a question

Showing papers by "Xiaolei Ma published in 2017"


Journal ArticleDOI
10 Apr 2017-Sensors
TL;DR: Wang et al. as mentioned in this paper proposed a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy.
Abstract: This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.

894 citations


Posted Content
TL;DR: The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks and outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time.
Abstract: This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.

775 citations


Journal ArticleDOI
Haiyang Yu1, Wu Zhihai1, Shuqin Wang, Yunpeng Wang1, Xiaolei Ma1 
26 Jun 2017-Sensors
TL;DR: Wang et al. as mentioned in this paper proposed a spatiotemporal recurrent convolutional networks (SRCNs) for traffic forecasting, which inherit the advantages of deep CNNs and LSTM neural networks.
Abstract: Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

385 citations


Posted Content
Haiyang Yu1, Wu Zhihai1, Shuqin Wang, Yunpeng Wang1, Xiaolei Ma1 
TL;DR: A network grid representation method that can retain the fine-scale structure of a transportation network and outperform other deep learning-based algorithms in both short-term and long-term traffic prediction is proposed.
Abstract: Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

339 citations


Journal ArticleDOI
TL;DR: A clear disparity between commuters and noncommuters is determined and the existence of job–house imbalance in Beijing is confirmed, providing useful insights for policymakers to shape a more balanced job–housing relationship by adjusting the monocentric urban structure of Beijing.

258 citations


Journal ArticleDOI
TL;DR: A novel method, gradient boosting decision trees (GBDTs), is proposed to predict the nonlinear and imbalanced incident clearance time based on different types of explanatory variables, and is significantly superior to other algorithms for incidents with both short and long clearance times.
Abstract: Identifying and quantifying the influential factors on incident clearance time can benefit incident management for accident causal analysis and prediction, and consequently mitigate the impact of non-recurrent congestion. Traditional incident clearance time studies rely on either statistical models with rigorous assumptions or artificial intelligence (AI) approaches with poor interpretability. This paper proposes a novel method, gradient boosting decision trees (GBDTs), to predict the nonlinear and imbalanced incident clearance time based on different types of explanatory variables. The GBDT inherits both the advantages of statistical models and AI approaches, and can identify the complex and nonlinear relationship while computing the relative importance among variables. One-year crash data from Washington state, USA, incident tracking system are used to demonstrate the effectiveness of GBDT method. Based on the distribution of incident clearance time, two groups are categorized for prediction with a 15-min threshold. A comparative study confirms that the GBDT method is significantly superior to other algorithms for incidents with both short and long clearance times. In addition, incident response time is found to be the greatest contributor to short clearance time with more than 41% relative importance, while traffic volume generates the second greatest impact on incident clearance time with relative importance of 27.34% and 19.56%, respectively.

161 citations


Journal ArticleDOI
Yang Li1, Xudong Wang1, Shuo Sun1, Xiaolei Ma1, Guangquan Lu1 
TL;DR: A novel multiscale radial basis function (MSRBF) network for forecasting the irregular fluctuation of subway passenger flows is proposed and three empirical studies with special events in Beijing demonstrate that the proposed algorithm can effectively predict the emergence of passenger flow bursts.
Abstract: Reliable and accurate short-term subway passenger flow prediction is important for passengers, transit operators, and public agencies. Traditional studies focus on regular demand forecasting and have inherent disadvantages in predicting passenger flows under special events scenarios. These special events may have a disruptive impact on public transportation systems, and should thus be given more attention for proactive management and timely information dissemination. This study proposes a novel multiscale radial basis function (MSRBF) network for forecasting the irregular fluctuation of subway passenger flows. This model is simplified using a matching pursuit orthogonal least squares algorithm through the selection of significant model terms to produce a parsimonious MSRBF model. Combined with transit smart card data, this approach not only exhibits superior predictive performance over prevailing computational intelligence methods for non-regular demand forecasting at least 30 min prior, but also leverages network knowledge to enhance prediction capability and pinpoint vulnerable subway stations for crowd control measures. Three empirical studies with special events in Beijing demonstrate that the proposed algorithm can effectively predict the emergence of passenger flow bursts.

159 citations


Journal ArticleDOI
TL;DR: In this article, a multi-phase hybrid approach with clustering, dynamic programming, and heuristic algorithm is presented to solve the model formulation, and optimal sequential coalitions are selected based on strictly monotonic path, cost reduction model, and best strategy of sequential coalition selection in cooperative game theory.

144 citations


Journal ArticleDOI
01 Jul 2017
TL;DR: The proposed cooperation and profit allocation approaches provide an effective paradigm for logistics companies to share benefit, achieve winwin situations through the horizontal cooperation, and improve the negotiation power for logistics network optimization.
Abstract: A two-echelon logistics joint distribution network optimization model is developed.This model is to minimize the total cost of TELJDN.A hybrid algorithm combining ACO and GA operations is proposed.A cooperative mechanism strategy for sequential coalitions is studied in TELJDN.An empirical study demonstrates the applicability of the proposed approach. Collaborative two-echelon logistics joint distribution network can be organized through a negotiation process via logistics service providers or participants existing in the logistics system, which can effectively reduce the crisscross transportation phenomenon and improve the efficiency of the urban freight transportation system. This study establishes a linear optimization model to minimize the total cost of two-echelon logistics joint distribution network. An improved ant colony optimization algorithm integrated with genetic algorithm is presented to serve customer clustering units and resolve the model formulation by assigning logistics facilities. A two-dimensional colony encoding method is adopted to generate the initial ant colonies. Improved ant colony optimization combines the merits of ant colony optimization algorithm and genetic algorithm with both global and local search capabilities. Finally, an improved Shapley value model based on cooperative game theory and a cooperative mechanism strategy are presented to obtain the optimal profit allocation scheme and sequential coalitions respectively in two-echelon logistics joint distribution network. An empirical study in Guiyang City, China, reveals that the improved ant colony optimization algorithm is superior to the other three methods in terms of the total cost. The improved Shapley value model and monotonic path selection strategy are applied to calculate the best sequential coalition selection strategy. The proposed cooperation and profit allocation approaches provide an effective paradigm for logistics companies to share benefit, achieve winwin situations through the horizontal cooperation, and improve the negotiation power for logistics network optimization.

88 citations


Journal ArticleDOI
TL;DR: With the probabilistic bus headway prediction information, transit riders can better schedule their trips to avoid late and early arrivals at bus stops, while transit operators can adopt the targeted correction actions to maintain regular headway for bus bunching prevention.
Abstract: Bus headway regularity heavily affects transit riders’ attitude for choosing public transportation and also serves as an important indicator for transit performance evaluation. Therefore, an accurate estimate of bus headway can benefit both transit riders and transit operators. This paper proposed a relevance vector machine (RVM) algorithm to predict bus headway by incorporating the time series of bus headways, travel time, and passenger demand at previous stops. Different from traditional computational intelligence approaches, RVM can output the probabilistic prediction result, in which the upper and lower bounds of a predicted headway within a certain probability are yielded. An empirical experiment with two bus routes in Beijing, China, is utilized to confirm the high precision and strong robustness of the proposed model. Five algorithms [support vector machine (SVM), genetic algorithm SVM, Kalman filter, k-nearest neighbor, and artificial neural network] are used for comparison with the RVM model and the result indicates that RVM outperforms these algorithms in terms of accuracy and confidence intervals. When the confidence level is set to 95%, more than 95% of actual bus headways fall within the prediction bands. With the probabilistic bus headway prediction information, transit riders can better schedule their trips to avoid late and early arrivals at bus stops, while transit operators can adopt the targeted correction actions to maintain regular headway for bus bunching prevention.

56 citations


Journal ArticleDOI
21 Sep 2017-Sensors
TL;DR: Copula-based models are proposed for the spatial interpolation of traffic flow from remote traffic microwave sensors and demonstrate significant potential to impute missing data in large-scale transportation networks.
Abstract: Issues of missing data have become increasingly serious with the rapid increase in usage of traffic sensors. Analyses of the Beijing ring expressway have showed that up to 50% of microwave sensors pose missing values. The imputation of missing traffic data must be urgently solved although a precise solution that cannot be easily achieved due to the significant number of missing portions. In this study, copula-based models are proposed for the spatial interpolation of traffic flow from remote traffic microwave sensors. Most existing interpolation methods only rely on covariance functions to depict spatial correlation and are unsuitable for coping with anomalies due to Gaussian consumption. Copula theory overcomes this issue and provides a connection between the correlation function and the marginal distribution function of traffic flow. To validate copula-based models, a comparison with three kriging methods is conducted. Results indicate that copula-based models outperform kriging methods, especially on roads with irregular traffic patterns. Copula-based models demonstrate significant potential to impute missing data in large-scale transportation networks.

Patent
29 Aug 2017
TL;DR: In this article, a method for identifying and predicting a bus passenger flow influence factor based on geographically and temporally weighted regression (GTWR) is proposed, which can deeply excavate an internal relation between the passenger flow and the land utilization, accurately predicts the bus passenger flows, and provides the scientific theoretical guidance for the bus line planning and operation management.
Abstract: The invention discloses a method for identifying and predicting a bus passenger flow influence factor based on geographically and temporally weighted regression (GTWR). The method comprises steps of: extracting a traffic zone hour bus passenger flow and calculating built environment density; 2, constructing a space-time three-dimensional coordinate system according to the time of a passenger flow observation point and latitude and longitude to calculate space-time distance, and reckoning a spatial regression weight matrix according to a Gaussian function and the distance; 3, calculating a relation between a passenger flow volume and land utilization under different space-time conditions based on the GTWR; and 4, obtaining a change of a relevant parameter to a coefficient according to the calculation to perform visualization processing in time and space, and analyzing an inherent law. The method takes account of the influence of a time factor on the bus passenger flow and the built environment relation, can deeply excavate an internal relation between the passenger flow and the land utilization, accurately predicts the bus passenger flow, and provides the scientific theoretical guidance for the bus line planning and operation management.