# Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem

Authors: Yu Zhou; Leishan Zhou; Yun Wang
Journal: Discrete Dynamics in Nature and Society
 (2014)

---

## Abstract

High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.


---

## Body

## 1. Introduction

During the last two decades, China has seen dramatic increase in people movements which have grown up to 380 billion in 2013 [1]. With the eruptible increase, the problem of travel difficulty has become increasingly prominent in China. To solve this long-standing problem, great efforts have been paid to improve the transport capacity. One of the most impressive achievements is the huge development of high-speed railway (HSR) which is widely acknowledged to be of high capacity, high efficiency, and low energy [2]. Until 2014, China has the longest HSR network up to 11 thousand km in service with a rapid growth rate of 9.6% [1, 3]. Moreover, passenger volume of HSR has reached up to 54 million per month which is nearly double of air transport [4]. However, the rapid growth rate of HSR is far from sufficient in line with the explosive increasing demand of passenger transport. Although HSR development is a good way to mitigate the problem of insufficient transport capacity supply, due to the high acquisition cost of electric multiple unit (EMU) which is the main vehicle of HSR, it is impossible for the decision-making departments to purchase enough EMU so as to satisfy the explosive needs. Therefore, to improve the utilization efficiency of EMU is one of the most important means to alleviate the transportation difficulties problem.EMU circulation scheduling is one of the key factors that influence the EMU utilization efficiency. Moreover, the difficulty of EMU circulation scheduling lies in the maintenance and train diagram constraints [5]. Extensive research has been carried out worldwide to explore the EMU circulation scheduling problem. In Europe, previous studies [6–10] have been largely focused on optimal allocation of EMU to carry out train trip task by coupling and uncoupling operations to meet the passengers’ seat demand. A further study of railway rolling stock planning was carried out by Maróti [11] in which a model was built based on integer programming and solved with CPLEX. The focus of their study was the arrangements of coupling and uncoupling under the precondition of meeting passengers’ demand. However, the situation in China is quite different from foreign countries. Because the CRH series trains are used as a whole, the operation problem of coupling and uncoupling is not considered. Therefore, in China, the main research priority is how to complete a given transport task with fewer EMUs and maintenance costs.Previous research has found that the essence of EMU circulation scheduling problem is combinatorial optimization problem with a mass of constraints [12]. The results concluded that it was also a typical NP hard problem which could not be directly solved by ready-made software. Therefore, a thought of heuristic algorithm is proposed to solve the EMU circulation scheduling problem. Zhao et al. [13] explored different ways of utilizing EMU and they found that utilizing EMU with uncertain railroad region was an efficient way. Nie et al. [14] converted the EMU scheduling problem to assignment problem without considering the maintenance constraint and the Hungarian algorithm was used to solve the problem. Hong et al. [15] drew an integer programming model which took maintenance and train diagram constraints into consideration and a two-step strategy was put forward to solve this problem. Zhao and Tomii [16] use the local search and backtracking techniques to get a better result of this problem. Based on the previous studies, Keyu [17] designed a large neighborhood local search algorithm to find a better solution. Much research has been committed to improving the basic genetic algorithm and the efficiency has been further enhanced based on the improved algorithms [18–20]. Some scholars argued that EMU circulation scheduling problem could be seen as the tsp problem with constraints [21–23]. They provided a brand-new method for the solution and ant colony algorithm began to be used.The majority of research on the solution of EMU circulation scheduling problem has applied modern intelligent optimization algorithms such as genetic algorithms, ant colony algorithm, and particle swarm optimization. The solving process in previous studies was always divided into two sections. However, they rarely considered the distance maintenance constraint in the first step of the solving process. This approach was of low efficiency and hard to be put into practice.The motivation of this paper is to develop an EMU utilization model based on the analysis of EMU circulation scheduling problem. Furthermore, an improved ant colony algorithm is proposed in this paper based on the previous studies. What makes this study unique is that both the efficiency of solving process and the quality of solution have a huge breakthrough compared with previous studies.The paper is organized as follows. Section2 introduces the definition of EMU circulation scheduling problem. In Section 3, the EMU utilization model was developed. Section 4 included the design of improved ant colony algorithm and the solution process. Then, a case was given to verify the feasibility of the model as well as improved algorithm in Section 5. Finally, Section 6 provides concluding remarks.


## 2. Statement of EMU Circulation Scheduling Problem

