# US 2025/0145198 A1 · Coordinated control method for urban rail transit passenger flow, electronic device, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0145198 A1
- Document ID: US20250145198A1
- Status: Published application
- Kind: A1
- Application number: 18/950,191
- Filed: 2024-11-18
- Published: 2025-05-08
- Earliest claimed: 2023-11-07
- Assignees: Shenzhen Urban Transport Planning Center Co., Ltd.
- Applicants: Shenzhen Urban Transport Planning Center Co., Ltd.
- Inventors: XIAOCHUN ZHANG; TAO LIN; YUXING YANG; ZHENWU CHEN; XING LIU; QIAN KAN; YONG ZHOU
- Web page: https://patentgrep.com/patent/US20250145198A1

## CPC

- B61L 27/16: Trackside optimisation of vehicle or train operation
- B61L 27/12: Preparing schedules
- B61L 27/60: Testing or simulation
- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/0674: {using process simulation}
- G06Q 30/0201: Market modelling; Market analysis; Collecting market data
- G06Q 50/26: Government or public services (business processes related to the transportation industry G06Q50/40)
- G06F 2111/10: Numerical modelling
- B61L: GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC (brakes or auxiliary equipment B61H, B61K; point or crossing construction E01B)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Disclosed are a coordinated control method for urban rail transit passenger flow, an electronic device, and a storage medium. The method includes: predicting passenger flow in peak hours of urban rail lines using a simulation deduction function in a rail simulation system, including station entry ID, station exit ID, station entry time period, and passenger number data; obtaining passenger flow of passengers arriving at stations s and preparing to board during time periods t by dividing according to the different time periods t and the stations s; counting passenger flow in each direction of historical passenger flow, and calculating a proportion of the passenger flow in each direction of the historical passenger flow; constructing a mixed integer programming model of multi-station passenger flow coordinated control; and obtaining an optimal station entry passenger flow scheme by solving the mixed integer programming model of multi-station passenger flow coordinated control.

## Claims

### Claim 1

A coordinated control method for urban rail transit passenger flow, comprising the following steps:
S1, acquiring predicted passenger flow in peak hours of lines using a rail simulation system, and predicting passenger flow in peak hours of urban rail lines using a simulation deduction function in the rail simulation system, comprising station entry ID, station exit ID, station entry time period, and passenger number data; and dividing a time interval from the start to the end of the peak hours into a set of time periods with a 5-minute step, denoted as T;
S2, obtaining, based on the predicted passenger flow in peak hours of urban rail lines obtained in step S1, passenger flow At,s of passengers arriving at stations s and preparing to board in time periods t by dividing according to the different time periods t and the stations s; and
counting passenger flow in each direction of the historical passenger flow according to historical passenger flow sorting data of a metro operation company, and obtaining a passenger flow proportion qt,so,sd of passengers departing from an oth station so and arriving at a dth station sd in the time periods t by calculating a proportion of the passenger flow in each direction of the historical passenger flow;
S3, constructing a mixed integer programming model of multi-station passenger flow coordinated control; and
S4, obtaining an optimal station entry passenger flow scheme by solving the mixed integer programming model of multi-station passenger flow coordinated control constructed in step S3 using a branch and bound algorithm.

### Claim 2 (depends on 1)

The coordinated control method for urban rail transit passenger flow according to claim 1, wherein obtaining the passenger flow proportion qt,so,sd of passengers departing from the oth station so and arriving at the dth station sd in the time periods t by calculating the proportion of the passenger flow in each direction of the historical passenger flow in step S2 specifically comprises the following step:
denoting a number of passengers departing from the oth station so and arriving at the dth station sd in the time periods t in a data set as Ot,so,sd, and denoting a number of all passengers departing from the oth station so as Qt,so, so the calculation expression of the passenger flow proportion qt,so,sd of the passengers departing from the oth station so and arriving at the dth station sd in the time periods tis:
q
t
,
s
o
,
s
d
=
O
t
,
s
o
,
s
d
Q
t
,
s
o
.

### Claim 3 (depends on 1)

The coordinated control method for urban rail transit passenger flow according to claim 1, wherein step S3 comprises the following steps:
S3.1, constructing the mixed integer programming model of multi-station passenger flow coordinated control, with the calculation expression as follows:
min
⁢
∑
t
∈
T
∑
s
∈
S
A
t
,
s
(
D
t
,
s
-
P
t
,
s
)
wherein min represents a minimization function, and S represents a set of stations;
Dt,s represents an actual boarding demand at the stations s in the time periods t, comprising a number of passengers arriving at the stations in the time periods t and a number of passengers stranded in previous time periods, which is an integer variable of the mixed integer programming model of multi-station passenger flow coordinated control; and
Pt,s represents an optimal number of passengers who board at the stations s in the time periods t, which is an integer variable of the mixed integer programming model of multi-station passenger flow coordinated control; and
S3.2, constructing constraints of the mixed integer programming model of multi-station passenger flow coordinated control.

