# Feature Selection and Model Fusion Approach for Predicting Urban Macro Travel Time

Authors: D. D. Li; D. X. Yu; Z. J. Qu; S. H. Yu
Journal: Mathematical Problems in Engineering
 (2020)

---

## Abstract

With the rapid growth of car ownership, traffic congestion has become one of the most serious social problems. For us, accurate real-time travel time predictions are especially important for easing traffic congestion, enabling traffic control and management, and traffic guidance. In this paper, we propose a method to predict urban road travel time by combining XGBoost and LightGBM machine learning models. In order to obtain a relatively complete data set, we mine the GPS data of Beijing and combine them with the weather feature to consider the obtained 14 features as candidate features. By processing and analyzing the data set, we discussed in detail the correlation between each feature and the travel time and the importance of each feature in the model prediction results. Finally, the 10 important features screened by the LightGBM and XGBoost models were used as key features. We use the full feature set and the key feature set as input to the model to explore the effect of different feature combinations on the prediction accuracy of the model and then compare the prediction results of the proposed fusion model with a single model. The results show that the proposed fusion model has great advantages to urban travel time prediction.


---

## Body

## 1. Introduction

Travel time is an important index of transportation management and the premise of traffic induction [1]. For city authorities, accurate travel time information can help develop better city management strategies and tools. For individual travelers, accurate travel time information can help them make better travel plans [2, 3], obtain the estimated arrival time, and replan the route or choose the best route according to personal preference so as to reach the destination faster. In terms of optimizing the road network, traffic conditions can be effectively improved and congestion can be effectively alleviated [4]. At the same time, it can also help public transportation (such as buses and trams) and freight service providers to better service planning and scheduling choices to improve service quality [5].Therefore, accurate travel time prediction has important practical significance and application value for alleviating urban traffic congestion, avoiding resource waste, and improving road network performance.With the popularization of GPS information collection technology and the improvement of data quality, it becomes possible to predict travel time by detecting data. By using the collected GPS positioning data, we obtain an extended and more comprehensive feature data set through in-depth mining. In combination with other feature data sets (such as weather and temperature), based on the analysis of travel time data features, we use the LightGBM model and XGBoost model to identify a series of key features and focus our research on features with high impact weight of travel time. Because a single model has different sensitivities to various data sets, we propose a method based on the fusion model to deal with the difference between the selected data features and the data set. By assigning different weights to different models, we can comprehensively study the data and fuse the advantages of each model.In this paper, we are going to elaborate on the research work and achievements as follows:(1)
We propose a multimodel fusion method that linearly weights two prediction models: XGBoost and LightGBM, to improve prediction performance. Through comparative verification, the fusion-based approach outperforms the other single-model-based solution.(2)
In view of the limited number of data feature samples in the original data set, we conduct in-depth mining of GPS and other data, so as to obtain extended multidimensional spatiotemporal features (such as turning times, intersection numbers, and driving trajectories) and to study various factors affecting travel time.(3)
Our prediction of travel time is not for a certain section of the road, but for the entire urban road network. The aim is to extract key features from a combination of multiple data features and predict the travel time required for driving.


## 2. Related Work

Travel time is one of the key indicators reflecting the state of road traffic and plays a vital role in traffic management and operation decisions. Therefore, a wide range of algorithms for travel time prediction had been presented in the literature.Existing travel time prediction methods can be roughly divided into two categories: one is an early statistical-based prediction method, and the other is a machine-learning-based prediction method. Inspired by statistics and travel time prediction requirements, many methods have been proposed in the literature, including the simple moving average method [6] and exponential smoothing method [7]. The latter is a linear model with a smoothing function over time, which is widely used in combination with sensor data. There are also methods based on Kalman filtering [8, 9], generalized autoregressive conditional heteroskedasticity (GARCH) model [10], and autoregressive integrated moving average (ARIMA) model [11]. Among them, the ARIMA model is widely used in highway traffic prediction research because of its good theoretical basis and prediction accuracy [12]. The statistical modeling methods in the above documents all assume that the data have a specific model structure. When the traffic flow changes regularly, it can get a good prediction effect according to its parameter changes. However, these methods cannot directly deal with data features of mixed types and need to transform and process multidimensional data features to be used as model input. Moreover, the model does not have a good processing method for data outliers and missing values, and the accuracy will be reduced for complex road networks.Most of the recent predictions of travel time have adopted machine learning methods [13, 14] including k-nearest neighbor (KNN) algorithms [15, 16], support vector machines [17], and neural networks [18, 19] model. Compared to earlier statistical prediction methods, machine learning models do not assume any specific model structure for the data, but treat it as unknown, which can handle complex problems and large amounts of data well. And because of the nonlinear characteristics of traffic flow, machine learning is generally more efficient and accurate than traditional statistical methods in travel time prediction methods. However, most machine learning models lack a reasonable interpretation of the results, which also limits their application to travel time to some extent.In recent years, with the emergence of data mining and improved machine learning models, tree-based integrated algorithms have been widely used in solving prediction and classification problems. Moreover, they have achieved good results in different fields, such as ecology [20], economics [21], bioinformatics [22, 23], and health care [24]; they are considered one of the most successful general-purpose algorithms in modern times. Rather than searching for the optimal single model, the tree-based integration algorithm can enhance the overall prediction capability by assembling multiple tree models [25], which can not only make efficient prediction but also identify and explain the interaction between data features. At the same time, it is not sensitive to monotone transformation of characteristic data input and is robust to missing value and outlier value. It can interact perfectly with feature data of mixed types and can fit complex nonlinear relationships [25]. These characteristics make the tree-based integration method good for the prediction of travel time.However, there are relatively few applications of tree-based integration methods in the field of transportation. Ma et al. [26] proposed a method to predict traffic accidents by using different data variables, and the predicted result was better than BP neural network, support vector machine, and random forest. However, the nonlinear relationship between the influence characteristics and the predicted value was not studied. Li [27] proposed based on random forest and gradient-enhanced regression tree model that the fitting effect of data features and different models was systematically studied, and data features were combined to predict travel time. However, GPS was not deeply mined, and data features were not extensive enough, resulting in a lack of universality. In order to improve the prediction accuracy of journey time, Cheng et al. [28] proposed a trip time prediction model based on the gradient boosting decision tree (GBDT) and predicted the journey time with high accuracy by exploring the key influencing variables. The prediction results of the single model will be affected by the selection of feature variables, but the article lacks instructions on the selection of feature variables.The above data-driven model is good at capturing the spatiotemporal relationship between data, widely used in predicting travel time methods, and has high accuracy. Similarly, with the development of artificial intelligence, the self-learning ability of deep learning can fully utilize the advantages of massive data and deeply explore the potential characteristics of traffic data. Among them, He et al. [29] use low-frequency detection vehicle data to identify the congestion of turning intersections in the road network and provide new ideas for the deep mining of road network traffic status data. Lin et al. [30] proposed a new graph convolutional neural network to predict the site-level hourly demand in a large-scale bicycle sharing network. Liu [31] proposes a heuristic feature selection method based on cohesion for short-term traffic flow prediction. The proposed feature selection method can reduce the prediction error in different scenarios, but the method only selects one variable in the objective function. Some other factors can be considered. Zhao et al. [32, 33] established an LSTM neural network model based on spatiotemporal characteristics, respectively, predicted traffic flow and travel speed, and obtained good prediction accuracy. The selection of features shown in the article is very important for the fitting results. If more useless features are selected, it will only increase the data redundancy and complexity, and the prediction effect may not increase but decrease.In order to better solve the above problems, we propose a method based on multimodel fusion, using different feature combinations, to study the travel time prediction performance through two popular decision tree integration methods: LightGBM and XGBoost. On the one hand, these two models are excellent in various prediction aspects and fields; on the other hand, LightGBM and XGBoost are both decision tree models with integrated frameworks.


