# Discrete Train Speed Profile Optimization for Urban Rail Transit: A Data-Driven Model and Integrated Algorithms Based on Machine Learning

Authors: Kang Huang; Jianjun Wu; Xin Yang; Ziyou Gao; Feng Liu; Yuting Zhu
Journal: Journal of Advanced Transportation
 (2019)

---

## Abstract

Energy-efficient train speed profile optimization problem in urban rail transit systems has attracted much attention in recent years because of the requirement of reducing operation cost and protecting the environment. Traditional methods on this problem mainly focused on formulating kinematical equations to derive the speed profile and calculate the energy consumption, which caused the possible errors due to some assumptions used in the empirical equations. To fill this gap, according to the actual speed and energy data collected from the real-world urban rail system, this paper proposes a data-driven model and integrated heuristic algorithm based on machine learning to determine the optimal speed profile with minimum energy consumption. Firstly, a data-driven optimization model (DDOM) is proposed to describe the relationship between energy consumption and discrete speed profile processed from actual data. Then, two typical machine learning algorithms, random forest regression (RFR) algorithm and support vector machine regression (SVR) algorithm, are used to identify the importance degree of velocity in the different positions of profile and calculate the traction energy consumption. Results show that the calculation average error is less than 0.1 kwh, and the energy consumption can be reduced by about 2.84% in a case study of Beijing Changping Line.


---

## Body

## 1. Introduction

In recent years, urban rail transit has developed rapidly around the world due to its high capacity, safety, superior energy performance, and reliable service with sufficient punctuality [1], which is becoming increasingly important for large cities development [2]. For example, 35 cities in China have urban rail transit with total length over 4750 km in 2017 [3]. According to the Web of China Rail Transit, there will be more than 50 cities operating urban rail transit in the next few years. In 2020, the total mileage of urban rail transit in China will be 6000 km, making the rail systems an important component of urban public transportation. Around the world, more and more cities are traveling oriented to public transportation. As shown in Figure 1 (which is from Global Cities Public Transit Usage Report of moovit), urban rail transit system has attracted much attention in recent years especially in some large cities and accounts for a high proportion of public transportation. However, the quick expansion of urban rail transit networks led to the problem of larger energy consumption. Taking Beijing rail transit as an example, in 2011, the total electric consumption of Beijing urban rail transit was 750 million kwh, and 470 million kwh was used for traction energy consumption, with the proportion as high as 55% which has attracted tremendous attention in recent years (Yin et al. [4]). In 2015, it reached 1.4 billion kwh, accounting for 40% of the total operating cost of the metro[5], which was equivalent to the annual electricity consumption of 730,000 households (annual electricity consumption of one household is based on 2016 BEIJING STATISTICAL YEARBOOK from Beijing statistical information website). In the European Union (EU), for instance, transport causes approximately 31% of total greenhouse gas (GHG) emissions. Within this sector, metropolitan transportation is responsible for about 25% of the total CO2 emissions (González-Gil et al. [6]). Therefore, energy saving has become an important issue in real train operating in order to reduce the operation cost and satisfy the requirement of environment protection.Figure 1
Proportions of public transportation and urban rail transit.To reduce the energy consumption in urban rail transit, a lot of models have been developed in recent years which mainly considered the train controlling between two stations based on the kinematic equations. There are three types in general, i.e., mathematical optimization models, simulation methods, and multiple linear regression, and neural network model based on the data. Although a lot of works had been done in optimizing speed profiles, existing methods have some limitations:(
1
) The mathematical optimization model in theoretical aspects has been sounded. However, the actual situation is often more complex, and the theory of optimization may not get a good performance when the actual facts are taken into consideration. (
2
) The establishment of the simulation model (e.g., agent-based simulation [7]) is complicated and costly. Further, there is a certain deviation between the simulation results and the actual measurement data. (
3
) The traction energy consumption and its influence factors are not linear, and the precision of the multiple linear regression model is limited. The neural network relies too much on the empirical information extracted from historical data. The phenomenon of overfitting is prone to occur, and the generalization ability may be hard to guarantee. Besides, it is easy to fall into the local optimum. In contrast, from view of the data-driven optimization on the basis of machine learning theories, the limitations could be avoided. Firstly, real-world data that contains the influences from actual factors can be utilized well. Secondly, machine learning has been well applied in many fields, which provides a method to study the existing information from data, acquire new information, and improve performance of data set. The process that utilizes input data (real-world profile) to obtain output data (energy consumption) is easier to be realized. Thirdly, machine learning is stable. For instance, the RFR and the SVR have stable performance in the data set, and they have been widely used in many fields, such as biology, medicine, economy, managementm and so on [8] Therefore, it becomes possible to optimize the train speed profile in the urban rail transit system on the premise of verifying their effectiveness.Main contributions of this research can be summarized as follows:(
1
) A data-driven optimization model (DDOM) is proposed to optimize the speed profile in urban rail transit system. The traditional speed profile optimization model is easy to be analyzed in the theoretical aspects. In this paper, the train speed profile is optimized based on the view of discrete profile which can be applied in the practice easily.(
2
) Based on actual data obtained by experimental measurements, a novel method of utilizing the machine learning algorithm to calculate the energy consumption of speed profile is proposed which can avoid considering longitudinal train dynamics. Besides, the calculation error of machine learning algorithm (RFR and SVR) on speed profile energy is verified.(
3
) To solve the proposed model, an integrated heuristic optimization algorithm based on RFR and SVR is developed. In addition, comparison of real data, results show average 2.84% energy reduction.The framework of this paper is shown in Figure2.Figure 2
Overall framework.


## 2. Literature Review

During last years, many studies have focused on the energy-efficiency analysis of train traction; Scheepmaker et al. [23] summarized and gave a review from two aspects, (
1
) optimizing the speed profiles and driving strategies to reduce the energy consumption (e.g., Howlett [24, 25]; Albrecht et al. [12]; Scheepmaker and Goverde[26]; Yang et al. [18, 27]; Tian et al. [28]; Sun et al. [17]; Yang et al. [29]) and (
2
) optimizing the timetable by means of utilization of regenerative energy with minimum energy consumption (e.g., Chevrier et al. [30]; Li and Lo [19, 20]; Wang and Goverde [31]; Wang et al. [32]; Zhao et al. [33]). Some typical publications about energy-efficient research are listed in Table 1. In essence, energy consumption is related to the train traction process. It is a fundamental work to improve the speed profiles. Over the past 25 years, the challenges in the train speed profile optimization have resulted in a variety of analysis frameworks. (
1
) Mathematical optimization models. The modern theory of optimal train control was developed during the years 1992-2014 by the Scheduling and Control Group (SCG) at the University of South Australia in a collection of papers. For example, Howlett and Cheng [9] built a discrete control model and confirmed the fundamental optimality of the accelerate-coast-brake strategy for energy-efficient train operation. On the basis of the Pontryagin maximum principle, if no energy is recovered during braking, then it becomes an optimal switching strategy. Wong and Ho [11] showed that a genetic algorithm was more robust in calculational processes. After reformulating the necessary conditions for optimal switching, Howlett et al. [34] proposed a less general model that the optimal switching points for each steep section can be found by minimizing an intrinsic local energy function. Albrecht et al. [13] used the Pontryagin principle to find necessary conditions on an optimal strategy and showed that a strategy of optimal type uses only a limited set of optimal control modes, Maximum Power, HoldP (Hold using Power), Coast, HoldR (Hold using Regenerative braking), and Maximum Brake. Albrecht et al. [14] developed general bounds on the position of optimal switching points and proved that an optimal strategy always exists. And an intrinsic local energy minimization principle for determination of optimal switching points was established, which shows that the optimal strategy is unique. Huang et al. [35] proposed an integrated approach for the energy-efficient driving strategy and timetable which was solved by a particle swarm optimization (PSO) algorithm. Yang et al. [36] employed an energy-efficient through the Taylor approximation. They transformed the train scheduling problem using a nonconvex formation into a quadratic formation and search the solution by a PSO method. (
2
) Simulation method. Yin et al. [15] built an ITO (intelligent train operation) simulation platform on the basis of the multiple-point-mass train model that the platform consists of four parts, i.e., the Input Module, the Algorithm Module, the Train Module, and the Output Module. (
3
) Multiple linear regression model and neural network model based on the data. Fernándeza et al. [37] modeled electric trains energy consumption using neural networks, providing a reliable estimation of the consumption along a specific route when being fed with input data such as train speed, acceleration, or track longitudinal slope.Table 1
Some typical publications about energy-efficient.
View Publication
Years
Model type
Objective
Energy consumption calculational method
Solution method
I
Cheng and Howlett. [9].
1993
Discrete control model
Energy consumption of profile
Empirical-formula, numerical integration
Optimize control
I
Howlett et al. [10].
1996
Continuous control model
Energy consumption of profile
Empirical-formula, numerical integration
Optimize control
I
Wong and Ho [11]
2004
Discrete control model
Energy consumption of profile
Genetic method
Genetic search
I
Albrecht et al. [12]
2013
Continuous control model
Energy consumption of profile
Empirical-formula, numerical integration
Optimize control
I
Albrecht, Howlett et al. [13, 14]
2016 a&b
Continuous control model
Energy consumption of profile
Empirical-formula, numerical integration
Optimize control
I
Yin et al. [15]
2014
Reinforcement learning
Energy consumption of profile
Empirical-formula, numerical integration Simulation platform
Dynamic programming
I& II
Nasri et al. [16]
2010
Simulation model
Energy consumption of timetable
Empirical-formula, numerical integration Simulation platform
Simulation
II
Sun et al. [17]
2013
MILP
Energy consumption of timetable
Empirical-formula, numerical integration
Genetic search
II
Yang et al. [18]
2015a
MILP
Energy consumption of whole line
Taking into consideration recovery energy
Genetic search
II
Li and Lo [19, 20]
2014 a&b
Integrated-operation model
Energy consumption of network
Empirical-formula, numerical integration
Genetic search
II
Canca and Zarzo [21]
2017
MILP
Energy consumption of whole line
Empirical-formula, numerical integration
Iterative algorithm and Python+Gurobi
II
Yin et al. [22]
2017
MILP
Energy consumption and the passenger waiting time
Empirical-formula, numerical integration
Lagrangian relaxation (LR)-based heuristic algorithm
I: speed profiles/driving strategy; II: energy-efficient timetable.Big data analytics (BDA) has increasingly attracted a strong attention of analysts, researchers and practitioners in railway transportation and engineering filed [38]. From a data-driven view, this paper mainly focuses on how to obtain the optimal speed profile based on well-developed machine learning algorithms. There are still seldom researches aiming at optimal speed profile by this proposed method.


