# Cooperative Passenger Inflow Control in Urban Mass Transit Network with Constraint on Capacity of Station

Authors: Jianyuan Guo; Limin Jia; Yong Qin; Huijuan Zhou
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

In urban mass transit network, when passengers’ trip demands exceed capacity of transport, the numbers of passengers accumulating in the original or transfer stations always exceed the safety limitation of those stations. It is necessary to control passenger inflow of stations to assure the safety of stations and the efficiency of passengers. We define time of delay (TD) to evaluate inflow control solutions, which is the sum of waiting time outside of stations caused by inflow control and extra waiting time on platform waiting for next coming train because of insufficient capacity of first coming train. We build a model about cooperative passenger inflow control in the whole network (CPICN) with constraint on capacity of station. The objective of CPICN is to minimize the average time of delay (ATD) and maximum time of delay (MTD). Particle swarm optimization for constrained optimization problem is used to find the optimal solution. The numeral experiments are carried out to prove the feasibility and efficiency of the model proposed in this paper.


---

## Body

## 1. Introduction

More and more passengers travel by urban mass transit (UMT) because UMT is rapid, punctual, and green. With the increasing number of passengers, the capacity of urban mass transit network (UMTN) cannot satisfy the trip demands of passengers. There are lots of passengers who queue and wait because of insufficient capacity of trains [1]. Dangers are brought while there are too many waiting passengers in stations. In the cities in China, such as, Beijing, Guangzhou and Shanghai, the UMT corporations usually control passenger inflow in stations where there are too many waiting passengers to assure safety [2, 3].The approaches of passenger inflow control include controlling passenger inflow in a special station [4], in two stations [5], in stations on a special line [6], or in stations on different lines [7]. In the studies above, the model of controlling passenger inflow in a special station, two stations, and stations on a special line has been described accurately and solved by some methods. Controlling passenger inflow of stations in different lines is described in a qualitative way and there is no model and no effective method.In UMTN, many trips involve at least one transfer [8]. Transferring passenger takes a great proportion of waiting passengers in transfer stations. The number of waiting passengers cannot be controlled under safety limitation only by controlling inflow of this transfer station. It is necessary to limit the inflow of original station which constitutes the transferring passengers and waiting passengers in this transfer station. So the cooperative inflow control involving stations in the whole network is needed to reduce the pressure of transfer station and improve the safety and efficiency of passengers’ trips. This will be described in detail in Section 2.1.Thus we build model to describe cooperative passenger inflow control in the whole network (CPICN). This model and the solving method will provide theoretic support for planning control measure in real operation.The rest of this paper is organized as follows. Section2 analyzes the necessity and evaluation criteria of CPICN. Section 3 builds the model, including assumption, objective, and constraints. Section 4 solves the model by PSO algorithm. Section 5 carries out numerical experiments to prove the feasibility and effectiveness of this model and solving method. Section 6 summarizes the contributions in this paper and puts forward the further research.


## 2. Analyzing CPICN

### 2.1. The Necessity of CPICN

A simple network is constructed as shown in Figure1 to illustrate the composition of waiting passengers in transfer station. Figure 1(b) describes some detail in Figure 1(a). In the simple network there are 5 stations which are s0,s1,…,s4. s0 is a transfer station. We notate the waiting area (such as platform) in s0 on line 1 and line 2 as s01 and s02, respectively. Denote PL0j as the safety limitation of s0j(j∈{1,2}) and W0j as the number of waiting passengers in s0j. When W0j>PL0j, s0j is not safe and it is necessary to control number of waiting passengers to satisfy W0j≤PL0j to assure the safety of s0.Figure 1
Compositions of waiting passengers in transfer station.
(a)
(b)Suppose traintr departs from s3, goes to s4, and passes by s02. The passengers who wait for tr at s02 consist of passengers who depart from s1 or s2 and go to s4 and passengers who enter s0 and depart from s02. Here denote Wi-0j(i≠0) as the passengers who enter si(i≠0), alight from train at s01 and wait tr in s02. When the number of transferring passengers satisfies ∑i=23Wi-0j>PLi-0j, even though there are no passengers who enter s0 and no passengers who get on tr at s3, the safety of s0 cannot be guaranteed because of too many waiting passengers. Under this condition, it is necessary to limit the number of inflow at si(i≠0) to assure W0j≤PL0j.According to above illustration, it is necessary to use method of CPICN to assure safe of transfer station in real network when there are too much transferring passengers.