## 3. The Study

### 3.1. XGBoost Model

XGBoost is an optimization algorithm for the boosting algorithm. It can turn a variety of weak feature classifiers into a strong classifier through an integrated algorithm. Its algorithm continuously improves the accuracy of the model by continuously superimposing and returning the residuals to resuperimpose. Therefore, the XGBoost algorithm can better predict the city travel time after processing a variety of features, reduce prediction errors, and obtain higher prediction accuracy.For a given sample training set withN samples and M characteristics K=xi,yii=1,2,…,N,xi∈RM,yi∈R, the XGBoost algorithm training process is an integrated model formed by adding K CART (classification and regression tree) functions, which is shown as follows:(1)y^i=∑t=1nftxi,ft∈F,where n is the number of trees, the set F is the set of all possible CARTs, ft is a function of the set F, y^i is the predicted value, and xi is the i-th input data. For each given sample, the XGBoost model obtains the final prediction value y^i by retaining t−1 rounds of model prediction in each iteration and adding a new function ftxi at the end. Its iterative process is as follows:(2)y^i0=0,y^i1=f1xi=y^i0+f1xi,⋮y^it=∑k=1tfkxi˙=y^it−1+ftxi.In order to measure the gap between the predicted value and the real value in machine learning, a loss function is defined to describe it, and the model is repeatedly trained to optimize the overall objective function. The objective function of the XGBoost model is as follows:(3)Objt=∑i=1nly,y^i+∑k=1KΩfk,(4)Ωfk=γT+12λ∑j=1Twj2.There are many kinds of objective functions. According to different types of problem solving, the self-loss functionly,y^i can choose mean square error function, logarithmic loss function, etc.Ωfk is the regularized penalty term, whose function is to prevent the overfitting phenomenon caused by too many leaf nodes. T is the number of leaves, wj is the weight of leaf nodes, γ is the punishment intensity, and λ is the parameter to ensure that the number of leaf nodes is not too large. Generally, λ=1, and only γ is adjusted.According to the defined objective function and loss function, the training samples can be used to train the XGBoost model. As mentioned above, equations (3) and (4) are the end of the model iterative update process, and then the objective function can be updated as(5)Jft=∑i=1nyi,y^it−1+ftxi+Ωft+C.In order to find the most suitable tree structureft to optimize the objective function and make it reach the optimal value, the loss function can be used to perform approximate processing on the Taylor second-order expansion at ft=0, so the objective function can be approximately expressed as(6)Objt=∑i=1nLyiy^it−1+giftxi+12hifi2xi+Ωft+C,where gi=∂y^it−1lyiy^it−1 and hi=∂2y^it−1lyiy^it−1 are the first and second derivatives of the self-loss function at the expansion point y^it−1, respectively; before the t-th iteration, the loss function ly,y^it−1 composed of the output y^it−1 and sample yi of CART function is a fixed value, and the change in its constant term C has no effect on the overall objective function. Therefore, the objective function can be simplified to(7)Obj′t=∑j=1T∑i∈Ijgiwj+12∑i∈Ijhi+λwj2+γT.Mapx to each corresponding leaf node, and then j can be defined as the sample set above each leaf node. wj is the weight of the newly established tree leaf, and the partial derivative of it can obtain the weight of the optimal leaf node as(8)wj∗=−GjHj+λ,where Gj=∑i∈Ijgi and Hj=∑i∈Ijhi,y on substituting wj∗ from the above equation into the objective function, the optimal objective function corresponding to the newly established tree can be obtained as(9)J′ft=12∑j=1TGj2Hj+λ+γT.J′ft obtained from the training can be used to measure the excellence of any new tree structure. The smaller the value is, the more the loss function of the model can be reduced by the tree structure established.


### 3.2. LightGBM Model

LightGBM (Light Gradient Boosting Machine) is a fast, distributed, high-performance gradient boosting framework based on decision tree algorithms. It is commonly used in sorting, classification, regression, and other machine learning experiments. LightGBM speeds up training and reduces memory usage by segmenting the values of successive features (attributes). Its main features are the decision tree algorithm using histogram and leaf-wise leaf growth strategy with depth limitation.


#### 3.2.1. The Histogram Algorithm

The basic idea of histogram algorithm is to discretize the continuous floating-point eigenvalues intok integers and construct a histogram of width k. While traversing the data, the discrete value is used as the index for traversal. After traversing the data once, the histogram counts the data quantities of various eigenvalues and then searches for the optimal segmentation point based on the discrete value of the histogram. This not only reduces the traversal complexity but also increases the running speed, as shown in Figure 1.Figure 1
Schematic diagram of histogram algorithm.


#### 3.2.2. Leaf-Wise Leaf Growth Strategy

Leaf-wise is a more efficient decision tree splitting strategy. Each time it splits, it finds the optimally split leaf in the cotyledon (usually the leaf with the largest amount of data) and then splits, and so on. Therefore, compared with the original decision tree splitting strategy, in the same process of finding the optimal splitting method, leaf-wise will reduce more time consumption and has a higher accuracy. The disadvantage of leaf-wise is that it may grow deeper decision trees and produce overfitting. Therefore, LightGBM adds a maximum depth limit to leaf-wise to ensure high efficiency while preventing overfitting. The splitting strategy is shown in Figure2. Green is the split maximum return leaf, and black is the nonsplit maximum return leaf.Figure 2
Leaf-wise leaf growth strategy.


### 3.3. Model Fusion

In Figure3, we use the idea of combining the advantages of the two models to fuse the models. Because each model has different sensitivities to different key features, different prediction results will be produced. In this paper, we assign weights to the respective prediction results of each model and make them cooperate with each other to bring greater advantages and eliminate disadvantages so that the model as a whole shows better robustness and universality.Figure 3
General solution framework.After obtaining the XGBoost and LightGBM prediction results through the two prediction methods described above, this paper uses the linear weighted fusion method in the following equation to optimize the prediction results:(10)predict=ω1⋅predictlgb+ω2⋅predictxgb.When weighting each model, because LightGBM has a more advanced leaf splitting strategy, partitioning occurs only at the node that has the most revenue, which improves the speed of decision tree construction and is more suitable for processing short-term travel time predictions, so it should be allocated higher weight value. At the same time, we explore the weights in depth and finally choose the inverse error method to determine the weights, as shown in the following equations:(11)ω1=ε2ε1+ε2,(12)ω2=ε1ε1+ε2,where ε1 and ε2 are the mean square errors of LightGBM and XGBoost. From equations (11) and (12) above, it can be seen that this method can reduce the overall error of the combined model by assigning a larger weight to the model with a relatively small error, so as to achieve the overall optimization of the model. Through relevant calculations and experiments, we give the final weight distribution and fusion model form, as follows:(13)predict=0.8×predictlgb+0.2×predictxgb.


## 3.1. XGBoost Model