## 3. Data Analysis and Preprocessing

### 3.1. Data Overview

During the operation of the subway, the most widely used power is electricity. Some are used for the consumption of facilities in the train, such as air conditioning, lighting, etc. The rest is for traction of metro trains. Our data resources are formed by urban rail transit train running state and corresponding energy consumption, which are derived from Changping Line of Beijing urban rail transit. The operation section of Changping Line is from the Xi’erqi station to the Changpingxishankou station, with operating mileage of 31.9 kilometers and total of 12 stations opened (as illustrated in Figure3). In order to accurately capture the actual traction power consumption during the operation of the subway, we installed sensors and computers on the train. The total energy consumption and the energy consumptions of various electrical appliances in the train are both recorded. Then, the total consumption is subtracted from the electrical energy consumed by the electrical appliances, and the rest is the energy consumed by the traction of the subway train. The provided data covers running stage of 4 months. There are two circle running tests every night in the up and down direction. The types of recorded data are showed in Table 2.Table 2
Overview of measurement characteristics.
Parameter
Unit
Resolution
Speed
km/h
0.001
Position
m
0.001
Time
s
0.2
Train weight
ton
1
Current slope
1‰
1
EBI speed
km/h
0.001
Station spacing
m
0.001
Expected acceleration of PID
(km/h)/s
1
Electric energy consumption
Kwh
1Figure 3
Illustration of the Changping Line.


### 3.2. Data Preprocessing

Symbols
n: number of section is discretized to.
v
j
0: jth speed point of original profile C
i.
s
j
0: jth position point of original profile C
i.
t
j
0: jth time point of original profile C
i.
s
i: it is the ith displacement from the beginning of the urban rail transit section.
v
i: the speed at s
i.
t
i: the time at s
i.
∇
t: the time interval used to record the speed and displacement data during train traction.
S
i
0: distance set at a time interval ∇
t. S
i
0=s
j
0
∣
j
=
1,2
…
n.Using these recorded data, we can draw out the running process of the urban rail transit train. Taking MingTombs-Changpingxishankou of the down direction, for instance (showed in Figure4), the train operation process is divided into three stages. The first stage is accelerating until approaching the maximum speed limit; the second stage is fluctuating in the high-speed zone; the third stage is the deceleration braking until the train stops. Normally, differences in track conditions are caused by construction and geological reasons. There will be limited speed at different locations in each section of the urban rail transit. In this section, there are three speed limiting sections: 0
→
S
l
i
m
1, S
l
i
m
1
→
S
l
i
m
2, S
l
i
m
2
→
E
n
d. Each part has its maximum speed limit.Figure 4
MingTombs-Changpingxishankou.Train running state form is shown in Table3 (m: the number of data recorded on an original speed profile). A speed profile has three elements, speed, time, and distance. The time interval between records in the table is 0.2 seconds. However, the running time between two stations varies from almost one to several hundred seconds. This means that a speed profile may be made up of thousands of records. We need to calculate the energy consumption from the profile, that is to say, to find the relationship between energy consumption and the thousands of data records, which is the so-called “high-dimensional” data in statistics.Table 3
Part types of the original data.
Time
Velocity(km/h)
Distance(m)
t
1
0
v
1
0
s
1
0
t
2
0
v
2
0
s
2
0
…
…
…
…
…
…
t
i
0
v
i
0
s
i
0
…
…
…
…
…
…
t
m
0
v
m
0
s
m
0Although machine learning algorithms under the back of big data are suitable for dealing with high-dimensional data, for extremely high-dimensional situations, large amounts of data are needed as training sets, and calculation precision is hard to be gained [39]. Therefore, we choose dimensionality reduction for the limitation of data quantity. Not only can the algorithm achieve good training effect, but also the accuracy of the original high-dimensional data can be reserved.Process of reducing the dimension is as follows:1 The section length S
0 can be obtained from records, then S
0 is divided into n small sections (the uniform segmentation method is chosen in this paper). Thus, the (n+1) points are represented by s
0
,
…
s
i
…
s
n
∣
i
=
0,1
,
…
n. Clearly, s
0
=
0, s
n
=
S
0 (section total length). Taking MingTombs-Changpingxishankou of the down direction, for instance, as shown in Figure 5, a uniform interval of 50 m and 5 m is selected for discrete process. In Figure 5(a), the speed profile record number drops to 26, getting 26 control points during the train traction, respectively, in Figure 5(b), speed profile record number is 247, and the density of control points is higher.Figure 5
Profiles description at different distance intervals. (a) 50m interval. (b) 5m interval.
(a)
(b)(
2
) Find the latter and previous positions of s
i in original profile within ∇
t interval, recorded as s
i
- and s
i
+. Sequence s
0
-
…
s
i
-
…
s
n
-, s
0
+
…
s
i
+
…
s
n
+ is obtained.(
3
) In the original velocity profile, we can get the velocity and time corresponding to the s
i
- and s
i
+, recorded as v
i
-, v
i
+, t
i
-, and t
i
+. In the small section from s
i
- to s
i
+, the train is assumed to be in a uniformly accelerated state. As shown in Figure 6, by using v
i
-, v
i
+, s
i
-, and s
i
+, the v
i can be obtained. Therefore, we can get the v
0
…
v
i
…
v
n, where v
0
=
v
n
=
0. Figure 6(a) indicates speed profile can be represented by fewer points. Figure 6(b) shows error between the simplified profile and original one could be ignored when compared the whole length of section.Figure 6
Dimension reduction process of velocity profile. (a) Get thev
0
…
v
i
…
v
n. (b) Error in simplified profile.
(a)
(b)


### 3.3. Extraction of Training Data Set and Testing Data Set

After processing above,v
i
-
s
i
,
v
i
+
-
s
i
+
-
t
i
+
,
v
i
-
-
s
i
-
-
t
i
- can be obtained. For example, let s
i
(
i
=
0,1
…
n
) be with a uniform interval of 5 m, and part of results are shown in Table 4.Table 4
Part of the velocity series after being processed.
i
v
i
-
(
k
m
/
h
)
s
i
-(m)
t
i
-
(
∇
t
)
v
i
(
k
m
/
h
)
s
i
(
m
)
v
i
+
(
k
m
/
h
)
s
i
+
(
m
)
1
0
0
0
0
0
0
0
2
9.18
4.64
21
9.657
5
9.9
5.19
3
14.256
9.33
28
14.811
10
14.94
10.16
4
18.612
14.928
34
18.659
15
19.296
16
5
21.492
19.462
38
21.824
20
22.248
20.698
6
24.408
24.646
42
24.593
25
25.128
26.042
7
26.568
28.954
45
27.042
30
27.252
30.468
8
28.764
33.622
48
29.371
35
29.484
35.26
9
30.888
38.652
51
31.442
40
31.608
40.408
10
33.012
44.04
54
33.419
45
33.804
45.918
11
35.172
49.786
57
35.25
50
35.892
51.78
12
36.576
53.812
59
36.991
55
37.296
55.884
13
37.944
57.992
61
38.617
60
38.664
60.14
14
40.068
64.554
64
40.197
65
40.716
66.816
15
41.436
69.118
66
41.709
70
42.156
71.46
16
42.804
73.838
68
43.134
75
43.488
76.254
17
44.172
78.708
70
44.528
80
44.856
81.2
18
45.576
83.732
72
45.897
85
46.224
86.3
19
46.944
88.908
74
47.213
90
47.592
91.552
20
48.204
94.23
76
48.368
95
48.78
96.94The speed profile sequencev
i
-
s
i
,
i
=
1,2
,
…
n and the traction energy consumptions of each sequence E are extracted. And the data is shown in Table 5 (q: number of processed data records). Then, to eliminate dimension, the data is normalized. The extracted data is divided into two parts. 80% is as the training set, and 20% is as the test set.Table 5
Data format of training and testing set.
Serial number
s
0
s
1
…
s
n
-
1
s
n
Time
Energy consumption
1
v
0
1
v
1
1
…
v
n
-
1
1
v
n
1
t
1
E
1
2
v
0
2
…
…
…
…
t
2
E
2
…
…
…
…
…
…
…
…
q-1
v
0
q
-
1
….
…
…
…
…
E
q
-
1
q
v
0
q
v
1
q
…
v
n
-
1
q
v
n
q
t
n
E
q


## 3.1. Data Overview