### 2.2. How to Evaluate Solution of CPICN

Passenger inflow control can change the number of passengers waiting outside or inside of stations. The waiting time of passengers can be changed along with it. The waiting time of a passenger may consist of several parts shown in Figure2. These waiting parts can be classified into three types: W1, W2, and W3. W1 represents the waiting time outside of station caused by inflow control, W2 represents the waiting time used to wait for the first coming train, and W3 represents the waiting time used to wait for the next coming train which can be boarded because of insufficient capacity of the first coming train. W2 is inevitable for a trip. W1 and W3 are extra delay for passengers’ trip, which can be changed and controlled by inflow control. Here we name the sum of W1 and W3 as time of delay (TD).Figure 2
Example of compositions of waiting time.DenoteTDOCp as the time used by passenger p to wait outside of station because of inflow control, which corresponds to W1. Denote TDIOp as the extra time used to wait for next train that can be boarded, which corresponds to W3. TD for a special passenger p can be described as follows:(1)TDp=TDOCp+TDIOp.Inflow control leads to less TD for some passengers while more TD for some other passengers. So we useATD to evaluate the solution which represents average TD. It is computed according to (2), where PA is the set of passengers in whole network and PAC is the number of passengers in PA. For the fixed transport capacity of network, if ATD is less, more passengers are served and the control solution is better(2)ATD=∑p∈PATDpPAC.Moreover, it exists that some passengers have longer TD than others. IfTDp is much longer than TDp′(p′∈PA-{p}), it is unfair for passenger p. So we define MTD to represent the longest TDp, which can be described as (3). The solution is better while MTD is less(3)MTD=max⁡TDp,p∈PA.Thus, the general efficiency and individual interest are both considered. The solution of CPICN is needed to satisfy minimumATD and MTD.


## 2.1. The Necessity of CPICN

A simple network is constructed as shown in Figure1 to illustrate the composition of waiting passengers in transfer station. Figure 1(b) describes some detail in Figure 1(a). In the simple network there are 5 stations which are s0,s1,…,s4. s0 is a transfer station. We notate the waiting area (such as platform) in s0 on line 1 and line 2 as s01 and s02, respectively. Denote PL0j as the safety limitation of s0j(j∈{1,2}) and W0j as the number of waiting passengers in s0j. When W0j>PL0j, s0j is not safe and it is necessary to control number of waiting passengers to satisfy W0j≤PL0j to assure the safety of s0.Figure 1
Compositions of waiting passengers in transfer station.
(a)
(b)Suppose traintr departs from s3, goes to s4, and passes by s02. The passengers who wait for tr at s02 consist of passengers who depart from s1 or s2 and go to s4 and passengers who enter s0 and depart from s02. Here denote Wi-0j(i≠0) as the passengers who enter si(i≠0), alight from train at s01 and wait tr in s02. When the number of transferring passengers satisfies ∑i=23Wi-0j>PLi-0j, even though there are no passengers who enter s0 and no passengers who get on tr at s3, the safety of s0 cannot be guaranteed because of too many waiting passengers. Under this condition, it is necessary to limit the number of inflow at si(i≠0) to assure W0j≤PL0j.According to above illustration, it is necessary to use method of CPICN to assure safe of transfer station in real network when there are too much transferring passengers.


## 2.2. How to Evaluate Solution of CPICN