XGBoost is an optimization algorithm for the boosting algorithm. It can turn a variety of weak feature classifiers into a strong classifier through an integrated algorithm. Its algorithm continuously improves the accuracy of the model by continuously superimposing and returning the residuals to resuperimpose. Therefore, the XGBoost algorithm can better predict the city travel time after processing a variety of features, reduce prediction errors, and obtain higher prediction accuracy.For a given sample training set withN samples and M characteristics K=xi,yii=1,2,…,N,xi∈RM,yi∈R, the XGBoost algorithm training process is an integrated model formed by adding K CART (classification and regression tree) functions, which is shown as follows:(1)y^i=∑t=1nftxi,ft∈F,where n is the number of trees, the set F is the set of all possible CARTs, ft is a function of the set F, y^i is the predicted value, and xi is the i-th input data. For each given sample, the XGBoost model obtains the final prediction value y^i by retaining t−1 rounds of model prediction in each iteration and adding a new function ftxi at the end. Its iterative process is as follows:(2)y^i0=0,y^i1=f1xi=y^i0+f1xi,⋮y^it=∑k=1tfkxi˙=y^it−1+ftxi.In order to measure the gap between the predicted value and the real value in machine learning, a loss function is defined to describe it, and the model is repeatedly trained to optimize the overall objective function. The objective function of the XGBoost model is as follows:(3)Objt=∑i=1nly,y^i+∑k=1KΩfk,(4)Ωfk=γT+12λ∑j=1Twj2.There are many kinds of objective functions. According to different types of problem solving, the self-loss functionly,y^i can choose mean square error function, logarithmic loss function, etc.Ωfk is the regularized penalty term, whose function is to prevent the overfitting phenomenon caused by too many leaf nodes. T is the number of leaves, wj is the weight of leaf nodes, γ is the punishment intensity, and λ is the parameter to ensure that the number of leaf nodes is not too large. Generally, λ=1, and only γ is adjusted.According to the defined objective function and loss function, the training samples can be used to train the XGBoost model. As mentioned above, equations (3) and (4) are the end of the model iterative update process, and then the objective function can be updated as(5)Jft=∑i=1nyi,y^it−1+ftxi+Ωft+C.In order to find the most suitable tree structureft to optimize the objective function and make it reach the optimal value, the loss function can be used to perform approximate processing on the Taylor second-order expansion at ft=0, so the objective function can be approximately expressed as(6)Objt=∑i=1nLyiy^it−1+giftxi+12hifi2xi+Ωft+C,where gi=∂y^it−1lyiy^it−1 and hi=∂2y^it−1lyiy^it−1 are the first and second derivatives of the self-loss function at the expansion point y^it−1, respectively; before the t-th iteration, the loss function ly,y^it−1 composed of the output y^it−1 and sample yi of CART function is a fixed value, and the change in its constant term C has no effect on the overall objective function. Therefore, the objective function can be simplified to(7)Obj′t=∑j=1T∑i∈Ijgiwj+12∑i∈Ijhi+λwj2+γT.Mapx to each corresponding leaf node, and then j can be defined as the sample set above each leaf node. wj is the weight of the newly established tree leaf, and the partial derivative of it can obtain the weight of the optimal leaf node as(8)wj∗=−GjHj+λ,where Gj=∑i∈Ijgi and Hj=∑i∈Ijhi,y on substituting wj∗ from the above equation into the objective function, the optimal objective function corresponding to the newly established tree can be obtained as(9)J′ft=12∑j=1TGj2Hj+λ+γT.J′ft obtained from the training can be used to measure the excellence of any new tree structure. The smaller the value is, the more the loss function of the model can be reduced by the tree structure established.


## 3.2. LightGBM Model

LightGBM (Light Gradient Boosting Machine) is a fast, distributed, high-performance gradient boosting framework based on decision tree algorithms. It is commonly used in sorting, classification, regression, and other machine learning experiments. LightGBM speeds up training and reduces memory usage by segmenting the values of successive features (attributes). Its main features are the decision tree algorithm using histogram and leaf-wise leaf growth strategy with depth limitation.


### 3.2.1. The Histogram Algorithm

The basic idea of histogram algorithm is to discretize the continuous floating-point eigenvalues intok integers and construct a histogram of width k. While traversing the data, the discrete value is used as the index for traversal. After traversing the data once, the histogram counts the data quantities of various eigenvalues and then searches for the optimal segmentation point based on the discrete value of the histogram. This not only reduces the traversal complexity but also increases the running speed, as shown in Figure 1.Figure 1
Schematic diagram of histogram algorithm.


### 3.2.2. Leaf-Wise Leaf Growth Strategy

Leaf-wise is a more efficient decision tree splitting strategy. Each time it splits, it finds the optimally split leaf in the cotyledon (usually the leaf with the largest amount of data) and then splits, and so on. Therefore, compared with the original decision tree splitting strategy, in the same process of finding the optimal splitting method, leaf-wise will reduce more time consumption and has a higher accuracy. The disadvantage of leaf-wise is that it may grow deeper decision trees and produce overfitting. Therefore, LightGBM adds a maximum depth limit to leaf-wise to ensure high efficiency while preventing overfitting. The splitting strategy is shown in Figure2. Green is the split maximum return leaf, and black is the nonsplit maximum return leaf.Figure 2
Leaf-wise leaf growth strategy.


## 3.2.1. The Histogram Algorithm

The basic idea of histogram algorithm is to discretize the continuous floating-point eigenvalues intok integers and construct a histogram of width k. While traversing the data, the discrete value is used as the index for traversal. After traversing the data once, the histogram counts the data quantities of various eigenvalues and then searches for the optimal segmentation point based on the discrete value of the histogram. This not only reduces the traversal complexity but also increases the running speed, as shown in Figure 1.Figure 1
Schematic diagram of histogram algorithm.


## 3.2.2. Leaf-Wise Leaf Growth Strategy

Leaf-wise is a more efficient decision tree splitting strategy. Each time it splits, it finds the optimally split leaf in the cotyledon (usually the leaf with the largest amount of data) and then splits, and so on. Therefore, compared with the original decision tree splitting strategy, in the same process of finding the optimal splitting method, leaf-wise will reduce more time consumption and has a higher accuracy. The disadvantage of leaf-wise is that it may grow deeper decision trees and produce overfitting. Therefore, LightGBM adds a maximum depth limit to leaf-wise to ensure high efficiency while preventing overfitting. The splitting strategy is shown in Figure2. Green is the split maximum return leaf, and black is the nonsplit maximum return leaf.Figure 2
Leaf-wise leaf growth strategy.


## 3.3. Model Fusion

In Figure3, we use the idea of combining the advantages of the two models to fuse the models. Because each model has different sensitivities to different key features, different prediction results will be produced. In this paper, we assign weights to the respective prediction results of each model and make them cooperate with each other to bring greater advantages and eliminate disadvantages so that the model as a whole shows better robustness and universality.Figure 3
General solution framework.After obtaining the XGBoost and LightGBM prediction results through the two prediction methods described above, this paper uses the linear weighted fusion method in the following equation to optimize the prediction results:(10)predict=ω1⋅predictlgb+ω2⋅predictxgb.When weighting each model, because LightGBM has a more advanced leaf splitting strategy, partitioning occurs only at the node that has the most revenue, which improves the speed of decision tree construction and is more suitable for processing short-term travel time predictions, so it should be allocated higher weight value. At the same time, we explore the weights in depth and finally choose the inverse error method to determine the weights, as shown in the following equations:(11)ω1=ε2ε1+ε2,(12)ω2=ε1ε1+ε2,where ε1 and ε2 are the mean square errors of LightGBM and XGBoost. From equations (11) and (12) above, it can be seen that this method can reduce the overall error of the combined model by assigning a larger weight to the model with a relatively small error, so as to achieve the overall optimization of the model. Through relevant calculations and experiments, we give the final weight distribution and fusion model form, as follows:(13)predict=0.8×predictlgb+0.2×predictxgb.


## 4. Results and Discussion

### 4.1. Data Exploration and Analysis