During the operation of the subway, the most widely used power is electricity. Some are used for the consumption of facilities in the train, such as air conditioning, lighting, etc. The rest is for traction of metro trains. Our data resources are formed by urban rail transit train running state and corresponding energy consumption, which are derived from Changping Line of Beijing urban rail transit. The operation section of Changping Line is from the Xi’erqi station to the Changpingxishankou station, with operating mileage of 31.9 kilometers and total of 12 stations opened (as illustrated in Figure3). In order to accurately capture the actual traction power consumption during the operation of the subway, we installed sensors and computers on the train. The total energy consumption and the energy consumptions of various electrical appliances in the train are both recorded. Then, the total consumption is subtracted from the electrical energy consumed by the electrical appliances, and the rest is the energy consumed by the traction of the subway train. The provided data covers running stage of 4 months. There are two circle running tests every night in the up and down direction. The types of recorded data are showed in Table 2.Table 2
Overview of measurement characteristics.
Parameter
Unit
Resolution
Speed
km/h
0.001
Position
m
0.001
Time
s
0.2
Train weight
ton
1
Current slope
1‰
1
EBI speed
km/h
0.001
Station spacing
m
0.001
Expected acceleration of PID
(km/h)/s
1
Electric energy consumption
Kwh
1Figure 3
Illustration of the Changping Line.


## 3.2. Data Preprocessing

Symbols
n: number of section is discretized to.
v
j
0: jth speed point of original profile C
i.
s
j
0: jth position point of original profile C
i.
t
j
0: jth time point of original profile C
i.
s
i: it is the ith displacement from the beginning of the urban rail transit section.
v
i: the speed at s
i.
t
i: the time at s
i.
∇
t: the time interval used to record the speed and displacement data during train traction.
S
i
0: distance set at a time interval ∇
t. S
i
0=s
j
0
∣
j
=
1,2
…
n.Using these recorded data, we can draw out the running process of the urban rail transit train. Taking MingTombs-Changpingxishankou of the down direction, for instance (showed in Figure4), the train operation process is divided into three stages. The first stage is accelerating until approaching the maximum speed limit; the second stage is fluctuating in the high-speed zone; the third stage is the deceleration braking until the train stops. Normally, differences in track conditions are caused by construction and geological reasons. There will be limited speed at different locations in each section of the urban rail transit. In this section, there are three speed limiting sections: 0
→
S
l
i
m
1, S
l
i
m
1
→
S
l
i
m
2, S
l
i
m
2
→
E
n
d. Each part has its maximum speed limit.Figure 4
MingTombs-Changpingxishankou.Train running state form is shown in Table3 (m: the number of data recorded on an original speed profile). A speed profile has three elements, speed, time, and distance. The time interval between records in the table is 0.2 seconds. However, the running time between two stations varies from almost one to several hundred seconds. This means that a speed profile may be made up of thousands of records. We need to calculate the energy consumption from the profile, that is to say, to find the relationship between energy consumption and the thousands of data records, which is the so-called “high-dimensional” data in statistics.Table 3
Part types of the original data.
Time
Velocity(km/h)
Distance(m)
t
1
0
v
1
0
s
1
0
t
2
0
v
2
0
s
2
0
…
…
…
…
…
…
t
i
0
v
i
0
s
i
0
…
…
…
…
…
…
t
m
0
v
m
0
s
m
0Although machine learning algorithms under the back of big data are suitable for dealing with high-dimensional data, for extremely high-dimensional situations, large amounts of data are needed as training sets, and calculation precision is hard to be gained [39]. Therefore, we choose dimensionality reduction for the limitation of data quantity. Not only can the algorithm achieve good training effect, but also the accuracy of the original high-dimensional data can be reserved.Process of reducing the dimension is as follows:1 The section length S
0 can be obtained from records, then S
0 is divided into n small sections (the uniform segmentation method is chosen in this paper). Thus, the (n+1) points are represented by s
0
,
…
s
i
…
s
n
∣
i
=
0,1
,
…
n. Clearly, s
0
=
0, s
n
=
S
0 (section total length). Taking MingTombs-Changpingxishankou of the down direction, for instance, as shown in Figure 5, a uniform interval of 50 m and 5 m is selected for discrete process. In Figure 5(a), the speed profile record number drops to 26, getting 26 control points during the train traction, respectively, in Figure 5(b), speed profile record number is 247, and the density of control points is higher.Figure 5
Profiles description at different distance intervals. (a) 50m interval. (b) 5m interval.
(a)
(b)(
2
) Find the latter and previous positions of s
i in original profile within ∇
t interval, recorded as s
i
- and s
i
+. Sequence s
0
-
…
s
i
-
…
s
n
-, s
0
+
…
s
i
+
…
s
n
+ is obtained.(
3
) In the original velocity profile, we can get the velocity and time corresponding to the s
i
- and s
i
+, recorded as v
i
-, v
i
+, t
i
-, and t
i
+. In the small section from s
i
- to s
i
+, the train is assumed to be in a uniformly accelerated state. As shown in Figure 6, by using v
i
-, v
i
+, s
i
-, and s
i
+, the v
i can be obtained. Therefore, we can get the v
0
…
v
i
…
v
n, where v
0
=
v
n
=
0. Figure 6(a) indicates speed profile can be represented by fewer points. Figure 6(b) shows error between the simplified profile and original one could be ignored when compared the whole length of section.Figure 6
Dimension reduction process of velocity profile. (a) Get thev
0
…
v
i
…
v
n. (b) Error in simplified profile.
(a)
(b)


## 3.3. Extraction of Training Data Set and Testing Data Set

After processing above,v
i
-
s
i
,
v
i
+
-
s
i
+
-
t
i
+
,
v
i
-
-
s
i
-
-
t
i
- can be obtained. For example, let s
i
(
i
=
0,1
…
n
) be with a uniform interval of 5 m, and part of results are shown in Table 4.Table 4
Part of the velocity series after being processed.
i
v
i
-
(
k
m
/
h
)
s
i
-(m)
t
i
-
(
∇
t
)
v
i
(
k
m
/
h
)
s
i
(
m
)
v
i
+
(
k
m
/
h
)
s
i
+
(
m
)
1
0
0
0
0
0
0
0
2
9.18
4.64
21
9.657
5
9.9
5.19
3
14.256
9.33
28
14.811
10
14.94
10.16
4
18.612
14.928
34
18.659
15
19.296
16
5
21.492
19.462
38
21.824
20
22.248
20.698
6
24.408
24.646
42
24.593
25
25.128
26.042
7
26.568
28.954
45
27.042
30
27.252
30.468
8
28.764
33.622
48
29.371
35
29.484
35.26
9
30.888
38.652
51
31.442
40
31.608
40.408
10
33.012
44.04
54
33.419
45
33.804
45.918
11
35.172
49.786
57
35.25
50
35.892
51.78
12
36.576
53.812
59
36.991
55
37.296
55.884
13
37.944
57.992
61
38.617
60
38.664
60.14
14
40.068
64.554
64
40.197
65
40.716
66.816
15
41.436
69.118
66
41.709
70
42.156
71.46
16
42.804
73.838
68
43.134
75
43.488
76.254
17
44.172
78.708
70
44.528
80
44.856
81.2
18
45.576
83.732
72
45.897
85
46.224
86.3
19
46.944
88.908
74
47.213
90
47.592
91.552
20
48.204
94.23
76
48.368
95
48.78
96.94The speed profile sequencev
i
-
s
i
,
i
=
1,2
,
…
n and the traction energy consumptions of each sequence E are extracted. And the data is shown in Table 5 (q: number of processed data records). Then, to eliminate dimension, the data is normalized. The extracted data is divided into two parts. 80% is as the training set, and 20% is as the test set.Table 5
Data format of training and testing set.
Serial number
s
0
s
1
…
s
n
-
1
s
n
Time
Energy consumption
1
v
0
1
v
1
1
…
v
n
-
1
1
v
n
1
t
1
E
1
2
v
0
2
…
…
…
…
t
2
E
2
…
…
…
…
…
…
…
…
q-1
v
0
q
-
1
….
…
…
…
…
E
q
-
1
q
v
0
q
v
1
q
…
v
n
-
1
q
v
n
q
t
n
E
q


## 4. Formulation

In this section, a data-driven optimization model (DDOM) is proposed to optimize the urban rail transit traction energy consumption, which discretizes velocity profile and describes the relation between velocity profile and energy consumption as a complex mapping-relation.


### 4.1. Symbols and Assumptions

Parameters
V
i
0: velocity set at a time interval ∇
t. V
i
0=v
j
0
∣
j
=
1,2
…
n.
S
i
0: distance set at a time interval ∇
t. S
i
0=s
j
0
∣
j
=
1,2
…
n.
T
i
0: time set with a time interval of ∇
t. T
i
0=t
j
0
∣
j
=
1,2
…
n.
C
∗: set of processed speed profiles, and v
i
-
s
i
∣
i
=
0,1
…
n
∈
C
∗.
a
i: the acceleration at s
i.
E
t: energy consumption of urban rail transit traction under running time of t.
v
S
i
m
i
n: minimum speed limit corresponding to s
i.
v
S
i
m
a
x: maximum speed limit corresponding to s
i.
a
m
i
n: minimum acceleration limit in operational section.
a
m
a
x: maximum acceleration limit in operational section.
T
m
i
n: minimum time limit in operational section.
T
m
a
x: maximum time limit in operational section.Assumption. During the process of s
i
-
→
s
i
→
s
i
+, because the interval is small enough, it is assumed that the train is in uniform acceleration. According to the theorem of v
e
l
o
c
i
t
y
-
d
i
s
p
l
a
c
e
m
e
n
t relationship in physics, the quadratic function can be given. (1)
v
i
+
2
-
v
i
2
s
i
+
-
s
i
=
2
a
i
i
=
1
…
n
(2)
v
i
2
-
v
i
-
2
s
i
-
s
i
-
=
2
a
i
i
=
1
…
n
(3)
a
i
=
v
i
+
-
v
i
-
∇
t
i
=
1
…
.
nDerived by formulas (1)-(3), we get the velocity sequence v
0
…
v
i
…
v
n as follows: (4)
v
i
=
2
a
i
s
i
-
s
i
-
+
v
i
-
2
=
2
v
i
+
-
v
i
-
s
i
-
s
i
-
∇
t
+
v
i
-
2
i
=
1
…
nor (5)
v
i
=
v
i
+
2
-
2
a
i
s
i
+
-
s
i
=
v
i
+
2
-
2
v
i
+
-
v
i
-
s
i
+
-
s
i
∇
t
i
=
1
…
n


