2. Literature Review
Studies of virtual coupling technology have been widely carried out. Some scholars first studied the basic concepts and functions of virtual coupling. Konig et al. [
1] and Ständer et al. [
2] discussed the basic concept of virtual coupling, and verified the effectiveness and security of its functions. Goikoetxea et al. [
3] introduced the technology required to achieve virtual coupling in Shift2Rail and explained that it was beneficial cost reduction. Gómez et al. [
4] focused on the decentralization of the communication between moving trains and investigated the viability under realistic conditions. Virtual coupling is valuable in improving the carrying capacity of the line. It can also shorten train operation intervals and improve operation control efficiency. Schumann [
5] simulated railway operations with virtual coupling in the Shinkansen scenario, which showed the possibility to increase line capacity. Liu [
6] proposed the multi-agent system (MAS) to control the operation of a virtually coupled train group. Felez et al. [
7] showed that the virtual coupling concept substantially reduces headway and distance between trains while guaranteeing safe separation between two consecutive trains at any instant. Liu et al. [
8] put forward a new method that considers the distribution of passenger flow to improve transportation efficiency. Flammini [
9] and Aoun [
10] investigated demand trends and operational scenarios of virtual coupling, Aoun [
11] also analyzed its advantages and limitations through two extensive surveys. Bai et al. [
12] analyzed the typical operation process using virtual coupling technology and provided a formula for calculating the station interval time.
Virtual coupling has new requirements for train control systems. Chen [
13] summarized the redundant rule between the train-to-train direct communication and the existing communication. The results show that the automatic adjustment strategy inside the train formation can make the train operation efficient and keep the train tracking in a steady state. Song et al. [
14] proposed a method of speed limit curve calculation based on relative braking distance, which may provide some reference for the next generation train control systems. Cui et al. [
15] analyzed the key technical requirements of virtual coupling application in the train control system, and designed the architecture of a train control system using virtual coupling technology. Li [
16] and Yu [
17] researched train control methods of virtual coupling oriented to dynamic coupling.
The optimization problem of train operation plans for full-length and short-turn routes is usually defined as a mathematical optimization problem, for which models and algorithms have been designed. Wang [
18], Wei [
19], and Deng et al. [
20] set up the optimization model for minimizing the travel time of passengers and the operating cost of enterprises, respectively. Liu [
21] focused on the passenger flow of urban rail lines during peak hours and established an optimization model for the train operation scheme of full-length and short-turn routes. Xu et al. [
22] and Duan [
23] established an optimization operation scheme model based on the analysis of passengers’ choice behavior of different routes. Considering fairness factors, Yao et al. [
24] established an optimization model of full-length and short-turn routes with the goal of minimizing the travel delay of all passengers. Chen et al. [
25] proposed a collaborative full-length and short-turning plan and joint multi-station control of passenger flow. Blanco et al. [
26] propose a model for line planning and timetabling from a cost-oriented and a passenger-oriented perspective. Ren et al. [
27] established a combined two-step model of train formation optimization and real-time station control. The load factor of the trains is also an important goal to be considered in the design of operation schemes. Dai et al. [
28] and Zhang [
29] analyzed the dynamic demand of passenger flow and established an optimization model to increase the average load factor of trains. Xu [
30] and Wu [
31] proposed an optimization method of a train operation scheme of full-length and short-turn routes considering the balance of load rate. Liu et al. [
32] established an optimization model aiming at minimizing passenger waiting time, fixed operating cost of vehicles, and wasted capacity cost. Liao [
33] established an optimization model, and comprehensively considered the constraints such as departure frequency, load factor of trains, and maximum waiting time that passengers could tolerate. Yang [
34] constructed a train operation scheme model considering the passenger flow of the whole urban rail network, aiming at the optimal network efficiency. Rajabighamchi et al. [
35] establish a model to optimize the multi-marshalling problem by minimizing the trains’ vacant capacities. Zhao et al. [
36] analyzed the passenger flow of an airport line and put forward three train operation plans based on virtual coupling trains. At present, there is almost no research on the train operation plan of virtual coupling trains. In addition, in the research on the train operation plan of full-length and short-turn routes, the number of marshalled vehicles is fixed. After applying virtual coupling trains, the number of marshalled vehicles can be changed during the operation. The full-length train and the short-turn train are quickly coupled or uncoupled, which makes full-length and short-turn route mode more flexible. This paper provides an idea for the optimization of the train operation plan of virtual coupling trains. Other researchers can refer to the ideas of this paper and conduct research on transportation organization modes such as express and local trains, so as to contribute to improving the transportation efficiency and service level of urban rail transit.
In this study, a two-level optimization model is proposed. The upper model is established to minimize passenger travel time and enterprise operation cost, and the lower model to optimize the equilibrium of train load rate on short-turn routes. Meanwhile, a method based on the genetic algorithm is designed to solve the model. Different from previous studies, this paper mainly focuses on the train operation scheme based on virtual coupling. Finally, a case study of the Metro Line M is carried out. The results verify the efficiency and feasibility of the proposed method.
The rest of this paper is organized as follows.
Section 2 describes the proposed problem and assumptions. In
Section 3, the two-level optimization model is established. A solution method based on a genetic algorithm is designed to search for the optimal solution in
Section 4.
Section 5 uses a case to demonstrate the effectiveness and superiority of the proposed model and algorithm. Finally, the conclusions and future work are presented in the last section.
3. Description of the Problem and Assumptions
3.1. Analysis Problem
The traditional full-length and short-turn route mode needs to determine the number of marshalled vehicles of full-length trains according to the passenger flow of the whole line, but with the application of virtual coupling trains, the transportation organization mode of full-length and short-turn routes can be more flexible. The number of marshalled vehicles of short-turn trains can be determined according to the passenger flow in the non-overlapping sections of full-length and short-turn routes. Therefore, virtual coupling trains can use a smaller number of marshalled vehicles of full-length trains, which reduces the cost to enterprises. In this paper, the full-length train and the short-turn train are coupled at the turn-back station of the short-turn routing, and the two trains operate on the short-turn routing to provide more transport capacity. When the two trains arrive at another turn-back station of the short-turn routing, they will be uncoupled. The full-length train continues to run forward, while the short-turn train turns back at the turn-back station, forming the full-length and short-turn routings. The transportation organization mode of virtual coupling trains can reduce enterprise operating costs and improve service levels.
This paper aims at optimizing the train operation plan with full-length and short-turn routes of virtual coupling trains. It establishes a two-level optimization model. The upper model is used to minimize passenger travel time and enterprise operation cost, and the lower model to optimize the equilibrium of train load rate on short-turn routes. The upper model adopts the departure frequency of the train and the location of the turn-back station of the short-turn as the decision variables, and the lower model takes the number of marshalled trains as the decision variable. Since the objective function of the upper model and that of the lower model are not in the same order of magnitude, they are considered separately. The two-layer optimization model is designed according to the two optimization objectives, which can better take into account the factors of cost and full load rate.
As shown in
Figure 1, there are
N stations in the line, and the direction of trains running from station 1 to station
N is upward. The short-turn train only runs between station
a and station
b. In this paper, stations 1 to
a are regarded as section I. Then, stations
a to
b are recorded as section II, and stations
b to N are recorded as section III.
is departure frequency of the full-length train, and
is departure frequency of the short-turn train.
,
,
,
are decision variables of the upper model.
is the number of marshalled vehicles of the full-length train, and
is the number of marshalled vehicles of the short-turn train.
and
are decision variables of the lower model.
3.2. Assumptions
Train operation plans for full-length and short-turn routes that can accommodate the specific passenger flow pattern on this route are determined by the inter-station distances, safe headway, the passenger origin–destination (OD) flow distribution, and other factors.
The following basic assumptions are made:
- (1)
Passengers entering each station during the period examined in this study follow a uniform distribution. This paper does not consider the situation of passenger detention.
- (2)
All trains depart from the originating station at equal time intervals.
- (3)
When passengers can take trains of full-length routing and trains of short-turn routing, the proportion of people taking different trains is determined according to the operation proportion of different trains.
- (4)
All trains stop at each station, and the operation time in the up direction is equal to that in the down direction.
- (5)
All stations have the ability to turn back, and the time for turning back is equal.
5. Solution Algorithms
The normalization method is used to transform the two-objective optimization problem described by the upper model to a single-objective optimization problem, which can be solved using a genetic algorithm. In addition, there are few feasible solutions of the lower model, so the lower model can be solved by enumeration.
5.1. The Procedure of the Algorithm
The two-layer optimization model is designed according to the two optimization objectives, which can better take into account the factors of cost and full load rate. As a bi-level model, the lower level’s decision variables are the parameters for the upper-level model. f1, f2, a, b are decision variables of the upper model, and they are also the variables that make up the objective function of the lower model. Firstly, the genetic algorithm is used to obtain the optimal solution of the upper model. Then, the optimal frequencies and locations of the turn-back station from the upper model are substituted into the lower model to solve its optimal solution. The procedure of the algorithm is provided below.
Step1: The upper model is converted into a single-objective optimization problem by normalization. The weights of each objective function are determined based on the objective function values of the single-routing operation plan.
is the waiting time for passengers of the single train operation scheme,
is the train running distance under the single routing mode.
and
are the weights of the two objective functions, which can be calculated as follows:
Step2: The upper model can be solved using a genetic algorithm. First, we need to determine the parameters required by the upper model, including crossover probability, mutation probability, and initial number of marshalled vehicles. The initial population has 100 individuals. The evolution is 50 generations. The initial number of marshalled vehicles is n1 and n2, both of which are 4. The key steps are shown below.
(1) Individual coding: One-dimensional binary coding is adopted. The upper model established in this paper has 4 decision variables, so each chromosome consists of 4 gene segments. Among them, the number of genes corresponding to the departure frequency of the full-length train and short-turn train is 4, the number of genes corresponding to the starting station and terminal station of the short-turn route is 5. In summary, the total number of genes per chromosome is 18. As shown in
Figure 3,
f1 is 12,
f2 is 3,
a is 9, and
b is 13.
(2) Selection strategy: The tournament algorithm is used to select individuals. The reciprocal of the objective function is taken as the fitness function. Penalty function is used to screen infeasible solutions. Before calculating the objective function, decode the chromosome first, and then check whether this chromosome meets the constraint. The objective function corresponding to the chromosome that does not meet the constraint is a larger value. As shown in
Figure 4,
f1 is 16,
f2 is 6,
a is 13, and
b is 9. This chromosome does not meet the restrictions of Formula (17) and Formula (19), so this chromosome has a larger objective function value.
(3) Single-point crossover: Two adjacent chromosomes are grouped together for crossover. If the chromosomes are odd, the last chromosome does not cross. Randomly select a gene bit and generate a random number. If the random number is less than the crossover probability, crossover is performed to generate a new chromosome. Single-point crossover is shown in
Figure 5.
(4) Basic bit mutation: Randomly select a gene bit and generate a random number, if the random number is less than the mutation probability, the gene bit will change. As shown in
Figure 6, the mutation principle is that 0 becomes 1, and 1 becomes 0.
(5) Termination criterion: Repeat (2) to (4) 50 times, compare the optimal chromosomes in 50 generations, and take the chromosome with the maximum value of fitness function as the output result.
Step3: The optimal solution of the upper model is input into the lower model as a known parameter.
Step4: Enumeration is applied to the optimal solution of the lower model. Save the optimal solution of the upper and lower models.
Step5: After repeating step 2 to step 4 30 times, the algorithm ends.
The flowchart of the algorithm is shown in
Figure 7.
5.2. Determine Parameters
Virtual passenger flow data is used to test the algorithm. The objective function of the upper model includes the waiting time of passengers and the running kilometers of trains. NSGA2 can be used to solve the non-dominated optimal solution of two objectives. The mutation probability is 0.02. As shown in
Figure 8, the crossover probabilities are 0.5, 0.6, 0.7, and 0.8, respectively. We can choose the appropriate solution according to the demand, but there is no fixed standard to explain which solution is better. Therefore, the normalization method is used to transform the two-objective optimization problem to a single-objective optimization problem.
After being transformed into a single-objective optimization problem, the GA is used to solve it. The mutation probability is 0.02. The crossover probabilities are 0.5, 0.6, 0.7, and 0.8, respectively. The fitness function value is shown in
Figure 9. When the crossover probability is 0.7, the variation range of the objective function value is relatively large, and finally it can reach a better value. Therefore, the mutation probability of this paper is 0.7, and the mutation probability is taken as 0.02. Evolution algebra is 50.
7. Conclusions
In this paper, a two-level optimization model for full-length and short-turn routes of virtual coupling trains is established. The upper-level model takes departure frequencies of full-length and short-turn trains and locations of short-turn mode turn-back stations as decision variables, and objective functions are to minimize both passenger travel time and enterprise operation cost. The lower-level model is an optimization model of the equilibrium of load factor, which is to determine the optimal formation plans. Meanwhile, a method based on the genetic algorithm is designed to solve the model. On the basis of previous research, this paper mainly focuses on train operation plan of full-length and short-turn routes with virtual coupling trains. A case of Metro Line M is used to show the reasonability and effectiveness of the proposed model. The model proposed in this paper can be applied to any line. The results show that passenger waiting time, kilometers of train operation, and number of vehicles used are significantly reduced compared with the traditional train plan of full-length and short-turn routes and single train operation scheme. In addition, the train operation plan with virtual coupling trains can improve the maximum and average load factor of trains. Therefore, it proves advantages of the train operation plan of full-length and short-turn routes of virtual coupling trains. Finally, sensitivity analyses are performed using three parameters which include departure frequency of the full-length train and short-turn train, starting and terminal station of the short-turn route, and number of marshalled vehicles of the full-length train and short-turn train. It turns out that all of these parameters have a high impact on the behavior of the value of the objective function. Selecting the appropriate parameters plays an important role in improving the service level of urban rail transit and reducing operating costs.
When the virtual coupling train is used, the operation staff of the subway can determine a reasonable train operation plan according to the passenger flow of the line, so as to improve the service level and reduce the operating cost of the enterprise. The model proposed in this paper can provide decision support for the operation staff of the subway. The research results of this paper can provide a reference for the optimization research of the train operation plan of full-length and short-turn routes with virtual coupling trains. There are still some aspects to be extended in future work. First, this paper assumes that all stations have the ability to turn back, but this is not the case, so it is necessary to increase the consideration of line conditions. Second, the passengers’ choice behavior is a probabilistic problem, and it is necessary to conduct an in-depth analysis of the passengers’ choice of train in the mode of full-length and short-turn routes. Third, the full-length train and the short-turn train are coupled and unmarshalled at the turn-back station of the short-turn routing, so how to realize the turnover at the train? These issues need further research in the future.