Passenger inflow control can change the number of passengers waiting outside or inside of stations. The waiting time of passengers can be changed along with it. The waiting time of a passenger may consist of several parts shown in Figure2. These waiting parts can be classified into three types: W1, W2, and W3. W1 represents the waiting time outside of station caused by inflow control, W2 represents the waiting time used to wait for the first coming train, and W3 represents the waiting time used to wait for the next coming train which can be boarded because of insufficient capacity of the first coming train. W2 is inevitable for a trip. W1 and W3 are extra delay for passengers’ trip, which can be changed and controlled by inflow control. Here we name the sum of W1 and W3 as time of delay (TD).Figure 2
Example of compositions of waiting time.DenoteTDOCp as the time used by passenger p to wait outside of station because of inflow control, which corresponds to W1. Denote TDIOp as the extra time used to wait for next train that can be boarded, which corresponds to W3. TD for a special passenger p can be described as follows:(1)TDp=TDOCp+TDIOp.Inflow control leads to less TD for some passengers while more TD for some other passengers. So we useATD to evaluate the solution which represents average TD. It is computed according to (2), where PA is the set of passengers in whole network and PAC is the number of passengers in PA. For the fixed transport capacity of network, if ATD is less, more passengers are served and the control solution is better(2)ATD=∑p∈PATDpPAC.Moreover, it exists that some passengers have longer TD than others. IfTDp is much longer than TDp′(p′∈PA-{p}), it is unfair for passenger p. So we define MTD to represent the longest TDp, which can be described as (3). The solution is better while MTD is less(3)MTD=max⁡TDp,p∈PA.Thus, the general efficiency and individual interest are both considered. The solution of CPICN is needed to satisfy minimumATD and MTD.


## 3. Building Model of CPICN

### 3.1. Assumptions of Model

To simplify the problem and highlight the key conceptions, some assumptions are given as follows.(1)
The time-dependent O-D trip demand is known and discretized into time segments. It is a uniform random passenger arrival distribution in a time segmentΔts.(2)
The control solution is time varying for every station.(3)
Passengers queue and board trains according to first-in-first-out discipline.(4)
All passengers who enter transit network will reach their planned destination and will not give up the trip at midway.(5)
All transit trains have fixed capacity and operate precisely according to specified timetables.(6)
Capacity of platform is used as the capacity of station supplied for waiting passengers.(7)
In a transfer station, different lines use different platforms.


### 3.2. Model of CPICN

According to Section2.2, the objective of CPICN should minimize ATD and MTD, which is described as (4a). The constraints of model encompass capacity of station, capacity of train, O-D demand, and flow conservation, which are described as (4b)–(4e)(4a)minATD∧min⁡MTD(4b)S.T.Wij≤PLij(4c)tptr≤tctr(4d)cits≤wits(4e)tptri-altri+abtri=tptri+1.Equation (4b) represents that the number of waiting passenger in sij should not exceed PLij.Equation (4c) represents that the number of passengers aboard train tr should not exceed the capacity of tr, where tptr is denoted as number of passengers aboard tr, tctr as capacity of tr.In (4d), cits is the maximum number of passengers allowed to enter station si under control in time segment ts, and wits is the number of passengers who want to enter station si in this time segment. wits can be expressed as (5), where aits is the number of arrival passengers who arrive at si in time segment ts,andts-1 is the time segment before ts(5)wits=aits+wits-1-cits-1,ts>1,wi1=ai1.Equation (4e) corresponds to assumption (4a), (4b), (4c), (4d), and (4e), where tptri is the number of passengers on tr when tr arrives at station si. altri and abtri represent the number of passengers alighting from tr and boarding tr at si, respectively. tptri+1 represents the number of passengers on tr when tr arrives at next station si+1.


## 3.1. Assumptions of Model