### Claim 4 (depends on 2)

The coordinated control method for urban rail transit passenger flow according to claim 2, wherein step S3 comprises the following steps:
S3.1, constructing the mixed integer programming model of multi-station passenger flow coordinated control, with the calculation expression as follows:
min
⁢
∑
t
∈
T
∑
s
∈
S
A
t
,
s
(
D
t
,
s
-
P
t
,
s
)
wherein min represents a minimization function, and S represents a set of stations;
Dt,s represents an actual boarding demand at the stations s in the time periods t, comprising a number of passengers arriving at the stations in the time periods t and a number of passengers stranded in previous time periods, which is an integer variable of the mixed integer programming model of multi-station passenger flow coordinated control; and
Pt,s represents an optimal number of passengers who board at the stations s in the time periods t, which is an integer variable of the mixed integer programming model of multi-station passenger flow coordinated control; and
S3.2, constructing constraints of the mixed integer programming model of multi-station passenger flow coordinated control.

### Claim 5 (depends on 3)

The coordinated control method for urban rail transit passenger flow according to claim 3, wherein step S3.2 comprises the following steps:
S3.2.1, setting an actual boarding demand for passenger flow in a first time period at the beginning of peak hours to be equal to passenger flow of passengers arriving at the stations and preparing to board in the first time period at the beginning of the peak hours, with the calculation expression as follows:
D1,s=A1,s,∀s∈S
wherein D1,s represents the actual boarding demand at the stations s in the first time period at the beginning of the peak hours, and A1,s represents the passenger flow of passengers arriving at the stations s and preparing to board in the first time period at the beginning of the peak hours;
S3.2.2, setting an actual boarding demand for passenger flow in a certain time period t to be equal to a sum of passenger flow of passengers arriving at the stations and preparing to board in the certain time period t and passenger flow of passengers stranded in a previous time period of the certain time period t, with the calculation expression as follows:
D
t
,
s
=
A
t
,
s
+
(
D
t
-
1
,
s
-
P
t
-
1
,
s
)
,
∀
s
∈
S
,
∀
t
∈
T
,
t
>
1
wherein Dt-1,s represents the actual boarding demand at the stations s in the previous time period of the certain time period t, and Pt-1,s represents an optimal number of passengers boarding at the stations s in the previous time period of the certain time period t;
S3.2.3, setting an upper/lower bound of optimal station entry passenger flow, wherein a value of the upper/lower bound of the optimal station entry passenger flow is greater than or equal to 0.15 times of the actual boarding passenger flow, and less than or equal to the actual boarding passenger flow, with the calculation expression as follows:
0
.
1
⁢
5
*
D
t
,
s
≤
P
t
,
s
≤
D
t
,
s
,
∀
s
∈
S
,
∀
t
∈
T
S3.2.4, setting a number of passengers who don't get off at a certain station s in the certain time period t to be equal to a sum of corresponding passengers who enter stations which are in front of the certain station s before the certain time period t and whose destination stations are behind the certain station s, with the calculation expression as follows:
M
t
,
s
=
∑
s
o
∈
S
s
o
∑
s
d
∈
S
s
d
∑
t
o
∈
T
s
s
o
,
s
d
(
P
t
o
,
s
o
·
q
t
o
,
s
o
,
s
d
)
,
∀
s
∈
S
,
∀
t
∈
T
wherein Mt,s represents a number of passengers who don't get off at the certain station s in the certain time period t, which is a continuous variable defined by the mixed integer programming model of multi-station passenger flow coordinated control; and
Sso represents a set of upstream stations of the stations s; Ssd represents a set of downstream stations of the stations s; Tsso,sd represents that there is a time period set in which passengers depart from the oth station so to the dth station sd, and the time periods in the set meet the requirement that when time increases to the time periods t, passengers are capable of arriving at the stations S; qto,so,sd represents a passenger flow proportion of passengers departing from the oth station so and arriving at the dth station sd in a time period to; and Pto,so represents an optimal number of passengers who boards at a station so in the time period to.

### Claim 6 (depends on 4)