### 4.2. Train Operation Constraints

During the running state from one station to a neighboring station, some constraints should be satisfied.Speed limit (SL) constraints: the speed limit of the section ats
i should be satisfied. (6)
v
s
i
m
i
n
<
v
s
i
<
v
s
i
m
a
x
i
=
1
…
n
v
s
i
m
a
x and v
s
i
m
i
n are determined by the actual speed limit of the section.Acceleration constraints: in order to satisfy the comfort of passengers on the train, the acceleration needs to be kept in a suitable range. As shown in formula (7)-(8),a
m
i
n and a
m
a
x are determined by actual empirical parameters, and a
m
a
x
>
0
,
a
m
i
n
<
0. (7)
v
i
+
1
2
-
v
i
2
2
s
i
+
1
-
s
i
=
a
i
∈
a
m
i
n
,
a
m
a
x
i
=
1
…
n
-
1
(8)
v
i
2
-
v
i
-
1
2
2
s
i
-
s
i
-
1
=
a
i
∈
a
m
i
n
,
a
m
a
x
i
=
1
…
nTrain operation time constraints: transportation efficiency also should be taken into account. Therefore, the train running timet also needs to be within a certain range as shown in formula (9). (9)
t
∈
T
m
i
n
,
T
m
a
xwhereT
m
i
n and T
m
a
x are determined by the service level and operational condition.Train operation distance constraints: to ensure that the train can reach the station accurately, the total displacement of the train in the section must be equal to the length of the section.(10)
s
n
=
S
0


### 4.3. Objective Function

When the section running time of train ist, the corresponding energy consumption is E
t, which has a complicated relationship with the sequence of velocity points. That is, E
t
s
0
-
v
0
…
s
i
-
v
i
…
s
n
-
v
n i=0,1…n. The optimization of urban rail transit speed profile is to minimize the energy consumption under the condition of satisfying transportation task, and the objective function of data-driven optimization model (DDOM) is showed in (11).(11)
min
⁡
E
=
min
t
⁡
E
t
v
i
-
s
i
∣
i
=
0,1
…
n
t
∈
T
m
i
n
,
T
m
a
x
,
v
i
-
s
i
∣
i
=
0,1
…
n
∈
C
∗


## 4.1. Symbols and Assumptions

Parameters
V
i
0: velocity set at a time interval ∇
t. V
i
0=v
j
0
∣
j
=
1,2
…
n.
S
i
0: distance set at a time interval ∇
t. S
i
0=s
j
0
∣
j
=
1,2
…
n.
T
i
0: time set with a time interval of ∇
t. T
i
0=t
j
0
∣
j
=
1,2
…
n.
C
∗: set of processed speed profiles, and v
i
-
s
i
∣
i
=
0,1
…
n
∈
C
∗.
a
i: the acceleration at s
i.
E
t: energy consumption of urban rail transit traction under running time of t.
v
S
i
m
i
n: minimum speed limit corresponding to s
i.
v
S
i
m
a
x: maximum speed limit corresponding to s
i.
a
m
i
n: minimum acceleration limit in operational section.
a
m
a
x: maximum acceleration limit in operational section.
T
m
i
n: minimum time limit in operational section.
T
m
a
x: maximum time limit in operational section.Assumption. During the process of s
i
-
→
s
i
→
s
i
+, because the interval is small enough, it is assumed that the train is in uniform acceleration. According to the theorem of v
e
l
o
c
i
t
y
-
d
i
s
p
l
a
c
e
m
e
n
t relationship in physics, the quadratic function can be given. (1)
v
i
+
2
-
v
i
2
s
i
+
-
s
i
=
2
a
i
i
=
1
…
n
(2)
v
i
2
-
v
i
-
2
s
i
-
s
i
-
=
2
a
i
i
=
1
…
n
(3)
a
i
=
v
i
+
-
v
i
-
∇
t
i
=
1
…
.
nDerived by formulas (1)-(3), we get the velocity sequence v
0
…
v
i
…
v
n as follows: (4)
v
i
=
2
a
i
s
i
-
s
i
-
+
v
i
-
2
=
2
v
i
+
-
v
i
-
s
i
-
s
i
-
∇
t
+
v
i
-
2
i
=
1
…
nor (5)
v
i
=
v
i
+
2
-
2
a
i
s
i
+
-
s
i
=
v
i
+
2
-
2
v
i
+
-
v
i
-
s
i
+
-
s
i
∇
t
i
=
1
…
n


## 4.2. Train Operation Constraints

During the running state from one station to a neighboring station, some constraints should be satisfied.Speed limit (SL) constraints: the speed limit of the section ats
i should be satisfied. (6)
v
s
i
m
i
n
<
v
s
i
<
v
s
i
m
a
x
i
=
1
…
n
v
s
i
m
a
x and v
s
i
m
i
n are determined by the actual speed limit of the section.Acceleration constraints: in order to satisfy the comfort of passengers on the train, the acceleration needs to be kept in a suitable range. As shown in formula (7)-(8),a
m
i
n and a
m
a
x are determined by actual empirical parameters, and a
m
a
x
>
0
,
a
m
i
n
<
0. (7)
v
i
+
1
2
-
v
i
2
2
s
i
+
1
-
s
i
=
a
i
∈
a
m
i
n
,
a
m
a
x
i
=
1
…
n
-
1
(8)
v
i
2
-
v
i
-
1
2
2
s
i
-
s
i
-
1
=
a
i
∈
a
m
i
n
,
a
m
a
x
i
=
1
…
nTrain operation time constraints: transportation efficiency also should be taken into account. Therefore, the train running timet also needs to be within a certain range as shown in formula (9). (9)
t
∈
T
m
i
n
,
T
m
a
xwhereT
m
i
n and T
m
a
x are determined by the service level and operational condition.Train operation distance constraints: to ensure that the train can reach the station accurately, the total displacement of the train in the section must be equal to the length of the section.(10)
s
n
=
S
0


## 4.3. Objective Function

When the section running time of train ist, the corresponding energy consumption is E
t, which has a complicated relationship with the sequence of velocity points. That is, E
t
s
0
-
v
0
…
s
i
-
v
i
…
s
n
-
v
n i=0,1…n. The optimization of urban rail transit speed profile is to minimize the energy consumption under the condition of satisfying transportation task, and the objective function of data-driven optimization model (DDOM) is showed in (11).(11)
min
⁡
E
=
min
t
⁡
E
t
v
i
-
s
i
∣
i
=
0,1
…
n
t
∈
T
m
i
n
,
T
m
a
x
,
v
i
-
s
i
∣
i
=
0,1
…
n
∈
C
∗


## 5. A Greedily Heuristic Algorithm for Model

In this section, firstly two energy consumption calculation methods based on machine learning algorithm are introduced. Then, by analysis the characters of them, an integrated optimization flow is developed with a combination of their merits.


### 5.1. Energy Consumption Calculation Based on Machine Learning Algorithm

From the view of data-driven method, urban rail transit train runs within each section and produces a traction speed profile that corresponds to an energy consumption value. Although the factors affecting the energy consumption of each train are not only related to the speed profile, the external factors are determined once the operational section is fixed. Moreover, the transmission characteristic of the train is determined when the type of train is selected; then the energy consumption is only related to the speed profile during the traction process. Therefore, the speed profile becomes the key to the energy consumption of train traction.In this paper, two typical machine learning algorithms (RFR and SVR) are introduced, where RFR is utilized to get velocity points’ importance degrees in different positions, which can be responsible for obtaining these pairs space-speed with a major contribution to the energy consumption. And, SVR is employed to calculate the energy consumption of the profile. The programming environment is Python 3 and its machine learning module is scikit-learn.


#### 5.1.1. Random Forest Regression (RFR) Algorithm Module

Random forest is a kind of ensemble learning algorithm, which uses multiple trees to train and predict a classifier, and also can be used for regression [40]. Based on decision trees combined with aggregation and bootstrap ideas, random forests were introduced by Breiman in 2001, which added an additional layer of randomness to bagging. In addition to constructing each tree using a different bootstrap sample of the data, random forests change how the classification or regression trees are constructed. They are a powerful nonparametric statistical method allowing consideration in a single and versatile framework regression problem [41]. The random forest optionally produces two additional pieces of information: a measure of the importance of the predictor variables and a measure of the internal structure of the data (the proximity of different data points between one and another). In this paper, we can take advantages of this module to get velocity points’ importance degree in different positions which can be used in heuristic solution process for model.Evaluation and Analysis of RFR. In the utilization of RFR algorithm, two important parameters should be calibrated: the number of split attributes (Mtry) and number of decision trees (Ntree). For simplicity, the enumeration method is used to traverse the two parameters. The convergence process is shown in Figure 7 over ten experiments. We can see that, when Ntree≥50, the average error is close to 0.1kwh. For different Mtrys, errors are shown in Figure 8(a), and there is an acceptable convergence range in Figure 8(b). When the Mtry=2 or 3, the error is minimal. Therefore, the optimal parameter combination used in this paper is Mtry=2 or 3 and Ntree≥50. By using the FR algorithm, the traction energy consumption evaluation average error is less than 0.1kwh and within range of 1%.Figure 7
The error values at different Ntrees.Figure 8
Convergence process and errors in RFR. (a) Errors in different Mtrys. (b) Convergence range.
(a)
(b)In addition to the high precision evaluation ability, we also get importance degrees of the velocity in different displacements during the traction energy consumption of the urban rail transit. We can find that the speed at which position is more significant to the energy consumption in a section, which indicates contributions to energy consumption of pairs space-speed. For instance, in the section of MingTombs-Changpingxishankou, section length is 1230 m, the importance degrees at different positions are shown in Figure9.Figure 9
Importance of velocity at different locations in the section.