To simplify the problem and highlight the key conceptions, some assumptions are given as follows.(1)
The time-dependent O-D trip demand is known and discretized into time segments. It is a uniform random passenger arrival distribution in a time segmentΔts.(2)
The control solution is time varying for every station.(3)
Passengers queue and board trains according to first-in-first-out discipline.(4)
All passengers who enter transit network will reach their planned destination and will not give up the trip at midway.(5)
All transit trains have fixed capacity and operate precisely according to specified timetables.(6)
Capacity of platform is used as the capacity of station supplied for waiting passengers.(7)
In a transfer station, different lines use different platforms.


## 3.2. Model of CPICN

According to Section2.2, the objective of CPICN should minimize ATD and MTD, which is described as (4a). The constraints of model encompass capacity of station, capacity of train, O-D demand, and flow conservation, which are described as (4b)–(4e)(4a)minATD∧min⁡MTD(4b)S.T.Wij≤PLij(4c)tptr≤tctr(4d)cits≤wits(4e)tptri-altri+abtri=tptri+1.Equation (4b) represents that the number of waiting passenger in sij should not exceed PLij.Equation (4c) represents that the number of passengers aboard train tr should not exceed the capacity of tr, where tptr is denoted as number of passengers aboard tr, tctr as capacity of tr.In (4d), cits is the maximum number of passengers allowed to enter station si under control in time segment ts, and wits is the number of passengers who want to enter station si in this time segment. wits can be expressed as (5), where aits is the number of arrival passengers who arrive at si in time segment ts,andts-1 is the time segment before ts(5)wits=aits+wits-1-cits-1,ts>1,wi1=ai1.Equation (4e) corresponds to assumption (4a), (4b), (4c), (4d), and (4e), where tptri is the number of passengers on tr when tr arrives at station si. altri and abtri represent the number of passengers alighting from tr and boarding tr at si, respectively. tptri+1 represents the number of passengers on tr when tr arrives at next station si+1.


## 4. Solution Procedure

### 4.1. Method Used to Solve Model