In this paper, the GPS data of 11.63 million vehicles for 11 days from December 10 to 20, 2018, in Beijing are used as the basic data. The original GPS data points are matched with the actual map to filter out the required GPS of 8.56 million vehicles. Data set covers daily scoring and peak hours, which can meet the needs of analysis. By matching the data points with the actual road network, we can eliminate redundant points with errors (points that are not in the actual road network or do not match the actual research location). The effect of combining with the actual road network after screening is shown in Figure4.Figure 4
GPS data combined with road network map.The GPS data of the same ID vehicle were collected 3–5 times in the original data set. Some data fields from the initial data set are shown in following Table1. Among them, ID is the vehicle number, and the location speed is the instantaneous speed of the vehicle at the time of reception, and the unit is km/h. Since the spot speed is accidental, we introduce the average value of the speed of the location measured by all GPS points of the same vehicle-mean spot speed for research.Table 1
GPS initial data set.
IDLongitudeLatitudeSpot speedTraveling directionReceipt timeVehicle type42468616724116.610440040.510890046525:56:13242468616724116.613090040.512340044525:57:35242468616724116.615390040.513640036525:59:57241675202048116.402720039.16431001205:56:02241675202048116.402720039.1688199283585:58:24241675202048116.412670039.1735600403585:59:46242468116615116.930900039.629080048885:56:08242468116615116.932210039.629130024825:57:29242468116615116.932500039.63098005605:59:492……………………………………The unit of the driving direction is degree, the due north is 0, it increases clockwise, and the value range is [0,360). The travel time required in this paper can be obtained by calculating the time difference value between the reception time of the first GPS point and the last GPS point detected by the vehicle. Vehicle type 2 is represented as a passenger car.


#### 4.1.1. Driving Feature Mining

Through the analysis of the article above, we can see that the data features directly obtained from GPS data are relatively limited, which requires further mining and analysis. In this article, we map the multiple point data collected from the same vehicle to the actual road network to obtain data characteristics such as the number of turns, the number of intersections passed, and driving directions. As shown in Figure5(a), D1, D2, and D3 are the mappings of three consecutive GPS points in the actual road network measured by the same vehicle during the detection time. According to the detection time, the driving path direction can be analyzed as D1⟶D2⟶D3, the number of crossings is 4, and the number of turns is 3. Similarly, the detection direction of the vehicle in Figure 5(b) is D4⟶D5⟶D6, the number of passing intersections is 4, and the number of turns is 4.Figure 5
GPS points and roads combination diagram.
(a)(b)In order to match the driving conditions of the vehicle on the current road section and the degree of congestion on the road section, we combine the traffic flow in the road section where the vehicle is driving in the same time period as above. Through mining the GPS data above and combining it with the actual road network, we can also obtain the relevant characteristic variables such as the length of the driving section, space occupancy, and density. The data set after data mining is shown in Table2.Table 2
Data set after data mining.
IDSpot speedMean spot speedTraveling directionVehicle typeDensitySpace occupancy…4246861672475535220.070.23…4246861672476375220.090.62…4246861672438385220.140.48…416752020485142020.120.3…41675202048414535820.110.3…41675202048572835820.170.46…4246811661556288820.140.43…4246811661577408220.130.91…424681166159043020.080.25……………………


#### 4.1.2. Weather and Temperature Characteristics

In order to obtain a more comprehensive data set of influencing factors, we considered driving characteristics data and obtained weather, temperature, and other information of Beijing from December 10 to 20, 2018, through investigation. After this, we added it as the feature information of travel time prediction to the feature sequence, as shown in Table3.Table 3
Weather feature data set.
Datadwcnwcdtvntvdwindsnwinds2018.12.10CloudySunny70Northeast wind force 1∼2Northeast wind force 1∼22018.12.11CloudySunny82Northeast wind force 1∼2Northeasterly breeze2018.12.12FogCloudy8−3Northeast wind force 3∼4Northeast wind force 32018.12.13SunnySunny4−6Northwest wind force 1∼2Northwesterly breeze2018.12.14RainCloudy0−4Southwesterly breezeSouthwesterly breeze2018.12.15FogSunny−2−9Northwest wind force 3∼4Northwest wind force 3∼42018.12.16SunnyCloudy−5−10Northwest wind force 3∼4Northwesterly breeze2018.12.17SunnySunny−2−10Southwest wind force 2∼3Southwesterly breeze2018.12.18CloudySunny−1−10Southeast wind force 1∼2Southeasterly breeze2018.12.19CloudySunny0−7Northeast wind force 1∼2Northeast wind force 1∼22018.12.20SunnyCloudy−1−10Northwest wind force 2∼3Northwesterly breezeTable4 divides the weather characteristics into 6 fields, where dwc represents the weather condition from 6:00 to 18:00, nwc represents the weather condition from 18:00 to 6:00 the next day, and dtv represents the temperature from 6:00 to 18:00. The value of ntv represents the value of temperature from 18:00 to 6:00 the next day; dwinds represents the wind direction and wind speed from 6:00 to 18:00, and nwinds represents the wind direction and wind speed from 18:00 to 6:00 the next day.In this paper, we combine the driving feature data based on GPS data mining with weather and temperature feature data as the feature input data for this experiment. In order to explore the correlation between travel time and each data feature in the above data set and further explore the relationship between each data feature, we draw a corresponding scatter plot based on the data distribution (Figure6). From the scatter plots between the various data features, we can find that there is a potential logarithmic relationship between density and average location speed, and the cumulative trends of the vehicle, density, and average location speed data are close to the parabola. Traffic flow, location speed, and average location speed are the abscissa; the curve shape of the cumulative frequency histogram can be deduced from the data volume distribution, which should also conform to the Poisson distribution, and initially confirms that the data source has a certain reliability. Since the data without processing have outliers and missing values, the scatter plot of related features alone cannot well analyze the criticality of each feature in the prediction model, so we need to analyze it further.Figure 6
Interfeature relationship exploration map.


### 4.2. Data Processing and Feature Extraction

#### 4.2.1. Data Preprocessing

From the above analysis, we can know that the original data have outliers and missing values, so the scatter plots of related features cannot well analyze the criticality of each feature to the prediction model. For these two types of abnormal data, we use the corresponding methods to deal with them. In this article, we use the idea of box plots (Figures7(a) and 7(b)) to deal with the outliers of the data. From Figures 7(a) and 7(b), we can see that the data distribution of the travel time is more scattered. And through the box plot of density, traffic volume, and average location speed, we can find that the data distribution is more scattered. If we use the box plot method to delete the value 1.5QR higher than the upper score or 1.5QR lower than the lower quantile, some real values that can be used for prediction will be deleted by mistake, which will reduce the robustness of the model. Therefore, we set thresholds for this type of data to remove unreasonable values and set them to null values. Finally, we use data filling methods to supplement missing and null values.Figure 7
The boxplot of feature values.
(a)(b)Common missing value processing methods can be divided into several categories. The first type: when the number of missing data is greater than 35%, the feature column can be deleted. The second type: for a feature that lacks a single piece of data, the random forest model can be trained with the part without missing values in the feature, and then, the missing data can be filled. The third type: in certain feature data, a single value is intermittently missing, and we can linearly interpolate the corresponding feature to fill the missing value, as follows:(14)y=y0+y1−y0x1−x0x−x0.In equation (14), y0,y,y1 is a series of data points arranged in ascending order from time to time, which is the previous point closest to the missing point y in time and x0 is the corresponding time point. Similarly, y1 is the next point closest to y in time and x1 is the corresponding time point.After preprocessing the data, the obtained characteristic data table is shown in Table4. We can see that most of the data are more in line with the actual data trend, thus completing the work on data screening and processing, and this feature data table is used as an example of a training/test file for the model.Table 4
Example of the training/testing data file.
Spot speedMean spot speedDensitySpace occupancyTraveling directionNumber of intersectionsNumber of turningTraffic flow…75530.070.2335143355…76370.090.6232543349…38380.140.4834443487…51420.120.38142452…41450.110.335775369…57280.170.2515454421…………………………