#### 5.1.2. Support Vector Machine Regression (SVR) Algorithm Module

Support vector machine (SVM) algorithm is from statistical learning theory (SLT), which is based on the structural risk minimization principle that can avoid excessive learning problems and ensure the generalization ability of the model. In essence, it can solve the convex quadratic programming problem and avoid falling into the local minimum. It can be applied not only to classification problems but also to the case of regression [42]. Therefore, it can be divided into support vector classification (SVC) and support vector regression (SVR). Because of its solid theoretical foundation and its complete theoretical derivation, support vector machine is an effective tool in dealing with small samples, nonlinear, local issues. In this paper, it is applied to calculate the energy consumption based on real data.Before using the SVR, the first step requires the determination of the kernel functions. The second step is to optimize parameters corresponding to different kernel functions. In this paper, three typical kernel functions are verified: radial basis kernel function (RBF), linear kernel function (LINEAR), and polynomial kernel function (POLY).(
1
) For RBF, calibration parameters include C penalty factor and G
a
m
m
a value. As shown in Figure 10(a), convergence rate of RBF is very fast. When C
≥ 20, the error will drop to a lower level. As C
≥ 100, the average error of traction energy consumption can reach about 0.1kwh. The best combination of parameters is C
≥
30, and G
a
m
m
a
=
3.Figure 10
Convergence process in different kernel functions. (a) SVR-RBF-Gamma. (b) SVR-LINEAR. (c) SVR-POLY.(
2
) For LINEAR, calibration parameter is C penalty factor. As shown in Figure 10(b), the convergence is slow. When C
≥ 900, the average error of traction energy consumption also can reach about 0.1kwh, which means that it will take a little longer time to reach minimum errors.(
3
) For POLY, calibration parameter is C penalty factor. As shown in Figure 10(c), average error is fluctuating up-down at 0.1Kwh and not stable, which fails to achieve better convergence results.Comparing the performance of the three kernel functions, average error of the RBF kernel function is the best, which means that the traction energy consumption can be calculated under the optimal parameter conditions.


#### 5.1.3. Analysis of the Two Machine Learning Algorithms

For RFR algorithm, stable performance is in the data set, and the evaluation results are satisfactory. At the same time, the more momentous point is that the importance degrees of the velocity points in different positions can be sorted, which will be a valid guiding to the optimization control of the speed profile. For example, we can adjust the speed with high importance degree in the speed profile optimization process. As for the SVR algorithm, although the performance is not good in some kernel conditions, the ability to calculate in the RBF kernel function is also serviceable enough. For optimizing the speed profile of an urban rail transit train, we should find a speed profile that is not less than the existing energy consumption or is even lower than the existing energy consumption. However, the RFR algorithm has a fatal flaw: random forest cannot make the output beyond the range of data set, which may lead to overfitting in modeling of some specific data with noise. Therefore, the design of urban rail transit speed profile optimization algorithms could be beneficial to the combination virtues of the SVR and RFR.


### 5.2. Optimization Process

Form the view of discrete train speed profile optimization, the key problem is how to design a method to get a more energy-efficient profile; thus a group of combinationsv
i
-
s
i
(
i
=
0,1
…
n
) should be found. Velocity v
i in every position can be in a range, and the number of v
i
-
s
i
(
i
=
0,1
…
n
) combinations will be beyond imagination. It is necessary to discretize the speed changing value. Thus, there should be a step size used for the speed adjustment. A simple and effective step size is the unit from recording instrument (in our experiment, it is 0.001km/h). Further, a heuristic process can be proposed to reduce the combinations: we can utilize important degree from RFR to adjust the velocity with fixed order. Then, energy-saving profile will be easier to get by the heuristic process. As shown in Figure 11, in one operation section, of the real-world data, there are many profiles under the same running time but with different energy consumptions. Under every running time condition, we can try to find a satisfactory profile at this fixed running time. Then, the best of them with different fixed running time is taken as the optimal solution. Based on this, we develop an integrated greedily heuristic algorithm combined with RFR and SVR.Figure 11
Distribution of solutions.Parameters
I
+: set of index values corresponding to the speed at which the importance degree is arranged in descending order.
I
-: set of index values corresponding to the speed at which the importance degree is arranged in ascending order.
I
(
k
)
+: in descending order, the speed index value corresponding to the k
t
h importance degree.
I
(
k
)
-: in ascending order, the speed index value corresponding to the k
t
h importance degree.Step 1.
In the case of optimal parameters, random forest regression (RFR) Algorithm Module (Section5.1.1)) is used to obtain the importance degree of speed series v
i
-
s
i. Then, sort them (because the importance degrees of v
0
-
s
0.  v
n
-
s
n are zero, they are excluded) in descending order. And the K speed sequences v
k
+
-
s
k
+ of the previous m%(K
=
n
∗
m
/
100) are selected. For the corresponding importance degree e
k
+
(
1
≤
k
≤
K
), we can get e
1
+
≥
e
2
+
…
≥
e
k
+
…
≥
e
K
+. Then, in ascending order, similarly, the K speed sequences v
k
-
-
s
k
- of the previous m% are selected, and get e
1
-
≤
e
2
-
…
≤
e
k
-
…
≤
e
K
-.Step 2.
Initialize the operation timet of the urban rail transit train, and set t
0
=
T
m
i
n. According to the minimum and maximum time in the data, T
m
i
n
,
T
m
a
x are determined, and discretized unit of time is ∇
t. Then let k
=
1
,
r
=
0.Step 3.
In the case oft
=
t
0
+
r
∗
∇
t
(
r
=
0,1
,
2
…
r
m
a
x
)
∈
[
T
m
i
n
,
T
m
a
x
], we choose the minimum energy speed profile C
t
m
i
n from the data set, and begin to adjust the velocity sequence. The adjustment process is as follows: assume that the e
k
+
k
=
1,2
…
.
K importance degree corresponds to v
i
-
s
i, then adjusted speed v
i is v
i
∧
=
v
i
+
g
∗
σ
(
g
=
g
m
i
n
…
0,1
,
2
…
g
m
a
x
) (g
m
i
n, g
m
a
x, v
i
,
m
i
n
∗, and v
i
,
m
a
x
∗ should meet acceleration constraints and speed constraints). To ensure the train can reach the station, displacement change caused by adjusting v
i is ∇
s
i
∧ (in formula (12)), which must be offset by another displacement change ∇
s
j
- (in formula (13)) in different positions. As shown in Figure 12, we choose the speed v
j at (e
k
-
k
=
1,2
…
.
K corresponds to v
j) to offset the displacement change.Figure 12
Explanation of changes of velocity and displacement.Step 4.
Then, we can get a new profile after adjustment ofv
i and v
j. Support vector machines regression algorithm (SVR) module (Section 5.1.2) is used to calculate the energy consumption. We adjust the velocity until g
=
g
m
a
x and get the minimum energy consumption E
t
,
k
m
i
n during the adjustment process and the corresponding speed v
i
∧. Then, let v
i
=
v
i
∧ and v
j
=
v
j
∧.Formulas (12) and (13) show the calculation of ∇
s
i
∧ and ∇
s
j
- where velocity changes are ∇
v
i
∧ and ∇
v
i
-. To ensure the balance of displacement, let ∇
s
i
∧
=
∇
s
j
-. (12)
∇
s
i
∧
=
∇
v
i
∧
∗
t
i
-
-
t
i
-
1
-
2
+
∇
v
i
∧
∗
t
i
+
1
-
-
t
i
-
2
=
∇
v
i
∧
∗
t
i
+
1
-
-
t
i
-
1
-
2
=
v
i
∧
-
v
i
t
i
+
1
-
-
t
i
-
1
-
2
(13)
∇
s
j
-
=
∇
v
j
-
∗
t
j
-
-
t
j
-
1
-
2
+
∇
v
j
-
∗
t
j
+
1
-
-
t
j
-
2
=
∇
v
j
-
∗
t
j
+
1
-
-
t
j
-
1
-
2
=
v
j
-
-
v
j
t
j
+
1
-
-
t
j
-
1
-
2Step 5.
Ifk
=
K, then go to Step 6; if k
=
k
+
1, repeat Step 3.Step 6.
Ift
=
T
m
a
x, then go to Step 7; if r
=
r
+
1, repeat Step 3.Step 7.
Get all the energy consumptionE
t
,
K
m
i
n
,
t
∈
[
T
m
i
n
,
T
m
a
x
]. Then, M
i
n
E
=
m
i
n
t
E
t
,
K
m
i
n
,
K
=
m
∗
n
/
100
,
t
∈
[
T
m
i
n
,
T
m
a
x
].Finally, algorithm flow is shown in Figure13.Figure 13
Algorithm flow.


## 5.1. Energy Consumption Calculation Based on Machine Learning Algorithm