According to assumption (2), the solution of model can be expressed as in (6), where n is the number of stations and m is the number of time segments (the solution of model): (6)C=c11⋯c1m⋮⋮⋮cn1⋯cnmThe maximum numbers of passengers allowed to enter station in different time segments of different stations influence each other for the constraints of model. Because of the complexity, particle swarm optimization (PSO) for constrained optimization problem is chosen to solve the model.Particle swarm optimization (PSO) originally was developed by Eberhart and Kennedy in 1995 [9], which belongs to a class of methods known as evolutionary computation. It hypothesizes that there are m particles in the D dimensions’ space. Fitness function used to evaluate particles in space. For the particle i of iterative t+1 generation, the position and velocity of particles are adjusted according to the position and velocity in the previous t generation, as follows:(7)vidt+1=vidt+c1r1×pidt-xidt+c2r2pgdt-xidt,(8)xidt+1=xidt+vidt+1,where xid and vid are position and velocity of particle i in dimensionality d. c1 and c2 are weight coefficients of the particle individual and r1 and r2 are two random functions whose values are between 0 and 1. pid represents the previous best local position of the particle i. pgd represents the best global position found up by the whole swarm.An important improvement in the basic PSO is the use of an inertia factorω [10] that multiplies the velocity term in (7), as shown in (9). In general, ω starts large and is decremented from wini to wend during the evolution of the algorithm as shown in (10), where Gk is the largest generation of algorithm(9)vidt+1=ωvidt+c1r1×pidt-xidt+c2r2pgdt-xidt,(10)ωt=wini-wend×Gk-tGk+wend.Clerc and Kennedy [11] proposed an alternative version of PSO in which the convergence factor is used, and the velocity adjustment is given as(11)vidt+1=kωvidt+c1r1×pidt-xidt+c2r2pgdt-xidt,where k is the convergent factor, which is computed as (12), where ϕ=c1+c2>4(12)k=22-ϕ-ϕ2-4ϕ.PSO for constrained optimization problem finds optimal location of particle which has best fitness and satisfies the constraints. The approaches focus on several ways, such as adding penalty function to fitness function [12], valuing the infeasible solution by constraints violation [13, 14], adapting PSO parameters according to constraints violation [15, 16], generating new feasible solution [17], and adjusting parameters to make infeasible solution become feasible [18].Referencing [13, 18], when adjusting infeasible solution to feasible, the rule updating best solution is described as follows.Rule 1.
(
1
) Any feasible solution is preferred to any infeasible solution.
(
2
) Between two feasible solutions, the one having smaller ATD and smaller MTD is preferred.
(
3
) Between two infeasible solutions, the one having smaller constraint violation is preferred.
Moreover, infeasible solution is valuable for finding optimal solution. Some researchers proposed “Do not kill unfeasible individuals” [19] and “Unfeasible individuals may well contain information valuable enough for them to be preserved” [20]. So we divide particles into two subpopulations. The best solution in population 1 must be feasible, and the best solution in population 2 is not constrained by feasible space. Two populations cross obeying fix rate ρ.The rules updating best solution of population 1 (po1) and population 2 (po2) are described as Rules 2 and 3, respectively.Rule 2.
(
1
) Any feasible solution is preferred to any infeasible solution.
(
2
) Between two feasible solutions, the one having smaller ADT and smaller MDT is preferred.Rule 3.
The one having smaller ADT and smaller MDT is preferred.When crossing, velocity of particlei is computed according to (13), where j is the index of population, such as pgd1(t) is the best solution in po1 and pgd2(t) is the best solution in po2(13)vidjt+1=kωvidjt+c1r1×pidjt-xidjt+c2r2pgd2-jt-xidjt,j∈1,2.Adjust infeasible solution to feasible solution referencing [18] when the rate of infeasible solution exceeds up limit of rIF. rIF of population po is computed as (14), where QIFpo is the number of infeasible solutions in po and Qpo is the size of po. The up limit of rIF is β in this paper(14)rIFpo=QIFpoQpo.


### 4.2. Solving Procedure

Based on the above method, the flow for solving procedure is shown in Figure3, where network loading includes load lines, stations, transfer relationship, and schedule.Figure 3
Flow of solving procedure.In the procedure, fitness function is computed by simulation referencing [21–23]. During simulating, set the limit of inflow according to location of particle, update the number of passengers outside of stations, in stations, and on the trains with the train arriving and departing, and compute MTD and ATD at the end of simulating.


## 4.1. Method Used to Solve Model