#### 4.2.2. Analysis of Key Features

Different models generally use different methods to judge the importance of each data feature on the prediction result. For example, LightGBM is different from the traditional method of category splitting. It uses the “many vs many” splitting method and reclassifies the categories according to the relevance of the training target. More specifically, the category features can be considered discretized. For subfeatures, LightGBM reorders each subfeature according to the weight and then selects the optimal segmentation point. XGBoost, on the other hand, uses the average gain of each feature to evaluate the importance of the feature. If the average gain is higher, the feature is more important.Figures8 and 9 show that the LightGBM and XGBoost models are ranked according to the importance of data features. Both models point out that the most critical feature is the mean spot speed. From the overall analysis, it can be seen that the spatial features such as traffic flow, density, driving direction, and space occupancy have a stronger impact on the overall forecast. In contrast, environmental features such as weather conditions and temperature have less impact.Figure 8
Critical features of LightGBM model. The features are listed in top-down order.Figure 9
Critical features of XGBoost model. The features are listed in top-down order.In addition, the recorded value of travel time in this article varies between 4 and 11 min, which is a short-term prediction. Therefore, the volatility of the data may have a certain impact on the weight of the data features. Features such as mean spot speed, traffic flow, and driving direction that have large numerical fluctuations will have a greater impact on the prediction of travel time. Conversely, features such as number of intersections, number of turns, and weather conditions have less numerical fluctuations. The prediction of travel time will have a smaller effect.


#### 4.2.3. Comparative Analysis of Model Prediction Results

In this paper, we choose root mean square error (RMSE), mean absolute error (MAE), mean absolute percentage error (MAPE), and symmetric mean absolute percentage error (SMAPE) as the evaluation indicators for this experiment. They all obey the same rule: when the predicted value completely matches the true value, the error is zero, and the model predicts the best effect; the larger the error, the larger the calculated value.The definition and formula of each indicator are as follows:Predictive value:y^=y^1,y^2,…,y^nActual value:y=y1,y2,…,ynRoot mean square error (RMSE):(15)RMSE=1n∑i=1ny^i−yi2.Mean absolute error (MAE):(16)MAE=1n∑i=1ny^i−yi.Mean absolute percentage error (MAPE):(17)MAPE=100%n∑i=1ny^i−yiyi.Symmetric mean absolute percentage error (SMAPE):(18)SMAPE=100%n∑i=1ny^i−yiy^i+yi/2.When verifying the results, the data of December 10–18 of the data set are used as the training set for the model, and the data of December 19–21 are used as the test set for the model. In the training process, the traditional GBDT model was added as a comparison, and the early termination strategy was adopted to prevent the occurrence of overfitting. In order to further verify whether different combinations of key features will affect the final prediction results of the model, we choose two different feature input schemes. The first scheme uses all data features as the input to the model, and the prediction evaluation results are shown in Table5. In the second scheme, XGBoost and LightGBM in Figures 8 and 9 are deleted according to the last two of data feature importance, and the remaining 11 key features are taken as model input for prediction. After prediction, the evaluation results are shown in Table 6.Table 5
Evaluation results with all features as model inputs.
SMAPEMAPERMSEMAEGBDT3.76953.93170.42770.2483XGBoost3.74813.93940.44510.2490LightGBM3.30523.33050.32330.2167Model fusion3.26513.31480.31890.2144Table 6
The evaluation results of key features as input to the model.
SMAPEMAPERMSEMAEGBDT3.73323.91180.42950.2482XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133We can see that, under many indicators, the LightGBM model can obtain better prediction results, and the fusion model combining XGBoost and LightGBM can further improve the previous prediction results.In addition, we also found that the prediction effect of the three models on all data feature inputs was not ideal, but the prediction accuracy was significantly improved when only the key features were taken as input. We believe that the redundant data features have low volatility and a single value (such as weather conditions, only sunny, cloudy, fog, and rain), which cannot describe the travel time well and in the complex and useless data stack characteristics under the strategy of the integration of too complex, often produced the phenomenon of fitting. In contrast, choosing a large number of key features as the input for model prediction is a more favorable choice, and it is also suitable for dealing with the prediction problem in this paper.At the same time, in order to verify the effectiveness of the model, this paper introduces the LSTM neural network model for comparative experiments [33]. The data from December 10–18 are used as the training set of the model, and the data from December 19–21 are used as the test set of the model. The data set is divided at 5 min intervals, and the average travel time of all vehicles within 5 min is taken as the input of the model, as shown in Table 7. The evaluation results after prediction are shown in Table 8.Table 7
Comparison of various models.
ID1234567…Average travel time (min)5.6465.1035.6735.1935.2945.5434.726…Table 8
Comparison of various models.
SMAPEMAPERMSEMAELSTM9.765211.15532.09841.2541XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133Compared with other models, the LSTM model has poor prediction effect. We believe that because only the average travel time is selected as the model input and the multivariable input method is used, the prediction effect may be improved. At the same time, the average travel time selected as input in this paper is relatively macro; if the travel time of a single or partial road segment is predicted, the effect may be better.


## 4.1. Data Exploration and Analysis

In this paper, the GPS data of 11.63 million vehicles for 11 days from December 10 to 20, 2018, in Beijing are used as the basic data. The original GPS data points are matched with the actual map to filter out the required GPS of 8.56 million vehicles. Data set covers daily scoring and peak hours, which can meet the needs of analysis. By matching the data points with the actual road network, we can eliminate redundant points with errors (points that are not in the actual road network or do not match the actual research location). The effect of combining with the actual road network after screening is shown in Figure4.Figure 4
GPS data combined with road network map.The GPS data of the same ID vehicle were collected 3–5 times in the original data set. Some data fields from the initial data set are shown in following Table1. Among them, ID is the vehicle number, and the location speed is the instantaneous speed of the vehicle at the time of reception, and the unit is km/h. Since the spot speed is accidental, we introduce the average value of the speed of the location measured by all GPS points of the same vehicle-mean spot speed for research.Table 1
GPS initial data set.
IDLongitudeLatitudeSpot speedTraveling directionReceipt timeVehicle type42468616724116.610440040.510890046525:56:13242468616724116.613090040.512340044525:57:35242468616724116.615390040.513640036525:59:57241675202048116.402720039.16431001205:56:02241675202048116.402720039.1688199283585:58:24241675202048116.412670039.1735600403585:59:46242468116615116.930900039.629080048885:56:08242468116615116.932210039.629130024825:57:29242468116615116.932500039.63098005605:59:492……………………………………The unit of the driving direction is degree, the due north is 0, it increases clockwise, and the value range is [0,360). The travel time required in this paper can be obtained by calculating the time difference value between the reception time of the first GPS point and the last GPS point detected by the vehicle. Vehicle type 2 is represented as a passenger car.


### 4.1.1. Driving Feature Mining

Through the analysis of the article above, we can see that the data features directly obtained from GPS data are relatively limited, which requires further mining and analysis. In this article, we map the multiple point data collected from the same vehicle to the actual road network to obtain data characteristics such as the number of turns, the number of intersections passed, and driving directions. As shown in Figure5(a), D1, D2, and D3 are the mappings of three consecutive GPS points in the actual road network measured by the same vehicle during the detection time. According to the detection time, the driving path direction can be analyzed as D1⟶D2⟶D3, the number of crossings is 4, and the number of turns is 3. Similarly, the detection direction of the vehicle in Figure 5(b) is D4⟶D5⟶D6, the number of passing intersections is 4, and the number of turns is 4.Figure 5
GPS points and roads combination diagram.
(a)(b)In order to match the driving conditions of the vehicle on the current road section and the degree of congestion on the road section, we combine the traffic flow in the road section where the vehicle is driving in the same time period as above. Through mining the GPS data above and combining it with the actual road network, we can also obtain the relevant characteristic variables such as the length of the driving section, space occupancy, and density. The data set after data mining is shown in Table2.Table 2
Data set after data mining.
IDSpot speedMean spot speedTraveling directionVehicle typeDensitySpace occupancy…4246861672475535220.070.23…4246861672476375220.090.62…4246861672438385220.140.48…416752020485142020.120.3…41675202048414535820.110.3…41675202048572835820.170.46…4246811661556288820.140.43…4246811661577408220.130.91…424681166159043020.080.25……………………