From the view of data-driven method, urban rail transit train runs within each section and produces a traction speed profile that corresponds to an energy consumption value. Although the factors affecting the energy consumption of each train are not only related to the speed profile, the external factors are determined once the operational section is fixed. Moreover, the transmission characteristic of the train is determined when the type of train is selected; then the energy consumption is only related to the speed profile during the traction process. Therefore, the speed profile becomes the key to the energy consumption of train traction.In this paper, two typical machine learning algorithms (RFR and SVR) are introduced, where RFR is utilized to get velocity points’ importance degrees in different positions, which can be responsible for obtaining these pairs space-speed with a major contribution to the energy consumption. And, SVR is employed to calculate the energy consumption of the profile. The programming environment is Python 3 and its machine learning module is scikit-learn.


### 5.1.1. Random Forest Regression (RFR) Algorithm Module

Random forest is a kind of ensemble learning algorithm, which uses multiple trees to train and predict a classifier, and also can be used for regression [40]. Based on decision trees combined with aggregation and bootstrap ideas, random forests were introduced by Breiman in 2001, which added an additional layer of randomness to bagging. In addition to constructing each tree using a different bootstrap sample of the data, random forests change how the classification or regression trees are constructed. They are a powerful nonparametric statistical method allowing consideration in a single and versatile framework regression problem [41]. The random forest optionally produces two additional pieces of information: a measure of the importance of the predictor variables and a measure of the internal structure of the data (the proximity of different data points between one and another). In this paper, we can take advantages of this module to get velocity points’ importance degree in different positions which can be used in heuristic solution process for model.Evaluation and Analysis of RFR. In the utilization of RFR algorithm, two important parameters should be calibrated: the number of split attributes (Mtry) and number of decision trees (Ntree). For simplicity, the enumeration method is used to traverse the two parameters. The convergence process is shown in Figure 7 over ten experiments. We can see that, when Ntree≥50, the average error is close to 0.1kwh. For different Mtrys, errors are shown in Figure 8(a), and there is an acceptable convergence range in Figure 8(b). When the Mtry=2 or 3, the error is minimal. Therefore, the optimal parameter combination used in this paper is Mtry=2 or 3 and Ntree≥50. By using the FR algorithm, the traction energy consumption evaluation average error is less than 0.1kwh and within range of 1%.Figure 7
The error values at different Ntrees.Figure 8
Convergence process and errors in RFR. (a) Errors in different Mtrys. (b) Convergence range.
(a)
(b)In addition to the high precision evaluation ability, we also get importance degrees of the velocity in different displacements during the traction energy consumption of the urban rail transit. We can find that the speed at which position is more significant to the energy consumption in a section, which indicates contributions to energy consumption of pairs space-speed. For instance, in the section of MingTombs-Changpingxishankou, section length is 1230 m, the importance degrees at different positions are shown in Figure9.Figure 9
Importance of velocity at different locations in the section.


### 5.1.2. Support Vector Machine Regression (SVR) Algorithm Module

Support vector machine (SVM) algorithm is from statistical learning theory (SLT), which is based on the structural risk minimization principle that can avoid excessive learning problems and ensure the generalization ability of the model. In essence, it can solve the convex quadratic programming problem and avoid falling into the local minimum. It can be applied not only to classification problems but also to the case of regression [42]. Therefore, it can be divided into support vector classification (SVC) and support vector regression (SVR). Because of its solid theoretical foundation and its complete theoretical derivation, support vector machine is an effective tool in dealing with small samples, nonlinear, local issues. In this paper, it is applied to calculate the energy consumption based on real data.Before using the SVR, the first step requires the determination of the kernel functions. The second step is to optimize parameters corresponding to different kernel functions. In this paper, three typical kernel functions are verified: radial basis kernel function (RBF), linear kernel function (LINEAR), and polynomial kernel function (POLY).(
1
) For RBF, calibration parameters include C penalty factor and G
a
m
m
a value. As shown in Figure 10(a), convergence rate of RBF is very fast. When C
≥ 20, the error will drop to a lower level. As C
≥ 100, the average error of traction energy consumption can reach about 0.1kwh. The best combination of parameters is C
≥
30, and G
a
m
m
a
=
3.Figure 10
Convergence process in different kernel functions. (a) SVR-RBF-Gamma. (b) SVR-LINEAR. (c) SVR-POLY.(
2
) For LINEAR, calibration parameter is C penalty factor. As shown in Figure 10(b), the convergence is slow. When C
≥ 900, the average error of traction energy consumption also can reach about 0.1kwh, which means that it will take a little longer time to reach minimum errors.(
3
) For POLY, calibration parameter is C penalty factor. As shown in Figure 10(c), average error is fluctuating up-down at 0.1Kwh and not stable, which fails to achieve better convergence results.Comparing the performance of the three kernel functions, average error of the RBF kernel function is the best, which means that the traction energy consumption can be calculated under the optimal parameter conditions.


### 5.1.3. Analysis of the Two Machine Learning Algorithms

For RFR algorithm, stable performance is in the data set, and the evaluation results are satisfactory. At the same time, the more momentous point is that the importance degrees of the velocity points in different positions can be sorted, which will be a valid guiding to the optimization control of the speed profile. For example, we can adjust the speed with high importance degree in the speed profile optimization process. As for the SVR algorithm, although the performance is not good in some kernel conditions, the ability to calculate in the RBF kernel function is also serviceable enough. For optimizing the speed profile of an urban rail transit train, we should find a speed profile that is not less than the existing energy consumption or is even lower than the existing energy consumption. However, the RFR algorithm has a fatal flaw: random forest cannot make the output beyond the range of data set, which may lead to overfitting in modeling of some specific data with noise. Therefore, the design of urban rail transit speed profile optimization algorithms could be beneficial to the combination virtues of the SVR and RFR.


## 5.1.1. Random Forest Regression (RFR) Algorithm Module

Random forest is a kind of ensemble learning algorithm, which uses multiple trees to train and predict a classifier, and also can be used for regression [40]. Based on decision trees combined with aggregation and bootstrap ideas, random forests were introduced by Breiman in 2001, which added an additional layer of randomness to bagging. In addition to constructing each tree using a different bootstrap sample of the data, random forests change how the classification or regression trees are constructed. They are a powerful nonparametric statistical method allowing consideration in a single and versatile framework regression problem [41]. The random forest optionally produces two additional pieces of information: a measure of the importance of the predictor variables and a measure of the internal structure of the data (the proximity of different data points between one and another). In this paper, we can take advantages of this module to get velocity points’ importance degree in different positions which can be used in heuristic solution process for model.Evaluation and Analysis of RFR. In the utilization of RFR algorithm, two important parameters should be calibrated: the number of split attributes (Mtry) and number of decision trees (Ntree). For simplicity, the enumeration method is used to traverse the two parameters. The convergence process is shown in Figure 7 over ten experiments. We can see that, when Ntree≥50, the average error is close to 0.1kwh. For different Mtrys, errors are shown in Figure 8(a), and there is an acceptable convergence range in Figure 8(b). When the Mtry=2 or 3, the error is minimal. Therefore, the optimal parameter combination used in this paper is Mtry=2 or 3 and Ntree≥50. By using the FR algorithm, the traction energy consumption evaluation average error is less than 0.1kwh and within range of 1%.Figure 7
The error values at different Ntrees.Figure 8
Convergence process and errors in RFR. (a) Errors in different Mtrys. (b) Convergence range.
(a)
(b)In addition to the high precision evaluation ability, we also get importance degrees of the velocity in different displacements during the traction energy consumption of the urban rail transit. We can find that the speed at which position is more significant to the energy consumption in a section, which indicates contributions to energy consumption of pairs space-speed. For instance, in the section of MingTombs-Changpingxishankou, section length is 1230 m, the importance degrees at different positions are shown in Figure9.Figure 9
Importance of velocity at different locations in the section.


## 5.1.2. Support Vector Machine Regression (SVR) Algorithm Module

Support vector machine (SVM) algorithm is from statistical learning theory (SLT), which is based on the structural risk minimization principle that can avoid excessive learning problems and ensure the generalization ability of the model. In essence, it can solve the convex quadratic programming problem and avoid falling into the local minimum. It can be applied not only to classification problems but also to the case of regression [42]. Therefore, it can be divided into support vector classification (SVC) and support vector regression (SVR). Because of its solid theoretical foundation and its complete theoretical derivation, support vector machine is an effective tool in dealing with small samples, nonlinear, local issues. In this paper, it is applied to calculate the energy consumption based on real data.Before using the SVR, the first step requires the determination of the kernel functions. The second step is to optimize parameters corresponding to different kernel functions. In this paper, three typical kernel functions are verified: radial basis kernel function (RBF), linear kernel function (LINEAR), and polynomial kernel function (POLY).(
1
) For RBF, calibration parameters include C penalty factor and G
a
m
m
a value. As shown in Figure 10(a), convergence rate of RBF is very fast. When C
≥ 20, the error will drop to a lower level. As C
≥ 100, the average error of traction energy consumption can reach about 0.1kwh. The best combination of parameters is C
≥
30, and G
a
m
m
a
=
3.Figure 10
Convergence process in different kernel functions. (a) SVR-RBF-Gamma. (b) SVR-LINEAR. (c) SVR-POLY.(
2
) For LINEAR, calibration parameter is C penalty factor. As shown in Figure 10(b), the convergence is slow. When C
≥ 900, the average error of traction energy consumption also can reach about 0.1kwh, which means that it will take a little longer time to reach minimum errors.(
3
) For POLY, calibration parameter is C penalty factor. As shown in Figure 10(c), average error is fluctuating up-down at 0.1Kwh and not stable, which fails to achieve better convergence results.Comparing the performance of the three kernel functions, average error of the RBF kernel function is the best, which means that the traction energy consumption can be calculated under the optimal parameter conditions.