The task in the train diagram undertaken by each train is called a trip. As is shown in Figure1, only Station C is near the Inspection and Repair Depot which is equipped with the maintenance facilities and G1 to G8 represent eight trips, respectively. The ordered sets of trips undertaken by the same EMU during the period of two adjacent maintenances are called one EMU circulation. Figure 2 shows the EMU circulation scheduling based on the train diagram. From this figure, it is clear that two EMUs are sufficient to complete the task in Figure 1. In the first day, after EMU1 undertakes the trips G1, G4, G5, and G7, it stays in the Station C and completes the maintenance while EMU2 starts from Station C and then completes the tasks of G2, G3, G6, and G8. In the next day, EMU1 repeats the track of EMU2 in the first day and then returns back to Station A while EMU2 repeats the track of EMU1 in the first day and then also completes the maintenance in Station C. When EMU1 and EMU2 return to their departure stations, respectively, a circulation has been completed. It should be noted that there may be a number of different EMU operation schemes based on the same train diagram.Figure 1
Train diagram.Figure 2
EMU circulation scheduling.The definition of EMU circulation scheduling problem in China can be described as using several EMU circulations to carry out all trips in the given train diagram under the condition of meeting train diagram and maintenance constraints. Figure3 reveals three levels of this problem, namely, constraint layer, decision layer, and target layer.Figure 3
EMU circulation problem in China.(
1)  Constraint Layer. Constraint layer describes restrictions of EMU circulation scheduling problem including train diagram constraint, maintenance constraint, and other constraints.(a)
Train diagram constraint: the train diagram constraint requires that the circulation plan should contain all trips given in the train diagram. Furthermore, there are two kinds of technology time and the relationship between them should be satisfied. The first one is operation time which means the minimum preparation time for the next trip when the EMU completes a trip and arrives at the terminal station. The other one is dwell time which means the interval between two adjacent trips in the train diagram. As shown in Figure4(a), the dwell time between two trips satisfies the operation time and the connection can be realized while Figure 4(b) cannot. Figure 4 reveals that only when dwell time is greater than the operation time can the connection be realized.
(b)
Maintenance constraint: because of the high cost of EMU, the available EMUs are always scarce. Therefore, the utilization of available EMUs is extreme high strength which may possibly cause passenger safety problem. So EMUs must be overhauled according to a certain level when the travel distance reaches a specified standard. What is more, in China, EMUs are allocated to fixed EMU depot which causes that, to accept overhaul, EMUs must return back to their EMU depot. There are two kinds of maintenance standards including operation distance and the travel time. Based on different requirements of operation distance or the travel time, EMU maintenance is divided into five levels [24]. Additionally, in practical applications, 10% fluctuation compared with the standards can be accepted (e.g., CRH1 should be overhauled with Level 1 maintenance in the travel distance range of 3600 km to 4400 km). However, the maintenance periods of Level 2 to Level 5 are such long that generally they will not influence the compilation of the whole circulation plan. Therefore, in this study, only Level 1 maintenance is taken into consideration. Table 1 lists and defines the maintenance standards of different kinds of EMUs. And the maintenance time should not be less than 4 hours in order to guarantee the quality of maintenance.
(c)
Other constraints: except for the train diagram and maintenance constraints, there are also some other constraints: (1) the transportation capability based on the EMU circulation plan should satisfy the passenger travel demand; (2) the type of the EMUs should meet the regulation of China Railway Corporation; (3) to make the maintenance be carried out easier, the terminal station of circulation should be close to the Inspection and Repair Depot when the travel distance of EMU will soon reach the maintenance standard; (4) trains will occupy the arrival-departure track, storage siding, wheel repair line, or other fixed facilities when they are in the station or Inspection and Repair Depot. These factors also restrict the utilizing of the EMU.Table 1
Level 1 maintenance standard of EMU in China.
Type
CRH1
CRH2
CRH3
CRH5
Standard
4 × 103 km or 48 h
4 × 103 km or 48 h
4 × 103 km or 48 h
4 × 103 km or 48 hThe dwell time constraint.
(a)
(b)(
2)  Goal Layer. The main objective is to improve the utilization of EMU which means complete the given task with as few EMUs as possible. Meanwhile, another goal is to reduce maintenance costs by controlling the maintenance frequency. There are also some other objectives such as reducing empty EMU dispatching and balancing the utilization of the EMU. Because EMU acquisition and maintenance cost accounts for the highest ratio of the whole cost, reducing the using amount of EMUs and reducing maintenance frequency are chosen as the two targets of this study.(
3)  Decision Layer. The decision layer is the core content of this study. At the present stage, even though part of the computer aided decision has realized automation, most of the EMU circulation plans are still compiled by hand which will take a long time and energy even by experienced staff. Therefore, there is an urgent need to realize the automatic computer programming for the compilation of EMU circulation plan.


## 3. Mathematics Model

### 3.1. Model Assumption

To ensure the model feasible, the following basic assumptions are proposed.Assumption 1.
In China, most train diagrams of passenger dedicated line are drawn in pairs. Therefore, all train diagrams in this study are defined to be in pairs.Assumption 2.
In the process of continuation, it is presumed that there is only one type of EMU, because only the same types of EMU can connect with each other.Assumption 3.
In this paper, the EMUs are utilized with uncertain railroad region due to its advantages in efficiency [5].Assumption 4.
As mentioned before, maintenance standard includes operation distance and the travel time. However, due to the shortage of EMU resource, the everyday EMU operation mileage is such long that travel distance always reaches maintenance requirement before the travel time. Therefore, only the operation distance maintenance standard is taken into consideration in this study.


### 3.2. Model Building