### 4.1.2. Weather and Temperature Characteristics

In order to obtain a more comprehensive data set of influencing factors, we considered driving characteristics data and obtained weather, temperature, and other information of Beijing from December 10 to 20, 2018, through investigation. After this, we added it as the feature information of travel time prediction to the feature sequence, as shown in Table3.Table 3
Weather feature data set.
Datadwcnwcdtvntvdwindsnwinds2018.12.10CloudySunny70Northeast wind force 1∼2Northeast wind force 1∼22018.12.11CloudySunny82Northeast wind force 1∼2Northeasterly breeze2018.12.12FogCloudy8−3Northeast wind force 3∼4Northeast wind force 32018.12.13SunnySunny4−6Northwest wind force 1∼2Northwesterly breeze2018.12.14RainCloudy0−4Southwesterly breezeSouthwesterly breeze2018.12.15FogSunny−2−9Northwest wind force 3∼4Northwest wind force 3∼42018.12.16SunnyCloudy−5−10Northwest wind force 3∼4Northwesterly breeze2018.12.17SunnySunny−2−10Southwest wind force 2∼3Southwesterly breeze2018.12.18CloudySunny−1−10Southeast wind force 1∼2Southeasterly breeze2018.12.19CloudySunny0−7Northeast wind force 1∼2Northeast wind force 1∼22018.12.20SunnyCloudy−1−10Northwest wind force 2∼3Northwesterly breezeTable4 divides the weather characteristics into 6 fields, where dwc represents the weather condition from 6:00 to 18:00, nwc represents the weather condition from 18:00 to 6:00 the next day, and dtv represents the temperature from 6:00 to 18:00. The value of ntv represents the value of temperature from 18:00 to 6:00 the next day; dwinds represents the wind direction and wind speed from 6:00 to 18:00, and nwinds represents the wind direction and wind speed from 18:00 to 6:00 the next day.In this paper, we combine the driving feature data based on GPS data mining with weather and temperature feature data as the feature input data for this experiment. In order to explore the correlation between travel time and each data feature in the above data set and further explore the relationship between each data feature, we draw a corresponding scatter plot based on the data distribution (Figure6). From the scatter plots between the various data features, we can find that there is a potential logarithmic relationship between density and average location speed, and the cumulative trends of the vehicle, density, and average location speed data are close to the parabola. Traffic flow, location speed, and average location speed are the abscissa; the curve shape of the cumulative frequency histogram can be deduced from the data volume distribution, which should also conform to the Poisson distribution, and initially confirms that the data source has a certain reliability. Since the data without processing have outliers and missing values, the scatter plot of related features alone cannot well analyze the criticality of each feature in the prediction model, so we need to analyze it further.Figure 6
Interfeature relationship exploration map.


## 4.1.1. Driving Feature Mining

Through the analysis of the article above, we can see that the data features directly obtained from GPS data are relatively limited, which requires further mining and analysis. In this article, we map the multiple point data collected from the same vehicle to the actual road network to obtain data characteristics such as the number of turns, the number of intersections passed, and driving directions. As shown in Figure5(a), D1, D2, and D3 are the mappings of three consecutive GPS points in the actual road network measured by the same vehicle during the detection time. According to the detection time, the driving path direction can be analyzed as D1⟶D2⟶D3, the number of crossings is 4, and the number of turns is 3. Similarly, the detection direction of the vehicle in Figure 5(b) is D4⟶D5⟶D6, the number of passing intersections is 4, and the number of turns is 4.Figure 5
GPS points and roads combination diagram.
(a)(b)In order to match the driving conditions of the vehicle on the current road section and the degree of congestion on the road section, we combine the traffic flow in the road section where the vehicle is driving in the same time period as above. Through mining the GPS data above and combining it with the actual road network, we can also obtain the relevant characteristic variables such as the length of the driving section, space occupancy, and density. The data set after data mining is shown in Table2.Table 2
Data set after data mining.
IDSpot speedMean spot speedTraveling directionVehicle typeDensitySpace occupancy…4246861672475535220.070.23…4246861672476375220.090.62…4246861672438385220.140.48…416752020485142020.120.3…41675202048414535820.110.3…41675202048572835820.170.46…4246811661556288820.140.43…4246811661577408220.130.91…424681166159043020.080.25……………………


## 4.1.2. Weather and Temperature Characteristics

In order to obtain a more comprehensive data set of influencing factors, we considered driving characteristics data and obtained weather, temperature, and other information of Beijing from December 10 to 20, 2018, through investigation. After this, we added it as the feature information of travel time prediction to the feature sequence, as shown in Table3.Table 3
Weather feature data set.
Datadwcnwcdtvntvdwindsnwinds2018.12.10CloudySunny70Northeast wind force 1∼2Northeast wind force 1∼22018.12.11CloudySunny82Northeast wind force 1∼2Northeasterly breeze2018.12.12FogCloudy8−3Northeast wind force 3∼4Northeast wind force 32018.12.13SunnySunny4−6Northwest wind force 1∼2Northwesterly breeze2018.12.14RainCloudy0−4Southwesterly breezeSouthwesterly breeze2018.12.15FogSunny−2−9Northwest wind force 3∼4Northwest wind force 3∼42018.12.16SunnyCloudy−5−10Northwest wind force 3∼4Northwesterly breeze2018.12.17SunnySunny−2−10Southwest wind force 2∼3Southwesterly breeze2018.12.18CloudySunny−1−10Southeast wind force 1∼2Southeasterly breeze2018.12.19CloudySunny0−7Northeast wind force 1∼2Northeast wind force 1∼22018.12.20SunnyCloudy−1−10Northwest wind force 2∼3Northwesterly breezeTable4 divides the weather characteristics into 6 fields, where dwc represents the weather condition from 6:00 to 18:00, nwc represents the weather condition from 18:00 to 6:00 the next day, and dtv represents the temperature from 6:00 to 18:00. The value of ntv represents the value of temperature from 18:00 to 6:00 the next day; dwinds represents the wind direction and wind speed from 6:00 to 18:00, and nwinds represents the wind direction and wind speed from 18:00 to 6:00 the next day.In this paper, we combine the driving feature data based on GPS data mining with weather and temperature feature data as the feature input data for this experiment. In order to explore the correlation between travel time and each data feature in the above data set and further explore the relationship between each data feature, we draw a corresponding scatter plot based on the data distribution (Figure6). From the scatter plots between the various data features, we can find that there is a potential logarithmic relationship between density and average location speed, and the cumulative trends of the vehicle, density, and average location speed data are close to the parabola. Traffic flow, location speed, and average location speed are the abscissa; the curve shape of the cumulative frequency histogram can be deduced from the data volume distribution, which should also conform to the Poisson distribution, and initially confirms that the data source has a certain reliability. Since the data without processing have outliers and missing values, the scatter plot of related features alone cannot well analyze the criticality of each feature in the prediction model, so we need to analyze it further.Figure 6
Interfeature relationship exploration map.


## 4.2. Data Processing and Feature Extraction

### 4.2.1. Data Preprocessing