## 5.1.3. Analysis of the Two Machine Learning Algorithms

For RFR algorithm, stable performance is in the data set, and the evaluation results are satisfactory. At the same time, the more momentous point is that the importance degrees of the velocity points in different positions can be sorted, which will be a valid guiding to the optimization control of the speed profile. For example, we can adjust the speed with high importance degree in the speed profile optimization process. As for the SVR algorithm, although the performance is not good in some kernel conditions, the ability to calculate in the RBF kernel function is also serviceable enough. For optimizing the speed profile of an urban rail transit train, we should find a speed profile that is not less than the existing energy consumption or is even lower than the existing energy consumption. However, the RFR algorithm has a fatal flaw: random forest cannot make the output beyond the range of data set, which may lead to overfitting in modeling of some specific data with noise. Therefore, the design of urban rail transit speed profile optimization algorithms could be beneficial to the combination virtues of the SVR and RFR.


## 5.2. Optimization Process

Form the view of discrete train speed profile optimization, the key problem is how to design a method to get a more energy-efficient profile; thus a group of combinationsv
i
-
s
i
(
i
=
0,1
…
n
) should be found. Velocity v
i in every position can be in a range, and the number of v
i
-
s
i
(
i
=
0,1
…
n
) combinations will be beyond imagination. It is necessary to discretize the speed changing value. Thus, there should be a step size used for the speed adjustment. A simple and effective step size is the unit from recording instrument (in our experiment, it is 0.001km/h). Further, a heuristic process can be proposed to reduce the combinations: we can utilize important degree from RFR to adjust the velocity with fixed order. Then, energy-saving profile will be easier to get by the heuristic process. As shown in Figure 11, in one operation section, of the real-world data, there are many profiles under the same running time but with different energy consumptions. Under every running time condition, we can try to find a satisfactory profile at this fixed running time. Then, the best of them with different fixed running time is taken as the optimal solution. Based on this, we develop an integrated greedily heuristic algorithm combined with RFR and SVR.Figure 11
Distribution of solutions.Parameters
I
+: set of index values corresponding to the speed at which the importance degree is arranged in descending order.
I
-: set of index values corresponding to the speed at which the importance degree is arranged in ascending order.
I
(
k
)
+: in descending order, the speed index value corresponding to the k
t
h importance degree.
I
(
k
)
-: in ascending order, the speed index value corresponding to the k
t
h importance degree.Step 1.
In the case of optimal parameters, random forest regression (RFR) Algorithm Module (Section5.1.1)) is used to obtain the importance degree of speed series v
i
-
s
i. Then, sort them (because the importance degrees of v
0
-
s
0.  v
n
-
s
n are zero, they are excluded) in descending order. And the K speed sequences v
k
+
-
s
k
+ of the previous m%(K
=
n
∗
m
/
100) are selected. For the corresponding importance degree e
k
+
(
1
≤
k
≤
K
), we can get e
1
+
≥
e
2
+
…
≥
e
k
+
…
≥
e
K
+. Then, in ascending order, similarly, the K speed sequences v
k
-
-
s
k
- of the previous m% are selected, and get e
1
-
≤
e
2
-
…
≤
e
k
-
…
≤
e
K
-.Step 2.
Initialize the operation timet of the urban rail transit train, and set t
0
=
T
m
i
n. According to the minimum and maximum time in the data, T
m
i
n
,
T
m
a
x are determined, and discretized unit of time is ∇
t. Then let k
=
1
,
r
=
0.Step 3.
In the case oft
=
t
0
+
r
∗
∇
t
(
r
=
0,1
,
2
…
r
m
a
x
)
∈
[
T
m
i
n
,
T
m
a
x
], we choose the minimum energy speed profile C
t
m
i
n from the data set, and begin to adjust the velocity sequence. The adjustment process is as follows: assume that the e
k
+
k
=
1,2
…
.
K importance degree corresponds to v
i
-
s
i, then adjusted speed v
i is v
i
∧
=
v
i
+
g
∗
σ
(
g
=
g
m
i
n
…
0,1
,
2
…
g
m
a
x
) (g
m
i
n, g
m
a
x, v
i
,
m
i
n
∗, and v
i
,
m
a
x
∗ should meet acceleration constraints and speed constraints). To ensure the train can reach the station, displacement change caused by adjusting v
i is ∇
s
i
∧ (in formula (12)), which must be offset by another displacement change ∇
s
j
- (in formula (13)) in different positions. As shown in Figure 12, we choose the speed v
j at (e
k
-
k
=
1,2
…
.
K corresponds to v
j) to offset the displacement change.Figure 12
Explanation of changes of velocity and displacement.Step 4.
Then, we can get a new profile after adjustment ofv
i and v
j. Support vector machines regression algorithm (SVR) module (Section 5.1.2) is used to calculate the energy consumption. We adjust the velocity until g
=
g
m
a
x and get the minimum energy consumption E
t
,
k
m
i
n during the adjustment process and the corresponding speed v
i
∧. Then, let v
i
=
v
i
∧ and v
j
=
v
j
∧.Formulas (12) and (13) show the calculation of ∇
s
i
∧ and ∇
s
j
- where velocity changes are ∇
v
i
∧ and ∇
v
i
-. To ensure the balance of displacement, let ∇
s
i
∧
=
∇
s
j
-. (12)
∇
s
i
∧
=
∇
v
i
∧
∗
t
i
-
-
t
i
-
1
-
2
+
∇
v
i
∧
∗
t
i
+
1
-
-
t
i
-
2
=
∇
v
i
∧
∗
t
i
+
1
-
-
t
i
-
1
-
2
=
v
i
∧
-
v
i
t
i
+
1
-
-
t
i
-
1
-
2
(13)
∇
s
j
-
=
∇
v
j
-
∗
t
j
-
-
t
j
-
1
-
2
+
∇
v
j
-
∗
t
j
+
1
-
-
t
j
-
2
=
∇
v
j
-
∗
t
j
+
1
-
-
t
j
-
1
-
2
=
v
j
-
-
v
j
t
j
+
1
-
-
t
j
-
1
-
2Step 5.
Ifk
=
K, then go to Step 6; if k
=
k
+
1, repeat Step 3.Step 6.
Ift
=
T
m
a
x, then go to Step 7; if r
=
r
+
1, repeat Step 3.Step 7.
Get all the energy consumptionE
t
,
K
m
i
n
,
t
∈
[
T
m
i
n
,
T
m
a
x
]. Then, M
i
n
E
=
m
i
n
t
E
t
,
K
m
i
n
,
K
=
m
∗
n
/
100
,
t
∈
[
T
m
i
n
,
T
m
a
x
].Finally, algorithm flow is shown in Figure13.Figure 13
Algorithm flow.


## 6. Numerical Experiment

### 6.1. Section Parameters

Section Parameters
S
e
c
t
i
o
n
a
l
l
e
n
g
t
h
(
s
n
): 1230
m.
S
p
e
e
d
l
i
m
i
t
s
(
S
L
): (
1
)
0
-
200
m
,
S
L
=
60
k
m
/
h
(
2
)
200
m
-
1100
m
,
S
L
=
80
k
m
/
h
(
3
)
1100
m
-
1230
m
,
S
L
=
50
k
m
/
h.
A
c
c
e
l
e
r
a
t
i
o
n: a
m
a
x
=
-
a
m
i
n
=
1.5
m
/
s
2.
O
p
e
r
a
t
i
o
n
t
i
m
e: T
m
i
n
=
95.4
s, T
m
a
x
=
103.4
(
s
).We take Changping Line MingTombs-Changpingxishankou section of down direction as a numerical experiment to explain the optimization process, and the section parameters are listed as above. And there are two cases in different intervals. A complete operation state is showed in Figure14.Figure 14
Train operation state.


### 6.2. Optimization Result