The coordinated control method for urban rail transit passenger flow according to claim 4, wherein step S3.2 comprises the following steps:
S3.2.1, setting an actual boarding demand for passenger flow in a first time period at the beginning of peak hours to be equal to passenger flow of passengers arriving at the stations and preparing to board in the first time period at the beginning of the peak hours, with the calculation expression as follows:
D1,s=A1,s,∀s∈S
wherein D1,s represents the actual boarding demand at the stations s in the first time period at the beginning of the peak hours, and A1,s represents the passenger flow of passengers arriving at the stations s and preparing to board in the first time period at the beginning of the peak hours;
S3.2.2, setting an actual boarding demand for passenger flow in a certain time period t to be equal to a sum of passenger flow of passengers arriving at the stations and preparing to board in the certain time period t and passenger flow of passengers stranded in a previous time period of the certain time period t, with the calculation expression as follows:
D
t
,
s
=
A
t
,
s
+
(
D
t
-
1
,
s
-
P
t
-
1
,
s
)
,
∀
s
∈
S
,
∀
t
∈
T
,
t
>
1
wherein Dt-1,s represents the actual boarding demand at the stations s in the previous time period of the certain time period t, and Pt-1,s represents an optimal number of passengers boarding at the stations s in the previous time period of the certain time period t;
S3.2.3, setting an upper/lower bound of optimal station entry passenger flow, wherein a value of the upper/lower bound of the optimal station entry passenger flow is greater than or equal to 0.15 times of the actual boarding passenger flow, and less than or equal to the actual boarding passenger flow, with the calculation expression as follows:
0
.
1
⁢
5
*
D
t
,
s
≤
P
t
,
s
≤
D
t
,
s
,
∀
s
∈
S
,
∀
t
∈
T
S3.2.4, setting a number of passengers who don't get off at a certain station s in the certain time period t to be equal to a sum of corresponding passengers who enter stations which are in front of the certain station s before the certain time period t and whose destination stations are behind the certain station so with the calculation expression as follows:
M
t
,
s
=
∑
s
o
∈
S
s
o
∑
s
d
∈
S
s
d
∑
t
o
∈
T
s
s
o
,
s
d
(
P
t
o
,
s
o
·
q
t
o
,
s
o
,
s
d
)
,
∀
s
∈
S
,
∀
t
∈
T
wherein Mt,s represents a number of passengers who don't get off at the certain station s in the certain time period t, which is a continuous variable defined by the mixed integer programming model of multi-station passenger flow coordinated control; and
Sso represents a set of upstream stations of the stations s; Ssd represents a set of downstream stations of the stations s; Tsso,sd represents that there is a time period set in which passengers depart from the oth station so to the dth station sd, and the time periods in the set meet the requirement that when time increases to the time periods t, passengers are capable of arriving at the stations s; qto,so,sd represents a passenger flow proportion of passengers departing from the oth station so and arriving at the dth station sd in a time period to; and Pto,so represents an optimal number of passengers who boards at a station so in the time period to.

### Claim 7 (depends on 1)

The coordinated control method for urban rail transit passenger flow according to claim 1, wherein step S4 comprises the following steps:
S4.1, linearly relaxing the mixed integer programming model of multi-station passenger flow coordinated control obtained in step S3 into a linear programming model, i.e., allowing a value of Pt,s to be an integer, which is denoted as a relaxation model, and obtaining an optimal solution of linear programming by invoking a simplex algorithm to solve;
S4.2, selecting, according to the requirement that Pt,s needs to meet an integer feasible region thereof, any non-integer solution variable from Pt,s for binary division, adding a constraint Pt,s≤└Pt,s┘ to the relaxation model in step S4.1 to obtain a sub-problem 1 model, denoted as sub-problem 1, and adding a constraint Pt,s≥┌Pt,s┐ to the relaxation model in step S4.1 to obtain a sub-problem 2 model, denoted as sub-problem 2, and solving by invoking the simplex algorithm separately;
S4.3, calculating a value of an objective function Σt∈TΣs∈SAt,s(Dt,s−Pt,s) in the sub-problem 1 or sub-problem 2 obtained in step S4.2, and taking a maximum value as a lower bound value of the objective function of the mixed integer programming model of multi-station passenger flow coordinated control; and
S4.4, performing further branching for the sub-problems that the value of the objective function is greater than or equal to the lower bound value of the objective function of the mixed integer programming model of multi-station passenger flow coordinated control and the solution is a non-integer, and repeating steps S4.2, S4.3 and S4.4 until an optimal integer solution is obtained.

### Claim 8 (depends on 1)

An electronic device, comprising a memory and a processor, wherein the memory stores a computer program which, when executed by the processor, causes the processor to implement the steps of the coordinated control method for urban rail transit passenger flow according to claim 1.

### Claim 9 (depends on 1)

A storage medium, which is a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, causes the processor to implement the coordinated control method for urban rail transit passenger flow according to claim 1.