From the above analysis, we can know that the original data have outliers and missing values, so the scatter plots of related features cannot well analyze the criticality of each feature to the prediction model. For these two types of abnormal data, we use the corresponding methods to deal with them. In this article, we use the idea of box plots (Figures7(a) and 7(b)) to deal with the outliers of the data. From Figures 7(a) and 7(b), we can see that the data distribution of the travel time is more scattered. And through the box plot of density, traffic volume, and average location speed, we can find that the data distribution is more scattered. If we use the box plot method to delete the value 1.5QR higher than the upper score or 1.5QR lower than the lower quantile, some real values that can be used for prediction will be deleted by mistake, which will reduce the robustness of the model. Therefore, we set thresholds for this type of data to remove unreasonable values and set them to null values. Finally, we use data filling methods to supplement missing and null values.Figure 7
The boxplot of feature values.
(a)(b)Common missing value processing methods can be divided into several categories. The first type: when the number of missing data is greater than 35%, the feature column can be deleted. The second type: for a feature that lacks a single piece of data, the random forest model can be trained with the part without missing values in the feature, and then, the missing data can be filled. The third type: in certain feature data, a single value is intermittently missing, and we can linearly interpolate the corresponding feature to fill the missing value, as follows:(14)y=y0+y1−y0x1−x0x−x0.In equation (14), y0,y,y1 is a series of data points arranged in ascending order from time to time, which is the previous point closest to the missing point y in time and x0 is the corresponding time point. Similarly, y1 is the next point closest to y in time and x1 is the corresponding time point.After preprocessing the data, the obtained characteristic data table is shown in Table4. We can see that most of the data are more in line with the actual data trend, thus completing the work on data screening and processing, and this feature data table is used as an example of a training/test file for the model.Table 4
Example of the training/testing data file.
Spot speedMean spot speedDensitySpace occupancyTraveling directionNumber of intersectionsNumber of turningTraffic flow…75530.070.2335143355…76370.090.6232543349…38380.140.4834443487…51420.120.38142452…41450.110.335775369…57280.170.2515454421…………………………


### 4.2.2. Analysis of Key Features

Different models generally use different methods to judge the importance of each data feature on the prediction result. For example, LightGBM is different from the traditional method of category splitting. It uses the “many vs many” splitting method and reclassifies the categories according to the relevance of the training target. More specifically, the category features can be considered discretized. For subfeatures, LightGBM reorders each subfeature according to the weight and then selects the optimal segmentation point. XGBoost, on the other hand, uses the average gain of each feature to evaluate the importance of the feature. If the average gain is higher, the feature is more important.Figures8 and 9 show that the LightGBM and XGBoost models are ranked according to the importance of data features. Both models point out that the most critical feature is the mean spot speed. From the overall analysis, it can be seen that the spatial features such as traffic flow, density, driving direction, and space occupancy have a stronger impact on the overall forecast. In contrast, environmental features such as weather conditions and temperature have less impact.Figure 8
Critical features of LightGBM model. The features are listed in top-down order.Figure 9
Critical features of XGBoost model. The features are listed in top-down order.In addition, the recorded value of travel time in this article varies between 4 and 11 min, which is a short-term prediction. Therefore, the volatility of the data may have a certain impact on the weight of the data features. Features such as mean spot speed, traffic flow, and driving direction that have large numerical fluctuations will have a greater impact on the prediction of travel time. Conversely, features such as number of intersections, number of turns, and weather conditions have less numerical fluctuations. The prediction of travel time will have a smaller effect.


### 4.2.3. Comparative Analysis of Model Prediction Results

In this paper, we choose root mean square error (RMSE), mean absolute error (MAE), mean absolute percentage error (MAPE), and symmetric mean absolute percentage error (SMAPE) as the evaluation indicators for this experiment. They all obey the same rule: when the predicted value completely matches the true value, the error is zero, and the model predicts the best effect; the larger the error, the larger the calculated value.The definition and formula of each indicator are as follows:Predictive value:y^=y^1,y^2,…,y^nActual value:y=y1,y2,…,ynRoot mean square error (RMSE):(15)RMSE=1n∑i=1ny^i−yi2.Mean absolute error (MAE):(16)MAE=1n∑i=1ny^i−yi.Mean absolute percentage error (MAPE):(17)MAPE=100%n∑i=1ny^i−yiyi.Symmetric mean absolute percentage error (SMAPE):(18)SMAPE=100%n∑i=1ny^i−yiy^i+yi/2.When verifying the results, the data of December 10–18 of the data set are used as the training set for the model, and the data of December 19–21 are used as the test set for the model. In the training process, the traditional GBDT model was added as a comparison, and the early termination strategy was adopted to prevent the occurrence of overfitting. In order to further verify whether different combinations of key features will affect the final prediction results of the model, we choose two different feature input schemes. The first scheme uses all data features as the input to the model, and the prediction evaluation results are shown in Table5. In the second scheme, XGBoost and LightGBM in Figures 8 and 9 are deleted according to the last two of data feature importance, and the remaining 11 key features are taken as model input for prediction. After prediction, the evaluation results are shown in Table 6.Table 5
Evaluation results with all features as model inputs.
SMAPEMAPERMSEMAEGBDT3.76953.93170.42770.2483XGBoost3.74813.93940.44510.2490LightGBM3.30523.33050.32330.2167Model fusion3.26513.31480.31890.2144Table 6
The evaluation results of key features as input to the model.
SMAPEMAPERMSEMAEGBDT3.73323.91180.42950.2482XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133We can see that, under many indicators, the LightGBM model can obtain better prediction results, and the fusion model combining XGBoost and LightGBM can further improve the previous prediction results.In addition, we also found that the prediction effect of the three models on all data feature inputs was not ideal, but the prediction accuracy was significantly improved when only the key features were taken as input. We believe that the redundant data features have low volatility and a single value (such as weather conditions, only sunny, cloudy, fog, and rain), which cannot describe the travel time well and in the complex and useless data stack characteristics under the strategy of the integration of too complex, often produced the phenomenon of fitting. In contrast, choosing a large number of key features as the input for model prediction is a more favorable choice, and it is also suitable for dealing with the prediction problem in this paper.At the same time, in order to verify the effectiveness of the model, this paper introduces the LSTM neural network model for comparative experiments [33]. The data from December 10–18 are used as the training set of the model, and the data from December 19–21 are used as the test set of the model. The data set is divided at 5 min intervals, and the average travel time of all vehicles within 5 min is taken as the input of the model, as shown in Table 7. The evaluation results after prediction are shown in Table 8.Table 7
Comparison of various models.
ID1234567…Average travel time (min)5.6465.1035.6735.1935.2945.5434.726…Table 8
Comparison of various models.
SMAPEMAPERMSEMAELSTM9.765211.15532.09841.2541XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133Compared with other models, the LSTM model has poor prediction effect. We believe that because only the average travel time is selected as the model input and the multivariable input method is used, the prediction effect may be improved. At the same time, the average travel time selected as input in this paper is relatively macro; if the travel time of a single or partial road segment is predicted, the effect may be better.


## 4.2.1. Data Preprocessing