Case 1.
s
i
(
i
=
0,1
…
n
) is set as an uniform interval of 5 m, and let v
0
=
v
246
=
0, s
0
=
0
,
s
246
=
1230. The operation time is 103.4s. The results after optimization are shown in Figure 15. We can see that the optimal profile is not smooth. It suddenly increases or decreases in some places. Apparently, the availability of the optimized profile is not enough.Figure 15
Optimization result with small intervals.Case 2.
s
i
(
i
=
0,1
…
n
) is set as an uniform interval of 50 m, and let v
0
=
v
26
=
0, s
0
=
0
,
s
26
=
1230. Figure 16 shows the optimal results when m
=
50
% (showed in Figure 16(a)) and m
=
100
% (showed in Figure 16(b)). In this case, the operation time is also 103.4s. The optimized energy consumption can be reduced by 0.65 kwh. We can see that the speed profile is much smoother than Case 1 with rate of energy reduction is 3.1
%
(
0.65
/
21
∗
100
%
). In Figure 16(a), for m=50%, after optimization, the acceleration stage is slightly flat. However, in Figure 16(b), when m=100%, whole speed profile is flatter compared to the original profile, and it is more valuable in practice.Figure 16
Optimization results with big intervals. (a) m=50%. (b) m=100%.
(a)
(b)Operation sections with different distances should not have the same discrete interval. For longer section, the interval could be bigger. For example, distance of Xi’erqi-Life Science Park is 5455 m, and interval could be 200 m. In addition, the comparison of profile before and after optimization is shown in Figures17(a)–17(j). Optimization results of other operation sections are listed in Table 6. We can see that, in some section, the maximum energy saving is 5.08% (in the section Shahe to Shahe University Park), which is a good performance. And, for a 31.9km length with 12 stations train line, energy saving is 2.84%. The improvement may look modest when compared with previous researches (most claim saving energy above 4%). However, our improvement is compared with a real-world result that had already been imposed with an optimal control (traditional train optimal control with on the basis of Pontryagin maximum principle). There is an ATO (automatic train system, which is equipped with optimal control) in Beijing Changping Line and Yizhuang Line. Yizhuang Line and Changping Line have some similar features, train type, number of organized group, passenger intensity, power supply mode, and so on. A well-designed method in real world that is applied into Yizhuang Line can achieve average saving energy blow 3% from the operator’s statement. Therefore, the improvement based on an ATO profile which makes it look modest is reasonable. Besides, for different section, there are different improvements. The results may be triggered by many factors, like different section external environments (radius of curve, slope, air humidity, and so on). The optimized control effects in different sections are key to the room for improvement. If the room for improvement is limited, the real improvement may be also limited. Therefore, there is no quantitative result to illustrate the different improvements in each section.Table 6
Optimization results of other sections.
Section name
Minimum energy consumption of actual data(KWh)
After optimization (KWh)
Net energy saving(KWh)
Energy saving (%)
Section length(m)
interval(m)
Xi’erqi-Life Science Park
28
26.94
1.06
3.79
5455
200
Life Science Park-Zhuxinzhuang
19
18.44
0.56
2.95
2405
100
Zhuxinzhaung-Gonghuacheng
19
18.36
0.64
3.39
3810
200
Gonghuacheng-Shahe
20
19.13
0.87
4.35
2037
100
Shahe-Shahe University Park
22
20.88
1.12
5.08
1967
100
Shahe University Park-Nanshao
30
29.45
0.55
1.83
5364
200
Nanshao-Beishaowa
14
13.55
0.45
3.21
2003
100
Beishawa-Changping dongguan
16
15.66
0.34
2.13
1687
100
Changping dongguan-Changping
22
21.58
0.42
1.91
2439
100
Changping-MingTombs
39
38.56
0.44
1.13
3522
200
MingTombs-Changpingxishankou
21
20.35
0.65
3.10
1230
50
Total
250
242.9
7.1
2.84
31964
-
Average value
22.73
22.08
0.65
-
-
-Figure 17
The obtained profiles in different sections. Section (a)–(j) are listed in Table6.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)


## 6.1. Section Parameters

Section Parameters
S
e
c
t
i
o
n
a
l
l
e
n
g
t
h
(
s
n
): 1230
m.
S
p
e
e
d
l
i
m
i
t
s
(
S
L
): (
1
)
0
-
200
m
,
S
L
=
60
k
m
/
h
(
2
)
200
m
-
1100
m
,
S
L
=
80
k
m
/
h
(
3
)
1100
m
-
1230
m
,
S
L
=
50
k
m
/
h.
A
c
c
e
l
e
r
a
t
i
o
n: a
m
a
x
=
-
a
m
i
n
=
1.5
m
/
s
2.
O
p
e
r
a
t
i
o
n
t
i
m
e: T
m
i
n
=
95.4
s, T
m
a
x
=
103.4
(
s
).We take Changping Line MingTombs-Changpingxishankou section of down direction as a numerical experiment to explain the optimization process, and the section parameters are listed as above. And there are two cases in different intervals. A complete operation state is showed in Figure14.Figure 14
Train operation state.


## 6.2. Optimization Result

Case 1.
s
i
(
i
=
0,1
…
n
) is set as an uniform interval of 5 m, and let v
0
=
v
246
=
0, s
0
=
0
,
s
246
=
1230. The operation time is 103.4s. The results after optimization are shown in Figure 15. We can see that the optimal profile is not smooth. It suddenly increases or decreases in some places. Apparently, the availability of the optimized profile is not enough.Figure 15
Optimization result with small intervals.Case 2.
s
i
(
i
=
0,1
…
n
) is set as an uniform interval of 50 m, and let v
0
=
v
26
=
0, s
0
=
0
,
s
26
=
1230. Figure 16 shows the optimal results when m
=
50
% (showed in Figure 16(a)) and m
=
100
% (showed in Figure 16(b)). In this case, the operation time is also 103.4s. The optimized energy consumption can be reduced by 0.65 kwh. We can see that the speed profile is much smoother than Case 1 with rate of energy reduction is 3.1
%
(
0.65
/
21
∗
100
%
). In Figure 16(a), for m=50%, after optimization, the acceleration stage is slightly flat. However, in Figure 16(b), when m=100%, whole speed profile is flatter compared to the original profile, and it is more valuable in practice.Figure 16
Optimization results with big intervals. (a) m=50%. (b) m=100%.
(a)
(b)Operation sections with different distances should not have the same discrete interval. For longer section, the interval could be bigger. For example, distance of Xi’erqi-Life Science Park is 5455 m, and interval could be 200 m. In addition, the comparison of profile before and after optimization is shown in Figures17(a)–17(j). Optimization results of other operation sections are listed in Table 6. We can see that, in some section, the maximum energy saving is 5.08% (in the section Shahe to Shahe University Park), which is a good performance. And, for a 31.9km length with 12 stations train line, energy saving is 2.84%. The improvement may look modest when compared with previous researches (most claim saving energy above 4%). However, our improvement is compared with a real-world result that had already been imposed with an optimal control (traditional train optimal control with on the basis of Pontryagin maximum principle). There is an ATO (automatic train system, which is equipped with optimal control) in Beijing Changping Line and Yizhuang Line. Yizhuang Line and Changping Line have some similar features, train type, number of organized group, passenger intensity, power supply mode, and so on. A well-designed method in real world that is applied into Yizhuang Line can achieve average saving energy blow 3% from the operator’s statement. Therefore, the improvement based on an ATO profile which makes it look modest is reasonable. Besides, for different section, there are different improvements. The results may be triggered by many factors, like different section external environments (radius of curve, slope, air humidity, and so on). The optimized control effects in different sections are key to the room for improvement. If the room for improvement is limited, the real improvement may be also limited. Therefore, there is no quantitative result to illustrate the different improvements in each section.Table 6
Optimization results of other sections.
Section name
Minimum energy consumption of actual data(KWh)
After optimization (KWh)
Net energy saving(KWh)
Energy saving (%)
Section length(m)
interval(m)
Xi’erqi-Life Science Park
28
26.94
1.06
3.79
5455
200
Life Science Park-Zhuxinzhuang
19
18.44
0.56
2.95
2405
100
Zhuxinzhaung-Gonghuacheng
19
18.36
0.64
3.39
3810
200
Gonghuacheng-Shahe
20
19.13
0.87
4.35
2037
100
Shahe-Shahe University Park
22
20.88
1.12
5.08
1967
100
Shahe University Park-Nanshao
30
29.45
0.55
1.83
5364
200
Nanshao-Beishaowa
14
13.55
0.45
3.21
2003
100
Beishawa-Changping dongguan
16
15.66
0.34
2.13
1687
100
Changping dongguan-Changping
22
21.58
0.42
1.91
2439
100
Changping-MingTombs
39
38.56
0.44
1.13
3522
200
MingTombs-Changpingxishankou
21
20.35
0.65
3.10
1230
50
Total
250
242.9
7.1
2.84
31964
-
Average value
22.73
22.08
0.65
-
-
-Figure 17
The obtained profiles in different sections. Section (a)–(j) are listed in Table6.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)


## 7. Conclusion

Reducing train traction energy consumption is one of the efficient ways to cut energy cost in urban rail transit systems. And to protect the environment, the optimization of urban rail transit traction energy conservation has been a significant task in urban rail transit operation and management. The traction energy consumption of a single train is related to the speed profile between stations. When energy-efficient profiles are applied in every section, there will be a positive effect on reducing energy consumption of the urban rail transit system. Therefore, train speed profile optimization is a fundamental work.In this paper, the speed profile optimization problem is discretized, and the decision variables of the speed profile become a series of space-speed points. From this viewpoint, a data-driven urban rail transit train speed profile optimization model (DDOM) is proposed to describe the relationship between profiles and energy consumption. Two machine learning algorithms, namely, random forest regression (RFR) and support vector regression (SVR), are taken into account. RFR is applied to get the important degree of velocity in positions, and the degree is utilized as heuristic information to decide the optimization order of velocity in different positions. SVR is used to calculate energy consumption of profiles with a high accuracy (95%). Combined with the advantages of the two algorithms, an integrated heuristic greedy optimization algorithm is developed to solve the model, which can reduce energy consumption by 2.84%. In some theory research, energy conservation percentage is higher than our results. However, few are verified based on the real-world data. Furthermore, our methods may be quite simple and can be applied to practice easily.Nevertheless, because the data samples are far from enough, when adjusting velocity in different positions to get a new profile in the optimization process, range of velocity change is limited. There is still some room for an improvement on the basis of the optimization results. Although there are many different views, the data-driven method is new to the problem, and applying machine learning algorithms to the field of energy saving in urban rail transit is the innovation. Future research can be focused on the following areas. Firstly, a further improved algorithm for a different heuristic strategy could be studied. For instance, based on the data machine learning method, the regenerative electricity consumption in the braking process may be reused in the trains from neighboring sections. Thus, instead of optimizing one single train speed profile in each section separately, train speed profiles from neighboring sections should be taken into account. Secondly, in the urban rail transit networks, if power supply in the network nodes (transfer stations) is transmitted from the same transformer substation, the energy-saving optimization of trains can be extended to the urban rail transit network.



---

*Source: 7258986-2019-05-02.xml*