According to assumption (2), the solution of model can be expressed as in (6), where n is the number of stations and m is the number of time segments (the solution of model): (6)C=c11⋯c1m⋮⋮⋮cn1⋯cnmThe maximum numbers of passengers allowed to enter station in different time segments of different stations influence each other for the constraints of model. Because of the complexity, particle swarm optimization (PSO) for constrained optimization problem is chosen to solve the model.Particle swarm optimization (PSO) originally was developed by Eberhart and Kennedy in 1995 [9], which belongs to a class of methods known as evolutionary computation. It hypothesizes that there are m particles in the D dimensions’ space. Fitness function used to evaluate particles in space. For the particle i of iterative t+1 generation, the position and velocity of particles are adjusted according to the position and velocity in the previous t generation, as follows:(7)vidt+1=vidt+c1r1×pidt-xidt+c2r2pgdt-xidt,(8)xidt+1=xidt+vidt+1,where xid and vid are position and velocity of particle i in dimensionality d. c1 and c2 are weight coefficients of the particle individual and r1 and r2 are two random functions whose values are between 0 and 1. pid represents the previous best local position of the particle i. pgd represents the best global position found up by the whole swarm.An important improvement in the basic PSO is the use of an inertia factorω [10] that multiplies the velocity term in (7), as shown in (9). In general, ω starts large and is decremented from wini to wend during the evolution of the algorithm as shown in (10), where Gk is the largest generation of algorithm(9)vidt+1=ωvidt+c1r1×pidt-xidt+c2r2pgdt-xidt,(10)ωt=wini-wend×Gk-tGk+wend.Clerc and Kennedy [11] proposed an alternative version of PSO in which the convergence factor is used, and the velocity adjustment is given as(11)vidt+1=kωvidt+c1r1×pidt-xidt+c2r2pgdt-xidt,where k is the convergent factor, which is computed as (12), where ϕ=c1+c2>4(12)k=22-ϕ-ϕ2-4ϕ.PSO for constrained optimization problem finds optimal location of particle which has best fitness and satisfies the constraints. The approaches focus on several ways, such as adding penalty function to fitness function [12], valuing the infeasible solution by constraints violation [13, 14], adapting PSO parameters according to constraints violation [15, 16], generating new feasible solution [17], and adjusting parameters to make infeasible solution become feasible [18].Referencing [13, 18], when adjusting infeasible solution to feasible, the rule updating best solution is described as follows.Rule 1.
(
1
) Any feasible solution is preferred to any infeasible solution.
(
2
) Between two feasible solutions, the one having smaller ATD and smaller MTD is preferred.
(
3
) Between two infeasible solutions, the one having smaller constraint violation is preferred.
Moreover, infeasible solution is valuable for finding optimal solution. Some researchers proposed “Do not kill unfeasible individuals” [19] and “Unfeasible individuals may well contain information valuable enough for them to be preserved” [20]. So we divide particles into two subpopulations. The best solution in population 1 must be feasible, and the best solution in population 2 is not constrained by feasible space. Two populations cross obeying fix rate ρ.The rules updating best solution of population 1 (po1) and population 2 (po2) are described as Rules 2 and 3, respectively.Rule 2.
(
1
) Any feasible solution is preferred to any infeasible solution.
(
2
) Between two feasible solutions, the one having smaller ADT and smaller MDT is preferred.Rule 3.
The one having smaller ADT and smaller MDT is preferred.When crossing, velocity of particlei is computed according to (13), where j is the index of population, such as pgd1(t) is the best solution in po1 and pgd2(t) is the best solution in po2(13)vidjt+1=kωvidjt+c1r1×pidjt-xidjt+c2r2pgd2-jt-xidjt,j∈1,2.Adjust infeasible solution to feasible solution referencing [18] when the rate of infeasible solution exceeds up limit of rIF. rIF of population po is computed as (14), where QIFpo is the number of infeasible solutions in po and Qpo is the size of po. The up limit of rIF is β in this paper(14)rIFpo=QIFpoQpo.


## 4.2. Solving Procedure

Based on the above method, the flow for solving procedure is shown in Figure3, where network loading includes load lines, stations, transfer relationship, and schedule.Figure 3
Flow of solving procedure.In the procedure, fitness function is computed by simulation referencing [21–23]. During simulating, set the limit of inflow according to location of particle, update the number of passengers outside of stations, in stations, and on the trains with the train arriving and departing, and compute MTD and ATD at the end of simulating.


## 5. Numerical Experiments

### 5.1. Background of Experiments

In order to demonstrate the key features of CPICN, experiments are carried out on a simple network with many-to-one OD flow shown in Figure1. The inflows of s0,s1,s2,s3 are the same, which are time varying as shown in Table 1.Table 1
Time varying O-D demand.
6:30–7:00
7:00–7:30
7:30–8:00
8:00–8:30
8:30–9:00
2100
4200
6300
4200
2100The safe limit of platform is 1800. The capacity of train is 1856. The headway of trains is 180 seconds and the time holding on station of trains is 30 seconds. The running time between two stations of trains is 300 seconds. The transfer time in transfer station is 120 seconds.


### 5.2. Effectiveness of Algorithm