From the above analysis, we can know that the original data have outliers and missing values, so the scatter plots of related features cannot well analyze the criticality of each feature to the prediction model. For these two types of abnormal data, we use the corresponding methods to deal with them. In this article, we use the idea of box plots (Figures7(a) and 7(b)) to deal with the outliers of the data. From Figures 7(a) and 7(b), we can see that the data distribution of the travel time is more scattered. And through the box plot of density, traffic volume, and average location speed, we can find that the data distribution is more scattered. If we use the box plot method to delete the value 1.5QR higher than the upper score or 1.5QR lower than the lower quantile, some real values that can be used for prediction will be deleted by mistake, which will reduce the robustness of the model. Therefore, we set thresholds for this type of data to remove unreasonable values and set them to null values. Finally, we use data filling methods to supplement missing and null values.Figure 7
The boxplot of feature values.
(a)(b)Common missing value processing methods can be divided into several categories. The first type: when the number of missing data is greater than 35%, the feature column can be deleted. The second type: for a feature that lacks a single piece of data, the random forest model can be trained with the part without missing values in the feature, and then, the missing data can be filled. The third type: in certain feature data, a single value is intermittently missing, and we can linearly interpolate the corresponding feature to fill the missing value, as follows:(14)y=y0+y1−y0x1−x0x−x0.In equation (14), y0,y,y1 is a series of data points arranged in ascending order from time to time, which is the previous point closest to the missing point y in time and x0 is the corresponding time point. Similarly, y1 is the next point closest to y in time and x1 is the corresponding time point.After preprocessing the data, the obtained characteristic data table is shown in Table4. We can see that most of the data are more in line with the actual data trend, thus completing the work on data screening and processing, and this feature data table is used as an example of a training/test file for the model.Table 4
Example of the training/testing data file.
Spot speedMean spot speedDensitySpace occupancyTraveling directionNumber of intersectionsNumber of turningTraffic flow…75530.070.2335143355…76370.090.6232543349…38380.140.4834443487…51420.120.38142452…41450.110.335775369…57280.170.2515454421…………………………


## 4.2.2. Analysis of Key Features

Different models generally use different methods to judge the importance of each data feature on the prediction result. For example, LightGBM is different from the traditional method of category splitting. It uses the “many vs many” splitting method and reclassifies the categories according to the relevance of the training target. More specifically, the category features can be considered discretized. For subfeatures, LightGBM reorders each subfeature according to the weight and then selects the optimal segmentation point. XGBoost, on the other hand, uses the average gain of each feature to evaluate the importance of the feature. If the average gain is higher, the feature is more important.Figures8 and 9 show that the LightGBM and XGBoost models are ranked according to the importance of data features. Both models point out that the most critical feature is the mean spot speed. From the overall analysis, it can be seen that the spatial features such as traffic flow, density, driving direction, and space occupancy have a stronger impact on the overall forecast. In contrast, environmental features such as weather conditions and temperature have less impact.Figure 8
Critical features of LightGBM model. The features are listed in top-down order.Figure 9
Critical features of XGBoost model. The features are listed in top-down order.In addition, the recorded value of travel time in this article varies between 4 and 11 min, which is a short-term prediction. Therefore, the volatility of the data may have a certain impact on the weight of the data features. Features such as mean spot speed, traffic flow, and driving direction that have large numerical fluctuations will have a greater impact on the prediction of travel time. Conversely, features such as number of intersections, number of turns, and weather conditions have less numerical fluctuations. The prediction of travel time will have a smaller effect.


## 4.2.3. Comparative Analysis of Model Prediction Results

In this paper, we choose root mean square error (RMSE), mean absolute error (MAE), mean absolute percentage error (MAPE), and symmetric mean absolute percentage error (SMAPE) as the evaluation indicators for this experiment. They all obey the same rule: when the predicted value completely matches the true value, the error is zero, and the model predicts the best effect; the larger the error, the larger the calculated value.The definition and formula of each indicator are as follows:Predictive value:y^=y^1,y^2,…,y^nActual value:y=y1,y2,…,ynRoot mean square error (RMSE):(15)RMSE=1n∑i=1ny^i−yi2.Mean absolute error (MAE):(16)MAE=1n∑i=1ny^i−yi.Mean absolute percentage error (MAPE):(17)MAPE=100%n∑i=1ny^i−yiyi.Symmetric mean absolute percentage error (SMAPE):(18)SMAPE=100%n∑i=1ny^i−yiy^i+yi/2.When verifying the results, the data of December 10–18 of the data set are used as the training set for the model, and the data of December 19–21 are used as the test set for the model. In the training process, the traditional GBDT model was added as a comparison, and the early termination strategy was adopted to prevent the occurrence of overfitting. In order to further verify whether different combinations of key features will affect the final prediction results of the model, we choose two different feature input schemes. The first scheme uses all data features as the input to the model, and the prediction evaluation results are shown in Table5. In the second scheme, XGBoost and LightGBM in Figures 8 and 9 are deleted according to the last two of data feature importance, and the remaining 11 key features are taken as model input for prediction. After prediction, the evaluation results are shown in Table 6.Table 5
Evaluation results with all features as model inputs.
SMAPEMAPERMSEMAEGBDT3.76953.93170.42770.2483XGBoost3.74813.93940.44510.2490LightGBM3.30523.33050.32330.2167Model fusion3.26513.31480.31890.2144Table 6
The evaluation results of key features as input to the model.
SMAPEMAPERMSEMAEGBDT3.73323.91180.42950.2482XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133We can see that, under many indicators, the LightGBM model can obtain better prediction results, and the fusion model combining XGBoost and LightGBM can further improve the previous prediction results.In addition, we also found that the prediction effect of the three models on all data feature inputs was not ideal, but the prediction accuracy was significantly improved when only the key features were taken as input. We believe that the redundant data features have low volatility and a single value (such as weather conditions, only sunny, cloudy, fog, and rain), which cannot describe the travel time well and in the complex and useless data stack characteristics under the strategy of the integration of too complex, often produced the phenomenon of fitting. In contrast, choosing a large number of key features as the input for model prediction is a more favorable choice, and it is also suitable for dealing with the prediction problem in this paper.At the same time, in order to verify the effectiveness of the model, this paper introduces the LSTM neural network model for comparative experiments [33]. The data from December 10–18 are used as the training set of the model, and the data from December 19–21 are used as the test set of the model. The data set is divided at 5 min intervals, and the average travel time of all vehicles within 5 min is taken as the input of the model, as shown in Table 7. The evaluation results after prediction are shown in Table 8.Table 7
Comparison of various models.
ID1234567…Average travel time (min)5.6465.1035.6735.1935.2945.5434.726…Table 8
Comparison of various models.
SMAPEMAPERMSEMAELSTM9.765211.15532.09841.2541XGBoost3.72803.87420.41340.2452LightGBM3.25443.28820.32030.2141Model fusion3.24393.28510.31970.2133Compared with other models, the LSTM model has poor prediction effect. We believe that because only the average travel time is selected as the model input and the multivariable input method is used, the prediction effect may be improved. At the same time, the average travel time selected as input in this paper is relatively macro; if the travel time of a single or partial road segment is predicted, the effect may be better.


## 5. Conclusion

In this paper, we propose a model fusion-based method to predict the travel time of urban macrovehicles based on multifeature data sets such as vehicle GPS and weather conditions. By mining the original GPS data set and combining it with spatial features, we obtained a more comprehensive data set, and we analyzed the importance of model features by means of data distribution and box graphs to filter redundant features. The results show that the most important influence variables in the two models are mostly the same. Finally, we weighted fusion the two models of XGBoost and LightGBM to improve the prediction effect.By analyzing the experimental results, we find that the fusion model proposed in this paper can effectively use the analyzed time and space key features to predict travel time. When the full features and key features are used as inputs, the prediction effect is better than the XGBoost and LightGBM models, so the fusion model has good robustness and can effectively predict vehicle travel time.Although the proposed fusion model has a good performance in predicting travel time, the training and prediction time consumption is more than that of each single model, so the model efficiency needs to be improved. At the same time, this article has considered road characteristics and weather characteristics but lacks research on driver behavior characteristics. Therefore, our future work will analyze the influence of road characteristics, weather characteristics, driver behavior characteristics, and other characteristics on vehicle travel time.



---

*Source: 6897965-2020-06-08.xml*