The optimization model is based on a weighted directed graphG
(
V
,
E
,
W
), where V denotes the set of all trips; E denotes the set of connection, and W represents the set of connecting weight. Elements in the sets V, E, and W are defined as v
i, e
i
j, and w
i
j, respectively. The sets of E and W can be defined as follows:
(1)
E
=
{
e
i
j
∣
e
i
j
=
(
v
i
,
v
j
)
}
,
(2)
w
i
j
(
v
i
,
v
j
)
=
{
t
j
d
-
t
i
a
s
j
d
=
s
i
a
,
t
j
d
-
t
i
a
≥
t
i
j
1440
+
t
j
d
-
t
i
a
s
j
d
=
s
i
a
,
t
j
d
-
t
i
a
<
t
i
j
+
∞
s
j
d
≠
s
i
a
,
where v
i means trip i which contains seven attributes including train number n
i, departure station s
i
d, arrival station s
i
a, departure time t
i
d, arrival time s
i
a, distance s
j, and running time T
i; e
i
j denotes that trip i is connected to trip j; w
i
j is a weighted value to measure e
i
j. There are three cases of w
i
j values: when the arrival station of trip i is the same with the departure station of trip j and the dwell time t
j
d
-
t
i
a is bigger than the operation time t
i
j, it means that trip i can be connected with trip j and w
i
j
=
t
j
d
-
t
i
a when t
j
d
-
t
i
a is smaller than t
i
j; the trip j will wait until next day to connect trip i, so w
i
j
=
1440
+
t
j
d
-
t
i
a; else, w
i
j is defined as infinity which means that trip i cannot be connected to trip j.In this study, the optimization objective includes two parts, fewer EMUs and lower maintenance costs. The amount of EMUs equals the value that 1440 divides the total time of all trips. Therefore, the goal of fewer EMUs can be converted to less total time of all trips which includes both running time and connecting time. Moreover, the running time∑
1
n
T
i is unchanged which is given in the train diagram, so the goal of less total time is equivalent to make total connecting time smaller. No matter how long EMUs have travelled, once they are overhauled, the costs are the same. Therefore, due to the fixed cost of maintenance, the goal of lower maintenance costs means lowering the amount of maintenance.Based on the above analysis, the model can be stated as follows.Objective Function. Combinatorial optimization of the total connecting time and the amount of maintenance:
(3)
min
⁡
σ
1
∑
i
=
1
n
∑
j
=
1
n
x
i
j
w
i
j
+
σ
2
∑
i
=
1
n
∑
j
=
1
n
y
i
j
,
where σ
1 and σ
2 are weight coefficient of total connecting time and amount of maintenance, respectively; x
i
j and y
i
j are both bivariate. When trip i is connected with trip j by the same EMU, x
i
j is equal to one, otherwise zero. As shown in (4), the value of y
i
j is decided by x
i
j and R
i. Variable R
i is also bivariate and when the arrival station of trip i is near the Inspection and Repair Depot, the value of R
i is one, otherwise zero. Only when x
i
j
=
1, R
i
=
1, and maintenance standard has been reached, the value of y
i
j is one, otherwise zero:
(4)
x
i
j
,
R
i
∈
{
0,1
}
,
y
i
j
=
{
1
x
i
j
=
1
,
∑
s
i
≥
S
one
,
R
i
=
1
0
others.Restrictions. Constraint (5) restrains that the dwell time between trip i and trip j should be more than the operation time. In that case, EMU will be able to undertake next trip immediately after arriving at certain station:
(5)
w
i
j
≥
t
i
j
.
Constraint (6) describes that the dwell time between trip i and trip j should be longer than the maintenance time when accumulated travel distance of an EMU reaches the maintenance standard:
(6)
w
i
j
≥
T
one
when
∑
s
i
≥
S
one
,
where T
one denotes the time of maintenance Level 1; S
one denotes the distance standard of maintenance Level 1; s in set S
=
{
s
∣
s
=
1
,
…
,
m
} represents the station which contains arrival or departure trips.Constraint (7) restricts that each trip could only be carried out once by one EMU and each EMU could only carry out one trip when it arrives at certain station:
(7)
∑
i
=
1
n
x
i
j
=
1
∑
j
=
1
n
x
i
j
=
1
.
Constraint (8) is the basic requirements:
(8)
i
,
j
=
1,2
,
…
,
n
,
i
≠
j
∀
e
i
j
∈
E
∀
v
i
,
v
j
∈
V
.


## 3.1. Model Assumption

To ensure the model feasible, the following basic assumptions are proposed.Assumption 1.
In China, most train diagrams of passenger dedicated line are drawn in pairs. Therefore, all train diagrams in this study are defined to be in pairs.Assumption 2.
In the process of continuation, it is presumed that there is only one type of EMU, because only the same types of EMU can connect with each other.Assumption 3.
In this paper, the EMUs are utilized with uncertain railroad region due to its advantages in efficiency [5].Assumption 4.
As mentioned before, maintenance standard includes operation distance and the travel time. However, due to the shortage of EMU resource, the everyday EMU operation mileage is such long that travel distance always reaches maintenance requirement before the travel time. Therefore, only the operation distance maintenance standard is taken into consideration in this study.


## 3.2. Model Building

The optimization model is based on a weighted directed graphG
(
V
,
E
,
W
), where V denotes the set of all trips; E denotes the set of connection, and W represents the set of connecting weight. Elements in the sets V, E, and W are defined as v
i, e
i
j, and w
i
j, respectively. The sets of E and W can be defined as follows:
(1)
E
=
{
e
i
j
∣
e
i
j
=
(
v
i
,
v
j
)
}
,
(2)
w
i
j
(
v
i
,
v
j
)
=
{
t
j
d
-
t
i
a
s
j
d
=
s
i
a
,
t
j
d
-
t
i
a
≥
t
i
j
1440
+
t
j
d
-
t
i
a
s
j
d
=
s
i
a
,
t
j
d
-
t
i
a
<
t
i
j
+
∞
s
j
d
≠
s
i
a
,
where v
i means trip i which contains seven attributes including train number n
i, departure station s
i
d, arrival station s
i
a, departure time t
i
d, arrival time s
i
a, distance s
j, and running time T
i; e
i
j denotes that trip i is connected to trip j; w
i
j is a weighted value to measure e
i
j. There are three cases of w
i
j values: when the arrival station of trip i is the same with the departure station of trip j and the dwell time t
j
d
-
t
i
a is bigger than the operation time t
i
j, it means that trip i can be connected with trip j and w
i
j
=
t
j
d
-
t
i
a when t
j
d
-
t
i
a is smaller than t
i
j; the trip j will wait until next day to connect trip i, so w
i
j
=
1440
+
t
j
d
-
t
i
a; else, w
i
j is defined as infinity which means that trip i cannot be connected to trip j.In this study, the optimization objective includes two parts, fewer EMUs and lower maintenance costs. The amount of EMUs equals the value that 1440 divides the total time of all trips. Therefore, the goal of fewer EMUs can be converted to less total time of all trips which includes both running time and connecting time. Moreover, the running time∑
1
n
T
i is unchanged which is given in the train diagram, so the goal of less total time is equivalent to make total connecting time smaller. No matter how long EMUs have travelled, once they are overhauled, the costs are the same. Therefore, due to the fixed cost of maintenance, the goal of lower maintenance costs means lowering the amount of maintenance.Based on the above analysis, the model can be stated as follows.Objective Function. Combinatorial optimization of the total connecting time and the amount of maintenance:
(3)
min
⁡
σ
1
∑
i
=
1
n
∑
j
=
1
n
x
i
j
w
i
j
+
σ
2
∑
i
=
1
n
∑
j
=
1
n
y
i
j
,
where σ
1 and σ
2 are weight coefficient of total connecting time and amount of maintenance, respectively; x
i
j and y
i
j are both bivariate. When trip i is connected with trip j by the same EMU, x
i
j is equal to one, otherwise zero. As shown in (4), the value of y
i
j is decided by x
i
j and R
i. Variable R
i is also bivariate and when the arrival station of trip i is near the Inspection and Repair Depot, the value of R
i is one, otherwise zero. Only when x
i
j
=
1, R
i
=
1, and maintenance standard has been reached, the value of y
i
j is one, otherwise zero:
(4)
x
i
j
,
R
i
∈
{
0,1
}
,
y
i
j
=
{
1
x
i
j
=
1
,
∑
s
i
≥
S
one
,
R
i
=
1
0
others.Restrictions. Constraint (5) restrains that the dwell time between trip i and trip j should be more than the operation time. In that case, EMU will be able to undertake next trip immediately after arriving at certain station:
(5)
w
i
j
≥
t
i
j
.
Constraint (6) describes that the dwell time between trip i and trip j should be longer than the maintenance time when accumulated travel distance of an EMU reaches the maintenance standard:
(6)
w
i
j
≥
T
one
when
∑
s
i
≥
S
one
,
where T
one denotes the time of maintenance Level 1; S
one denotes the distance standard of maintenance Level 1; s in set S
=
{
s
∣
s
=
1
,
…
,
m
} represents the station which contains arrival or departure trips.Constraint (7) restricts that each trip could only be carried out once by one EMU and each EMU could only carry out one trip when it arrives at certain station:
(7)
∑
i
=
1
n
x
i
j
=
1
∑
j
=
1
n
x
i
j
=
1
.
Constraint (8) is the basic requirements:
(8)
i
,
j
=
1,2
,
…
,
n
,
i
≠
j
∀
e
i
j
∈
E
∀
v
i
,
v
j
∈
V
.


## 4. Ant Colony Algorithm

### 4.1. Traditional Ant Colony Algorithm

Ant colony algorithm (ACA) is an intelligence-optimized algorithm which is first proposed in 1992 [25]. ACA is an optimization method of distribution which advantages over three aspects [26]: firstly, ACA is a global optimization method which can be used for solving both the single objective and multiobjective optimization problems; secondly, ACA is appropriate for the discretization problems; thirdly, a positive feedback mechanism is used to obtain the optimal route through ceaselessly updating the pheromone. Therefore, due to the ability in finding optimal or near optimal solutions for many complex optimization problems, ant colony algorithm has been widely applied to various fields, such as the traveling salesman problem (TSP) [27–30], route optimization problem [31–34], traffic assignment problem [35, 36], crew scheduling problem [37–39], the network design problem [40], and many other classical combination optimization problems.The inspiration of ACA comes from food-seeking behavior of ants [41]. By simulating the process of ants foraging in the nature, ACA tactfully combines biomimetic algorithm and heuristic algorithm. ACA takes full advantage of the ants’ group ability that ants can find the shortest route from formicary to food by information transmission between individuals. Previous studies have found that group collaboration features of ants are communicated and coordinated by the pheromone which is a kind of volatile chemical left on the way back and forth [42]. When ants find a relatively short route, they will release the pheromone. Then, the higher the pheromone concentration is, the more attractive the route will be. Therefore, pheromone concentration on the shorter route will be even higher and all these processes form a positive-feedback loop. Eventually, ants on the multiple paths will gradually gather on the shortest route.A lot of studies have stated that the ACA is quite applicable to solve TSP problem [27, 43]. EMU circulation scheduling problem is similar to TSP problem [21, 44] which can be regarded as generalized TSP problem with some special constrains. Therefore, improved ACA is proposed to solve EMU circulation scheduling problem.As previously mentioned, lots of research has used the ACA to figure out the EMU circulation scheduling problem. The solving process can be concluded roughly as is shown in Figure5. In the first step, a whole circulation with short connection time can be obtained without distance maintenance constraint. Then, this circulation is divided into several segments with the consideration of maintenance constraint. In the second step, these segments are recombined and several new small circulations are obtained. However, artificial modification is usually needed as a supplement. This approach is low-efficient and the result is hard to be put into practice.Figure 5
Traditional ACA approach.


### 4.2. Improved Ant Colony Algorithm Design

To make solving process more efficient and results more accurate, an improved ACA is proposed and the solving process is shown in Figure6. A group of ants are designed to construct a feasible solution. An unvisited node list is set to gather the unvisited trips and another list to record the path that the ant has traveled. In each process of iteration, one ant is generated to search for the path with the consideration of maintenance constraints and train diagram constraints. When the total travel distance reaches the maintenance standard, it should be judged whether the circulation meets the requirements that the departure station of first trip in this circulation should near the Inspection and Repair Depot and the terminal station of last trip should be the same with the departure station of first trip. If it meets the requirements, this circulation should be recorded and then another ant should be generated to repeat the process above and search for the next circulation; else, if the requirements cannot be satisfied, the backtracking technique should be used to search for another circulation which can meet the requirements. Once the circulation based on the backtracking technique is obtained, it should be recorded and another ant will be generated; otherwise, empty EMU should be dispatched to complete the circulation which should also be recorded and then another ant will be generated. Such new ant should be generated until the unvisited node list is empty which means that iteration has been completed. Relative information should be updated and then next iteration begins.Figure 6
Improved ACA approach.In each process of iteration, each ant is corresponding with a circulation loop and the quantity of the ant is uncertain which is different from the traditional ACA approach with a fixed ant quantity in each process of iteration. After all iterations, the result is obtained. The new approach proposed in this study leads to higher-quality solutions and faster solving speed.Basic Mechanism and Rules. Path selection mechanism and pheromone update rule in our improved ACA are based on the classical ACA which can be described as follows.Equation (9) describes the probability that ants transfer from node i to node j while nodes mean trips in this study:
(9)
P
i
j
=
{
tau
(
i
,
j
)
α
eta
(
i
,
j
)
β
∑
j
=
1
,
j
≠
i
n
tau
(
i
,
j
)
α
eta
(
i
,
j
)
β
s
i
a
=
s
j
d
0
others
,
where tau
(
i
,
j
) denotes the amount of pheromone deposited on the connection relationship e
i
j which can also be called track attraction and it is assumed that pheromone amount in every route is equal at the initial moment; eta
(
i
,
j
) represents vision attraction which equals the reciprocal of w
i
j when ants move from node i to node j; α and β are the importance coefficient of track attraction and vision attraction, respectively.Equations (10) and (11) describe the update rule of pheromone remained on the path by ants at the end of each iteration:
(10)
tau
(
i
,
j
)
t
+
1
=
(
1
-
rho
)
×
tau
(
i
,
j
)
t
+
Delta
_
tau
(
i
,
j
)
(11)
Delta
_
tau
(
i
,
j
)
=
Q
total
_
time
,
where t means the iteration index; rho describes the evaporation coefficient of pheromone; Delta
_
tau
(
i
,
j
) is the increasing amount of pheromone in the connection relationship. If there is no ant passing through the arc from trip i to trip j, Delta
_
tau
(
i
,
j
) is equal to zero; else, it is equal to the ratio of Q and total
_
time, while total
_
time means the sum of all EMU connection time and Q is defined as constant.Preparation Work. To solve EMU circulation scheduling problem, some initial information and work should be prepared; namely,(1)
input basic data including train number, departure station, arrival station, distance, departure time, and arrival time,
(2)
calculate the connection time according to (2),
(3)
initialize the parameters including iteration timesN
C, current iteration index t, track attraction tau, vision attraction eta, α, β, Q, and rho,
(4)
group all the trips with the same departure station into setV
i, where i denotes the number of the departure station,
(5)
variable distance is defined to record the total travel distance of the ant while set pathant is defined to record the path that ants have traveled.Solution Procedure. After the preparation work, the framework of improved ant colony algorithm for EMU circulation scheduling problem can be described as the flowchart in Figure 7.(1)
Whent
<
N
C, it means that iterative process does not end. Variables ant and distance are needed to be initialized with value zero. Moreover, set V
i should be reset. Else, solution procedure ends and results will be outputted.
(2)
If setV
i
(
i
=
1,2
,
…
,
n
⊄
∅
), ant
=
ant
+
1, a trip v
m (assuming that the arrival station of v
m is j) will be selected randomly from V
i. Then, update distance to the sum of distance and distance v
m. Trip v
m needs to be added into set pathant. Else, turn to step 1 after updating tau
(
i
,
j
) according to (10).
(3)
Search in setV
j whose departure station is the same with the arrival station of trip v
m. Then, calculate the transfer probability according to (9) and use the roulette gamble to select next trip v
n connecting with the last trip v
m, where updated distance is equal to the sum of distance and distance v
n. If no trip can meet requirements, empty EMUs need to be dispatched to finish the connection and then turn to step 2.
(4)
If distance is smaller than the maintenance standard, deletev
n from set V
j, add v
n into set pathant, and then turn to step 3. Else, if the arrival station of last trip in set pathant is the same with the departure station of first trip and the connecting time meets the maintenance demand, turn to step 2. Else, turn to step 5.
(5)
Delete the last trip in set pathant and add this trip into its original set V
j; update distance. Next, search for the next trip which can meet the train diagram and maintenance requirements from set V
k. Then, connect this trip with the last trip in the updated set pathant and turn to step 2. If no such trip can be found, return all the trips in set pathant back into set V
i and then turn to step 2.Figure 7
Solution procedure of improved ACA.After above steps, low-cost and high-efficient circulations can be produced.


## 4.1. Traditional Ant Colony Algorithm

Ant colony algorithm (ACA) is an intelligence-optimized algorithm which is first proposed in 1992 [25]. ACA is an optimization method of distribution which advantages over three aspects [26]: firstly, ACA is a global optimization method which can be used for solving both the single objective and multiobjective optimization problems; secondly, ACA is appropriate for the discretization problems; thirdly, a positive feedback mechanism is used to obtain the optimal route through ceaselessly updating the pheromone. Therefore, due to the ability in finding optimal or near optimal solutions for many complex optimization problems, ant colony algorithm has been widely applied to various fields, such as the traveling salesman problem (TSP) [27–30], route optimization problem [31–34], traffic assignment problem [35, 36], crew scheduling problem [37–39], the network design problem [40], and many other classical combination optimization problems.The inspiration of ACA comes from food-seeking behavior of ants [41]. By simulating the process of ants foraging in the nature, ACA tactfully combines biomimetic algorithm and heuristic algorithm. ACA takes full advantage of the ants’ group ability that ants can find the shortest route from formicary to food by information transmission between individuals. Previous studies have found that group collaboration features of ants are communicated and coordinated by the pheromone which is a kind of volatile chemical left on the way back and forth [42]. When ants find a relatively short route, they will release the pheromone. Then, the higher the pheromone concentration is, the more attractive the route will be. Therefore, pheromone concentration on the shorter route will be even higher and all these processes form a positive-feedback loop. Eventually, ants on the multiple paths will gradually gather on the shortest route.A lot of studies have stated that the ACA is quite applicable to solve TSP problem [27, 43]. EMU circulation scheduling problem is similar to TSP problem [21, 44] which can be regarded as generalized TSP problem with some special constrains. Therefore, improved ACA is proposed to solve EMU circulation scheduling problem.As previously mentioned, lots of research has used the ACA to figure out the EMU circulation scheduling problem. The solving process can be concluded roughly as is shown in Figure5. In the first step, a whole circulation with short connection time can be obtained without distance maintenance constraint. Then, this circulation is divided into several segments with the consideration of maintenance constraint. In the second step, these segments are recombined and several new small circulations are obtained. However, artificial modification is usually needed as a supplement. This approach is low-efficient and the result is hard to be put into practice.Figure 5
Traditional ACA approach.


## 4.2. Improved Ant Colony Algorithm Design

To make solving process more efficient and results more accurate, an improved ACA is proposed and the solving process is shown in Figure6. A group of ants are designed to construct a feasible solution. An unvisited node list is set to gather the unvisited trips and another list to record the path that the ant has traveled. In each process of iteration, one ant is generated to search for the path with the consideration of maintenance constraints and train diagram constraints. When the total travel distance reaches the maintenance standard, it should be judged whether the circulation meets the requirements that the departure station of first trip in this circulation should near the Inspection and Repair Depot and the terminal station of last trip should be the same with the departure station of first trip. If it meets the requirements, this circulation should be recorded and then another ant should be generated to repeat the process above and search for the next circulation; else, if the requirements cannot be satisfied, the backtracking technique should be used to search for another circulation which can meet the requirements. Once the circulation based on the backtracking technique is obtained, it should be recorded and another ant will be generated; otherwise, empty EMU should be dispatched to complete the circulation which should also be recorded and then another ant will be generated. Such new ant should be generated until the unvisited node list is empty which means that iteration has been completed. Relative information should be updated and then next iteration begins.Figure 6
Improved ACA approach.In each process of iteration, each ant is corresponding with a circulation loop and the quantity of the ant is uncertain which is different from the traditional ACA approach with a fixed ant quantity in each process of iteration. After all iterations, the result is obtained. The new approach proposed in this study leads to higher-quality solutions and faster solving speed.Basic Mechanism and Rules. Path selection mechanism and pheromone update rule in our improved ACA are based on the classical ACA which can be described as follows.Equation (9) describes the probability that ants transfer from node i to node j while nodes mean trips in this study:
(9)
P
i
j
=
{
tau
(
i
,
j
)
α
eta
(
i
,
j
)
β
∑
j
=
1
,
j
≠
i
n
tau
(
i
,
j
)
α
eta
(
i
,
j
)
β
s
i
a
=
s
j
d
0
others
,
where tau
(
i
,
j
) denotes the amount of pheromone deposited on the connection relationship e
i
j which can also be called track attraction and it is assumed that pheromone amount in every route is equal at the initial moment; eta
(
i
,
j
) represents vision attraction which equals the reciprocal of w
i
j when ants move from node i to node j; α and β are the importance coefficient of track attraction and vision attraction, respectively.Equations (10) and (11) describe the update rule of pheromone remained on the path by ants at the end of each iteration:
(10)
tau
(
i
,
j
)
t
+
1
=
(
1
-
rho
)
×
tau
(
i
,
j
)
t
+
Delta
_
tau
(
i
,
j
)
(11)
Delta
_
tau
(
i
,
j
)
=
Q
total
_
time
,
where t means the iteration index; rho describes the evaporation coefficient of pheromone; Delta
_
tau
(
i
,
j
) is the increasing amount of pheromone in the connection relationship. If there is no ant passing through the arc from trip i to trip j, Delta
_
tau
(
i
,
j
) is equal to zero; else, it is equal to the ratio of Q and total
_
time, while total
_
time means the sum of all EMU connection time and Q is defined as constant.Preparation Work. To solve EMU circulation scheduling problem, some initial information and work should be prepared; namely,(1)
input basic data including train number, departure station, arrival station, distance, departure time, and arrival time,
(2)
calculate the connection time according to (2),
(3)
initialize the parameters including iteration timesN
C, current iteration index t, track attraction tau, vision attraction eta, α, β, Q, and rho,
(4)
group all the trips with the same departure station into setV
i, where i denotes the number of the departure station,
(5)
variable distance is defined to record the total travel distance of the ant while set pathant is defined to record the path that ants have traveled.Solution Procedure. After the preparation work, the framework of improved ant colony algorithm for EMU circulation scheduling problem can be described as the flowchart in Figure 7.(1)
Whent
<
N
C, it means that iterative process does not end. Variables ant and distance are needed to be initialized with value zero. Moreover, set V
i should be reset. Else, solution procedure ends and results will be outputted.
(2)
If setV
i
(
i
=
1,2
,
…
,
n
⊄
∅
), ant
=
ant
+
1, a trip v
m (assuming that the arrival station of v
m is j) will be selected randomly from V
i. Then, update distance to the sum of distance and distance v
m. Trip v
m needs to be added into set pathant. Else, turn to step 1 after updating tau
(
i
,
j
) according to (10).
(3)
Search in setV
j whose departure station is the same with the arrival station of trip v
m. Then, calculate the transfer probability according to (9) and use the roulette gamble to select next trip v
n connecting with the last trip v
m, where updated distance is equal to the sum of distance and distance v
n. If no trip can meet requirements, empty EMUs need to be dispatched to finish the connection and then turn to step 2.
(4)
If distance is smaller than the maintenance standard, deletev
n from set V
j, add v
n into set pathant, and then turn to step 3. Else, if the arrival station of last trip in set pathant is the same with the departure station of first trip and the connecting time meets the maintenance demand, turn to step 2. Else, turn to step 5.
(5)
Delete the last trip in set pathant and add this trip into its original set V
j; update distance. Next, search for the next trip which can meet the train diagram and maintenance requirements from set V
k. Then, connect this trip with the last trip in the updated set pathant and turn to step 2. If no such trip can be found, return all the trips in set pathant back into set V
i and then turn to step 2.Figure 7
Solution procedure of improved ACA.After above steps, low-cost and high-efficient circulations can be produced.


## 5. Numerical Analysis

### 5.1. Basic Information

In this study, improved ant colony optimization algorithm is tested in a high-speed railway which includes 11 segments and 12 stations as is shown in Figure8. CRH3 (CRHA380, speed 300 km/h) EMUs are chosen in passenger dedicated line to carry out experiments.Figure 8
The tested high-speed railway.The basic information can be described as follows.


#### 5.1.1. Departure and Arrival Stations

WH, CS, and GZ (WH and GZ are near the Inspection and Repair Depot).


#### 5.1.2. Trips

There are total 154 trips including 52 trips from WH to GZ, 52 from GZ to WH, 25 from CS to GZ, and 25 from GZ to CS. The tested timetable data is listed in the supplementary file (see Supplementary Material available online athttp://dx.doi.org/10.1155/2014/767429) which contains departure station, arrival station, departure time, arrival time, and train number.


#### 5.1.3. Distance

The distance was 1068 km between WH and GZ and 801 km between CS and GZ.


#### 5.1.4. Parameter

ConsiderS
one
{
d
∣
3600
≤
d
≤
4400
}, T
one
=
4 h, total running distance D
all
=
151,1
23 km, and total running time T
all
=
3
8,295. The operation time t
i
j between a train arriving at certain station and undertaking next trip is 24 min. The periodic time in train diagram is T
c
=
1
,
440 min. and the iteration times N
C are 50.According to previous study [25, 45], values of α, β, Q, and rho are listed in Table 2.Table 2
Values of coefficient.
α
β
Q
rho
1
5
100
0.1


### 5.2. Computational Results of EMU Circulation Scheduling Scheme

Due to the volatility of heuristic algorithm results, one hundred times of the improved ACA experiments have been carried out to ensure the stability of results. Software MATLAB programming is used in this study. After operating in the PC (Core i7, Frequency 3.40 GHz, Memory 16 G), results of EMU circulation scheduling scheme have been obtained. To make the experiment process more clear, six of the 100 convergence figures are chosen to express the iteration process.As shown in Figure9, the horizontal axis denotes iteration times and the vertical axis denotes the total connection time. The results reveal that the average convergence times of 100 experiments are 18.9 times while the average computational time is 2.53 s. Of all the 100 experiments, the minimum total connection time T
tct is 62,505 min. The amount of utilizing EMUs M
EMU is 70. Table 3 lists the EMU circulations and amount of EMUs completing each circulation where M denotes maintenance.Table 3
EMU circulation scheme result.
EMU circulation
EMU amount
G1001→G6028→G6037→G1090→M→G1001
1
G1003→G1012→G1081→M→G1002→G1003
2
G1005→G6040→G6049→G1104→M→G1005
1
G1007→G6044→G6001→G1048→M→G1007
2
G1009→G6048→G6005→G1004→M→G1009
2
G1023→G6022→G6031→G1082→M→G1023
1
G1025→G6024→G6033→G1086→M→G1025
1
G1027→G6026→G6035→G1020→M→G1027
1
G1029→G1010→G1017→M→G1006→G1029
2
G1031→G1056→G1075→M→G1034→G1031
2
G1033→G6030→G6039→G1092→M→G1033
1
G1035→G1064→G1019→M→G1008→G1035
2
G1037→G1066→G1083→M→G1042→G1037
2
G1039→G6038→G6047→G1102→M→G1039
1
G1041→G1014→G1101→M→G1024→G1041
2
G1043→G1072→G1093→M→G1028→G1043
2
G1045→G6042→G6003→G1052→M→G1045
2
G1047→G1016→G1095→M→G1022→G1047
1
G1049→G1074→G1097→M→G1036→G1049
2
G1051→G6046→M→G6007→G1058→G1051
2
G1053→G1084→M→G1059→G1026→G1053
2
G1055→G1080→G1103→G1030→M→G1055
1
G1011→G1088→G1079→M→G1032→G1011
2
G1013→G1094→G1015→G1100→M→G1013
2
G1057→G6050→M→G6023→G1070→G1057
2
G1061→G1096→M→G1021→G1054→G1061
2
G1063→G1098→M→G1067→G1050→G1063
3
G1065→G6006→G6015→G1076→M→G1065
2
G1069→G6032→G6041→M→G1038→G1069
2
G1071→M→G6004→G6013→G1062→G1071
2
G1073→G6012→G6021→G1078→M→G1073
2
G1077→M→G1040→G1091→G1044→G1077
2
G1085→M→G6010→G6019→G1068→G1085
2
G1087→M→G6002→G6011→G1046→G1087
2
G1089→M→G6016→G6025→G1018→G1089
2
G1099→M→G6008→G6017→G1060→G1099
2
G6020→G6045→M→G6036→G6009→G6020
3
G6018→G6027→G6014→G6029→G6034→G6043→M→G6018
3Iteration convergence process.
(a)
(b)
(c)
(d)
(e)
(f)The mean distance of every train per dayD
average is equal to 2158.9 km which is the value of M
EMU dividing D
all. The total amount of maintenance N
M is 38 and the utilization rate of EMU V
k is 37.991% which is equal to T
all
/
(
1440
*
70
).Results Evaluation. The minimum theoretical connecting time without considering the maintenance is 57,812 min which is calculated by the Hungarian algorithm [13]. In this study, the result based on the improved ACA method is 62,505 min which is very close to the theoretical result. In theory, the minimum total amount of maintenances is 35 which is equal to D
all
/
(
1
+
10
%
)
S
one. However, the ideal result cannot be reached in reality, because not all trains will be overhauled until they reach the maximum of distance maintenance standard. Therefore, the computational result, 38 times, in this study is satisfying. The mean distance of every train per day reaches 2158.9 km which means that the EMUs are utilized efficiently. These results have proved this algorithm feasible.


### 5.3. Comparison with Traditional Approach

In order to verify the high efficiency of this model and algorithm, two groups of comparative experiments are carried out by the genetic algorithm and traditional ant colony algorithm based on the same study case. Moreover, these experiments are carried out in the same computer. The comparison results are listed in Table4.Table 4
Comparison of different approaches.
Improved ACA
Traditional ACA
GA
R
37.991%
34.537%
32.431%
T
tct (min)
62,505
68,521
72,358
M
EMU
70
77
82
N
M
38
40
43
D
average (km/day)
2158.9
1962.6
1842.9According to Table4, the EMU utilization rate R of improved ACA 37.991% is much higher than that of traditional ACA 34.537% and GA 32.431% algorithm, which means that more efficient circulations have been scheduled by the improved ACA. To make the results more intuitional, several representative indexes are chosen to measure the efficiency of these three methods including T
tct, M
EMU, N
M, and D
average. The total connection time T
tct of improved ACA is the smallest followed by traditional ACA and GA algorithm which means that the idle time of EMU circulation scheduling scheme obtained by improved ACA is much smaller and the arrangement is much better. Similarly, the amount of dispatched EMU M
EMU in the scheduling scheme obtained by improved ACA is smaller than the other two methods, which means that the efficiency of each EMU is much higher and the scheme is much better. Moreover, the maintenance times N
M of improved ACA are less than the other two methods, which in other words means less cost. Inversely, the mean distance of every train per day D
average is the longest by the method of improved ACA which means the higher efficiency of each EMU.In summary, the method of improved ACA has been verified to be more efficient than the traditional algorithm for the EMU circulation scheduling problem and better results can be obtained. The results suggest that the same tasks can be completed with fewer EMUs and less cost at the same time.


## 5.1. Basic Information

In this study, improved ant colony optimization algorithm is tested in a high-speed railway which includes 11 segments and 12 stations as is shown in Figure8. CRH3 (CRHA380, speed 300 km/h) EMUs are chosen in passenger dedicated line to carry out experiments.Figure 8
The tested high-speed railway.The basic information can be described as follows.


### 5.1.1. Departure and Arrival Stations

WH, CS, and GZ (WH and GZ are near the Inspection and Repair Depot).


### 5.1.2. Trips

There are total 154 trips including 52 trips from WH to GZ, 52 from GZ to WH, 25 from CS to GZ, and 25 from GZ to CS. The tested timetable data is listed in the supplementary file (see Supplementary Material available online athttp://dx.doi.org/10.1155/2014/767429) which contains departure station, arrival station, departure time, arrival time, and train number.


### 5.1.3. Distance

The distance was 1068 km between WH and GZ and 801 km between CS and GZ.


### 5.1.4. Parameter

ConsiderS
one
{
d
∣
3600
≤
d
≤
4400
}, T
one
=
4 h, total running distance D
all
=
151,1
23 km, and total running time T
all
=
3
8,295. The operation time t
i
j between a train arriving at certain station and undertaking next trip is 24 min. The periodic time in train diagram is T
c
=
1
,
440 min. and the iteration times N
C are 50.According to previous study [25, 45], values of α, β, Q, and rho are listed in Table 2.Table 2
Values of coefficient.
α
β
Q
rho
1
5
100
0.1


## 5.1.1. Departure and Arrival Stations

WH, CS, and GZ (WH and GZ are near the Inspection and Repair Depot).


## 5.1.2. Trips

There are total 154 trips including 52 trips from WH to GZ, 52 from GZ to WH, 25 from CS to GZ, and 25 from GZ to CS. The tested timetable data is listed in the supplementary file (see Supplementary Material available online athttp://dx.doi.org/10.1155/2014/767429) which contains departure station, arrival station, departure time, arrival time, and train number.


## 5.1.3. Distance

The distance was 1068 km between WH and GZ and 801 km between CS and GZ.


## 5.1.4. Parameter

ConsiderS
one
{
d
∣
3600
≤
d
≤
4400
}, T
one
=
4 h, total running distance D
all
=
151,1
23 km, and total running time T
all
=
3
8,295. The operation time t
i
j between a train arriving at certain station and undertaking next trip is 24 min. The periodic time in train diagram is T
c
=
1
,
440 min. and the iteration times N
C are 50.According to previous study [25, 45], values of α, β, Q, and rho are listed in Table 2.Table 2
Values of coefficient.
α
β
Q
rho
1
5
100
0.1


## 5.2. Computational Results of EMU Circulation Scheduling Scheme

Due to the volatility of heuristic algorithm results, one hundred times of the improved ACA experiments have been carried out to ensure the stability of results. Software MATLAB programming is used in this study. After operating in the PC (Core i7, Frequency 3.40 GHz, Memory 16 G), results of EMU circulation scheduling scheme have been obtained. To make the experiment process more clear, six of the 100 convergence figures are chosen to express the iteration process.As shown in Figure9, the horizontal axis denotes iteration times and the vertical axis denotes the total connection time. The results reveal that the average convergence times of 100 experiments are 18.9 times while the average computational time is 2.53 s. Of all the 100 experiments, the minimum total connection time T
tct is 62,505 min. The amount of utilizing EMUs M
EMU is 70. Table 3 lists the EMU circulations and amount of EMUs completing each circulation where M denotes maintenance.Table 3
EMU circulation scheme result.
EMU circulation
EMU amount
G1001→G6028→G6037→G1090→M→G1001
1
G1003→G1012→G1081→M→G1002→G1003
2
G1005→G6040→G6049→G1104→M→G1005
1
G1007→G6044→G6001→G1048→M→G1007
2
G1009→G6048→G6005→G1004→M→G1009
2
G1023→G6022→G6031→G1082→M→G1023
1
G1025→G6024→G6033→G1086→M→G1025
1
G1027→G6026→G6035→G1020→M→G1027
1
G1029→G1010→G1017→M→G1006→G1029
2
G1031→G1056→G1075→M→G1034→G1031
2
G1033→G6030→G6039→G1092→M→G1033
1
G1035→G1064→G1019→M→G1008→G1035
2
G1037→G1066→G1083→M→G1042→G1037
2
G1039→G6038→G6047→G1102→M→G1039
1
G1041→G1014→G1101→M→G1024→G1041
2
G1043→G1072→G1093→M→G1028→G1043
2
G1045→G6042→G6003→G1052→M→G1045
2
G1047→G1016→G1095→M→G1022→G1047
1
G1049→G1074→G1097→M→G1036→G1049
2
G1051→G6046→M→G6007→G1058→G1051
2
G1053→G1084→M→G1059→G1026→G1053
2
G1055→G1080→G1103→G1030→M→G1055
1
G1011→G1088→G1079→M→G1032→G1011
2
G1013→G1094→G1015→G1100→M→G1013
2
G1057→G6050→M→G6023→G1070→G1057
2
G1061→G1096→M→G1021→G1054→G1061
2
G1063→G1098→M→G1067→G1050→G1063
3
G1065→G6006→G6015→G1076→M→G1065
2
G1069→G6032→G6041→M→G1038→G1069
2
G1071→M→G6004→G6013→G1062→G1071
2
G1073→G6012→G6021→G1078→M→G1073
2
G1077→M→G1040→G1091→G1044→G1077
2
G1085→M→G6010→G6019→G1068→G1085
2
G1087→M→G6002→G6011→G1046→G1087
2
G1089→M→G6016→G6025→G1018→G1089
2
G1099→M→G6008→G6017→G1060→G1099
2
G6020→G6045→M→G6036→G6009→G6020
3
G6018→G6027→G6014→G6029→G6034→G6043→M→G6018
3Iteration convergence process.
(a)
(b)
(c)
(d)
(e)
(f)The mean distance of every train per dayD
average is equal to 2158.9 km which is the value of M
EMU dividing D
all. The total amount of maintenance N
M is 38 and the utilization rate of EMU V
k is 37.991% which is equal to T
all
/
(
1440
*
70
).Results Evaluation. The minimum theoretical connecting time without considering the maintenance is 57,812 min which is calculated by the Hungarian algorithm [13]. In this study, the result based on the improved ACA method is 62,505 min which is very close to the theoretical result. In theory, the minimum total amount of maintenances is 35 which is equal to D
all
/
(
1
+
10
%
)
S
one. However, the ideal result cannot be reached in reality, because not all trains will be overhauled until they reach the maximum of distance maintenance standard. Therefore, the computational result, 38 times, in this study is satisfying. The mean distance of every train per day reaches 2158.9 km which means that the EMUs are utilized efficiently. These results have proved this algorithm feasible.


## 5.3. Comparison with Traditional Approach

In order to verify the high efficiency of this model and algorithm, two groups of comparative experiments are carried out by the genetic algorithm and traditional ant colony algorithm based on the same study case. Moreover, these experiments are carried out in the same computer. The comparison results are listed in Table4.Table 4
Comparison of different approaches.
Improved ACA
Traditional ACA
GA
R
37.991%
34.537%
32.431%
T
tct (min)
62,505
68,521
72,358
M
EMU
70
77
82
N
M
38
40
43
D
average (km/day)
2158.9
1962.6
1842.9According to Table4, the EMU utilization rate R of improved ACA 37.991% is much higher than that of traditional ACA 34.537% and GA 32.431% algorithm, which means that more efficient circulations have been scheduled by the improved ACA. To make the results more intuitional, several representative indexes are chosen to measure the efficiency of these three methods including T
tct, M
EMU, N
M, and D
average. The total connection time T
tct of improved ACA is the smallest followed by traditional ACA and GA algorithm which means that the idle time of EMU circulation scheduling scheme obtained by improved ACA is much smaller and the arrangement is much better. Similarly, the amount of dispatched EMU M
EMU in the scheduling scheme obtained by improved ACA is smaller than the other two methods, which means that the efficiency of each EMU is much higher and the scheme is much better. Moreover, the maintenance times N
M of improved ACA are less than the other two methods, which in other words means less cost. Inversely, the mean distance of every train per day D
average is the longest by the method of improved ACA which means the higher efficiency of each EMU.In summary, the method of improved ACA has been verified to be more efficient than the traditional algorithm for the EMU circulation scheduling problem and better results can be obtained. The results suggest that the same tasks can be completed with fewer EMUs and less cost at the same time.


## 6. Conclusion

In this study, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth and with optimization objective of reducing both the total connection time and the maintenance costs at the greatest extent. To solve this model, an improved ACA algorithm has been designed. A certain amount of ants are generated to search the circulations with the consideration of train diagram and maintenance constraints. The quantity of ants in each iteration process is uncertain which is different from traditional approaches. Moreover, to verify the feasibility of model, a case is conducted by MATLAB programming, and 100 times experiments have been carried out according to the data of tested high speed railway. The results prove that the model and algorithm are feasible.Additionally, contrast tests of traditional GA and ACA approaches have been carried out to compare the efficiency between the improved ACA and traditional approaches. The comparison results show that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher than traditional approaches and better circulation scheduling scheme has been obtained.On summary, the improved ACA method is much more efficient and accurate than traditional approaches. There may be some help of this paper in the EMU circulation scheduling problem while a given task in the train diagram can be completed with fewer EMUs and lower maintenance costs.



---

*Source: 767429-2014-07-07.xml*