Algorithms are programed by Java and compiled by JDK 7.25 for Windows x64 in Eclipse 10. Experiments are tested on a personal computer with an Intel Core i5, 2.50 GHz CPU, and 4 GB RAM. The parameters of algorithms are set as shown in Table2.Table 2
Parameters of algorithm.
ρ
β
C
1
C
2
w
ini
w
end
Gk
0.5
0.95
2.1
2.1
0.9
0.1
500The algorithm in this paper is named as Algorithm  A. The algorithm proposed by Sun et al. [18] is named as Algorithm  B. 50 times experiments are carried out by two different algorithms with different sizes of population, respectively. The comparison of ATD, MTD, and average running times with different algorithms are shown in Table 3. The better optimal solution can be obtained by Algorithm  A than Algorithm  B.Table 3
Comparison of solution with different algorithms.
Algorithm
Number of populations
Q
po
Best
Average
Average running time (seconds)
ATD
MTD
ATD
MTD
Algorithm A
2
40
193
660
200
812
26
Algorithm B
1
80
195
780
432
1260
26
Algorithm A
2
80
192
660
195
775
51
Algorithm B
1
160
196
720
292
985
54The distribution of optimal solutions under Algorithm  A(Qpo=80) is shown in Figure 4.Figure 4
Distribution of optimal solutions.Choose a running; the procedure of convergence of ADT and MDT are shown in Figures5 and 6, respectively.Figure 5
Convergence curve of ATD.Figure 6
Convergence curve of MTD.


### 5.3. Analyzing the Results of Experiments

An optimal solution of model A is chosen, in which ATD is 194 seconds and MTD is 660 seconds. The detail of solution is shown in Table4, where eight time segments during 7:30–8:50 are chosen.Table 4
Example of optimal solution.
Station name
7:30–7:40
7:40–7:50
7:50–8:00
8:00–8:10
8:10–8:20
8:20–8:30
8:30–8:40
8:40–8:50
S
1
2100
1660
1290
1330
1490
1310
1770
950
S
2
1260
2010
1340
1700
1370
1710
1810
700
S
3
1150
1430
1900
1670
2000
1770
1280
700
S
0
2100
1450
1240
1810
1510
1280
1300
1210The key indicators of the solutions are compared with the past research which is proposed by Zhao et al. [6]. The model in this paper is named as model A. The model proposed by Zhao et al. [6] is named as model B. Comparison of key indicators under different conditions is shown in Table 5. The key indicators become better under control than the one without control. The value of MDT under control of model A is better than that of model B. The maximum number of waiting passengers under control of model A is less than the safety limitation of station.Table 5
Comparison of key indicators.
ADT
MDT
max
⁡
(
W
i
)
W
i
≤
P
L
i
Without control
178
900
7545
No
Under control of model A
194
660
1799
Yes
Under control of model B
162
900
7530
NoThe comparison of maximum number of passengers delayed under control against the one without control is shown in Table6. It can be observed that the large number of passengers waiting next coming trains in S0 is shared by other stations through inflow control.Table 6
Comparison of maximum number of passenger delayed.
S
0
S
1
S
2
S
3
Without control
Outside of station
0
0
0
0
In station
6214
0
0
0
Under control
Outside of station
1428
1316
1652
1752
In station
486
0
0
0


## 5.1. Background of Experiments

In order to demonstrate the key features of CPICN, experiments are carried out on a simple network with many-to-one OD flow shown in Figure1. The inflows of s0,s1,s2,s3 are the same, which are time varying as shown in Table 1.Table 1
Time varying O-D demand.
6:30–7:00
7:00–7:30
7:30–8:00
8:00–8:30
8:30–9:00
2100
4200
6300
4200
2100The safe limit of platform is 1800. The capacity of train is 1856. The headway of trains is 180 seconds and the time holding on station of trains is 30 seconds. The running time between two stations of trains is 300 seconds. The transfer time in transfer station is 120 seconds.


## 5.2. Effectiveness of Algorithm

Algorithms are programed by Java and compiled by JDK 7.25 for Windows x64 in Eclipse 10. Experiments are tested on a personal computer with an Intel Core i5, 2.50 GHz CPU, and 4 GB RAM. The parameters of algorithms are set as shown in Table2.Table 2
Parameters of algorithm.
ρ
β
C
1
C
2
w
ini
w
end
Gk
0.5
0.95
2.1
2.1
0.9
0.1
500The algorithm in this paper is named as Algorithm  A. The algorithm proposed by Sun et al. [18] is named as Algorithm  B. 50 times experiments are carried out by two different algorithms with different sizes of population, respectively. The comparison of ATD, MTD, and average running times with different algorithms are shown in Table 3. The better optimal solution can be obtained by Algorithm  A than Algorithm  B.Table 3
Comparison of solution with different algorithms.
Algorithm
Number of populations
Q
po
Best
Average
Average running time (seconds)
ATD
MTD
ATD
MTD
Algorithm A
2
40
193
660
200
812
26
Algorithm B
1
80
195
780
432
1260
26
Algorithm A
2
80
192
660
195
775
51
Algorithm B
1
160
196
720
292
985
54The distribution of optimal solutions under Algorithm  A(Qpo=80) is shown in Figure 4.Figure 4
Distribution of optimal solutions.Choose a running; the procedure of convergence of ADT and MDT are shown in Figures5 and 6, respectively.Figure 5
Convergence curve of ATD.Figure 6
Convergence curve of MTD.


## 5.3. Analyzing the Results of Experiments

An optimal solution of model A is chosen, in which ATD is 194 seconds and MTD is 660 seconds. The detail of solution is shown in Table4, where eight time segments during 7:30–8:50 are chosen.Table 4
Example of optimal solution.
Station name
7:30–7:40
7:40–7:50
7:50–8:00
8:00–8:10
8:10–8:20
8:20–8:30
8:30–8:40
8:40–8:50
S
1
2100
1660
1290
1330
1490
1310
1770
950
S
2
1260
2010
1340
1700
1370
1710
1810
700
S
3
1150
1430
1900
1670
2000
1770
1280
700
S
0
2100
1450
1240
1810
1510
1280
1300
1210The key indicators of the solutions are compared with the past research which is proposed by Zhao et al. [6]. The model in this paper is named as model A. The model proposed by Zhao et al. [6] is named as model B. Comparison of key indicators under different conditions is shown in Table 5. The key indicators become better under control than the one without control. The value of MDT under control of model A is better than that of model B. The maximum number of waiting passengers under control of model A is less than the safety limitation of station.Table 5
Comparison of key indicators.
ADT
MDT
max
⁡
(
W
i
)
W
i
≤
P
L
i
Without control
178
900
7545
No
Under control of model A
194
660
1799
Yes
Under control of model B
162
900
7530
NoThe comparison of maximum number of passengers delayed under control against the one without control is shown in Table6. It can be observed that the large number of passengers waiting next coming trains in S0 is shared by other stations through inflow control.Table 6
Comparison of maximum number of passenger delayed.
S
0
S
1
S
2
S
3
Without control
Outside of station
0
0
0
0
In station
6214
0
0
0
Under control
Outside of station
1428
1316
1652
1752
In station
486
0
0
0


## 6. Conclusion

In this paper, CPICN is proposed considering the safety of stations. The model of CPICN is built with the objective of minimizing ADT and MDT under constraint of capacity of station and train, O-D demand, schedule, and flow conservation. The PSO method for constrained problem is used to solving the model, which integrates the approaches about adjusting infeasible solution to feasible solution and crossing infeasible solution to feasible solution. The numerical experiments are carried out to prove the feasibility and effectiveness of the model and solving algorithm.For the further research, the solving algorithm will be experimented and applied to the real network. Moreover the route choice about passengers under control measure will be the focus.



---

*Source: 695948-2015-10-27.xml*