Train operation scheme compiling method and device based on distributed robust opportunity constraint model

Through the combination of distributed robust opportunity constraint model and mixed integer linear planning model, the problem of uncertainty in the preparation of train operation plans is solved, and the rapid and accurate preparation of train operation plans is achieved, reducing the waste of transportation resources and calculation costs are reduced. .

CN119026848AActive Publication Date: 2024-11-26TSINGHUA UNIVERSITY

Patent Information

Application Number
CN202411072465.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-06
Publication Date
2024-11-26
Estimated Expiration
2044-08-06

AI Technical Summary

Technical Problem

When facing uncertainty in passenger demand, the existing train operation plan preparation method is difficult to quickly and accurately match travel needs, resulting in waste of transportation resources and low computing efficiency.

Method used

Using a distributed robust opportunity constraint model, the number of trains in the direct process is used as the decision variable, a distributed robust opportunity constraint model is constructed and converted into a mixed integer linear programming model, and the passenger demand sample under the worst distribution is calculated. The advantage is to obtain the initial feasible solution to narrow the feasible domain and then solve the train running plan.

Benefits of technology

It has achieved rapid and accurate preparation of train operation plans that meet passenger needs under fluctuations in passenger demand, improved computing efficiency, and ensured the minimization of train operating costs and the satisfaction of demand.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026848A_ABST
    Figure CN119026848A_ABST
Patent Text Reader

Abstract

The invention provides a train operation scheme compilation method and device based on a distributed robust opportunity constraint model, and the method comprises the steps: taking the number of trains in a direct process as a decision variable, taking the minimization of the operation cost as a target, and constructing the distributed robust opportunity constraint model for train operation scheme compilation; converting the distribution robust chance constraint model into a mixed integer linear programming model through a linearization mode; according to the passenger demand sample under the worst distribution, an optimal value under deterministic problem planning is calculated, an initial feasible solution is obtained according to the optimal value, and the initial feasible solution is used for representing an upper bound of a feasible region of the mixed integer linear programming model; and according to the initial feasible solution, solving the mixed integer linear programming model to obtain a train operation scheme. According to the method, under the condition that the passenger demands cannot be accurately estimated, all passenger demands can still be met with the given probability, and the train operation scheme meeting the passenger demands can be rapidly and accurately compiled.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of railway scheduling and resource optimization, and in particular to a method and device for compiling a train operation plan based on a distributed robust opportunity constraint model. Background Art

[0002] Railway systems play a vital role in modern transportation, and effective railway line planning becomes particularly critical when dealing with demand uncertainty. Usually, railway planning includes several key stages: travel demand estimation, operation plan preparation, timetable formulation, platform allocation and personnel scheduling. Among these stages, operation plan preparation is one of the most important issues, which requires matching the estimated travel demand and determining the starting point, end point, stop mode, frequency and capacity of each line / train. Since the operation plan preparation is usually carried out weeks or months in advance of the operation, there is significant uncertainty in passenger demand, which makes accurate prediction difficult.

[0003] At present, robust optimization and light robust methods have been proposed to address the problem of uncertain travel demand. The robust optimization method assumes that the uncertain demand belongs to a certain uncertainty set and seeks the optimal solution in the worst case within the uncertainty set. The light robust method achieves robustness by maximizing the satisfaction of demand under a certain degree of relaxation of the target value. Although these methods have advantages in computational efficiency, due to the lack of full use of the probability distribution information of passenger demand, overly conservative train operation plans may be obtained, resulting in a waste of transportation resources.

[0004] With the widespread availability of data, various techniques are used to estimate the probability distribution of demand, such as empirical distribution based on historical data or parameter learning of probability distribution. In this regard, stochastic programming methods have been applied to the operation scheduling problem, which can optimize the objective by minimizing the expected cost or by minimizing the cost of satisfying a specific quantile of demand. Considering the error between the estimated probability distribution function and the true probability distribution function, the distributionally robust (DR) optimization method is proposed to further enhance the robustness of the model. The distributionally robust method aims to find the worst distribution in a set containing all possible true distributions and minimize the loss under this worst distribution. However, the existing optimization methods based on probability distribution have the problem of computational efficiency.

[0005] Therefore, how to quickly and accurately compile a train operation plan that meets the travel needs of passengers is a technical problem that needs to be solved urgently. Summary of the invention

[0006] In view of the above problems, an embodiment of the present application provides a method and device for compiling a train operation plan based on a distributed robust chance constraint model, so as to overcome the above problems or at least partially solve the above problems.

[0007] In a first aspect of an embodiment of the present application, a method for compiling a train operation plan based on a distributed robust opportunity constraint model is disclosed, the method comprising:

[0008] Taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust chance constraint model for the preparation of train operation plans is constructed.

[0009] By linearization, the distributed robust chance constraint model is converted into a mixed integer linear programming model;

[0010] According to the passenger demand sample under the worst distribution, the optimal value under the deterministic problem programming is calculated, and an initial feasible solution is obtained according to the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model;

[0011] The mixed integer linear programming model is solved according to the initial feasible solution to obtain a train operation plan.

[0012] Optionally, the method further comprises:

[0013] Constructing an effective inequality, wherein the effective inequality is used to narrow the range of the feasible domain of the mixed integer linear programming model;

[0014] According to the initial feasible solution, the mixed integer linear programming model is solved to obtain a train operation plan, including:

[0015] The effective inequality is used as a constraint, and the mixed integer linear programming model is solved according to the initial feasible solution to obtain a train operation plan.

[0016] Optionally, the effective inequality includes at least one of the following:

[0017] A first effective inequality, wherein the first effective inequality is used to narrow the feasible domain of the train operation plan in the mixed integer linear programming model;

[0018] The second effective inequality is used to narrow the feasible domain of the passenger demand satisfaction decision variable in the mixed integer linear programming model, and the passenger demand satisfaction decision variable is used to characterize whether the passenger demand under the passenger demand sample can be satisfied by the train operation plan.

[0019] Optionally, taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust opportunity constraint model for the preparation of train operation plans is constructed, including:

[0020] Constructing an objective function, wherein the objective function aims to minimize the operating cost;

[0021] A distributed robust chance constraint condition is constructed, wherein the distributed robust chance constraint condition is used to constrain the train operation plan to meet the passenger demand under the worst distribution with a given probability.

[0022] Optionally, construct an objective function, including:

[0023] constructing a first cost according to the number of trains in the direct process and the cost of the trains passing through the direct process;

[0024] constructing a second cost based on the cost of departing from the station and the number of trains departing from the station, wherein the number of trains departing from the station is determined by the non-negative part of the difference between the number of trains departing from the station and the number of trains arriving at the station;

[0025] constructing a third cost according to the cost of terminating at the station and the number of trains terminating at the station, wherein the number of trains terminating at the station is determined by the non-negative part of the difference between the number of trains arriving at the station and the number of trains departing from the station;

[0026] An objective function is obtained according to the first cost, the second cost and the third cost.

[0027] Optionally, construct distribution robustness chance constraints, including:

[0028] Construct deterministic problem constraints, and construct the demand probability distribution that passenger demand obeys;

[0029] According to the deterministic problem constraints, determining a set of train operation plans that can satisfy passenger flow;

[0030] According to the set of passenger flows, constructing opportunity constraints that satisfy the demand probability distribution;

[0031] The chance constraint condition under the worst distribution in the demand probability distribution is used as the distributed robust chance constraint condition.

[0032] Optionally, construct deterministic problem constraints, including:

[0033] Constructing a first constraint condition, wherein the first constraint condition is used to constrain the number of passengers in the direct process to be no greater than the train capacity in the direct process, wherein the train capacity in the direct process is determined according to the number of trains passing through the direct process and the capacity of each train;

[0034] A second constraint condition is constructed, where the second constraint condition is used to constrain the number of incoming passengers at an intermediate station of a passenger travel demand to be equal to the number of outgoing passengers, where the passenger travel demand includes a starting station and a terminal station.

[0035] Optionally, according to the passenger demand sample under the worst distribution, calculating the optimal value under the deterministic problem planning, and obtaining an initial feasible solution according to the optimal value, including:

[0036] Constructing a deterministic model corresponding to the deterministic problem planning, wherein the deterministic model is used to characterize minimizing the operating cost under deterministic passenger demand;

[0037] The deterministic model is solved according to a plurality of passenger demand samples under the worst distribution to obtain a plurality of optimal values.

[0038] Optionally, obtaining an initial feasible solution according to the optimal value includes:

[0039] Determine the passenger demand sample under the worst distribution corresponding to the optimal value greater than the cost threshold among the multiple optimal values ​​as the first passenger demand sample that cannot be satisfied by the train operation plan;

[0040] Determine the passenger demand sample under the worst distribution corresponding to the optimal value that is not greater than the cost threshold among the multiple optimal values ​​as a second passenger demand sample that can be satisfied by the train operation plan;

[0041] The value of the passenger demand satisfaction decision variable corresponding to the first passenger demand sample is set to not satisfied, and the value of the passenger demand satisfaction decision variable corresponding to the second passenger demand sample is set to satisfied;

[0042] An initial feasible solution is obtained according to the passenger demand satisfaction decision variable corresponding to each of the first passenger demand samples and the passenger demand satisfaction decision variable corresponding to each of the second passenger demand samples.

[0043] In a second aspect of the embodiment of the present application, a train operation plan preparation device based on a distributed robust opportunity constraint model is disclosed, the device comprising:

[0044] The first building block uses the number of trains used in the direct process as the decision variable and takes minimizing the operating cost as the goal to build a distributed robust opportunity constraint model for the preparation of train operation plans;

[0045] A first conversion module is used to convert the distributed robust chance constraint model into a mixed integer linear programming model by linearization;

[0046] A first calculation module is used to calculate an optimal value under deterministic problem programming according to the passenger demand sample under the worst distribution, and obtain an initial feasible solution according to the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model;

[0047] The first solving module is used to solve the mixed integer linear programming model according to the initial feasible solution to obtain a train operation plan.

[0048] The embodiments of the present application include the following advantages:

[0049] In an embodiment of the present application, a distributed robust chance constraint model for the preparation of a train operation plan is constructed with the number of trains in a direct process as a decision variable and minimizing the operating cost as the goal; the distributed robust chance constraint model is converted into a mixed integer linear programming model by linearization; based on the passenger demand sample under the worst distribution, the optimal value under the deterministic problem planning is calculated, and an initial feasible solution is obtained based on the optimal value, and the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model; based on the initial feasible solution, the mixed integer linear programming model is solved to obtain a train operation plan.

[0050] This method aims at the problem of preparing train operation plans under passenger demand fluctuations, and proposes a distributed robust chance constraint model. The distributed robust chance constraint model can meet all passenger demands with a given probability when passenger demand cannot be accurately estimated; in order to be able to solve it better, the distributed robust chance constraint model is converted into a mixed integer linear programming model, so that the train operation plan can be obtained by solving the mixed integer linear programming model; and by using the passenger demand sample under the worst distribution, an initial feasible solution is introduced, and when solving the mixed integer linear programming model, the search can be directly started from the initial feasible solution, reducing the search range of the feasible domain, so that the optimal solution can be found more quickly, that is, the train operation plan is obtained. In some embodiments, by adding effective inequalities, the solution of the mixed integer linear programming model is further accelerated. In this way, a train operation plan that meets passenger demand can be quickly and accurately prepared. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments of the present application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0052] Figure 1 It is a flowchart of the steps of a method for compiling a train operation plan based on a distributed robust opportunity constraint model provided in an embodiment of the present application;

[0053] Figure 2 It is a graph and network representation of a train operation plan compilation problem provided by an embodiment of the present application;

[0054] Figure 3 It is a performance result comparison chart of different train operation plan compilation methods provided in the embodiment of the present application;

[0055] Figure 4 It is a structural schematic diagram of a train operation plan preparation device based on a distributed robust chance constraint model provided in an embodiment of the present application. DETAILED DESCRIPTION

[0056] In order to make the above-mentioned purposes, features and advantages of the present application more obvious and understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0057] In order to quickly and accurately compile a train operation plan that meets the travel needs of passengers, an embodiment of the present application provides a method for compiling a train operation plan based on a distributed robust chance constraint model. The method considers the problem of compiling a robust train operation plan on a passenger line, and assumes that the capacity of the trains is the same. The passenger travel demand is regarded as a random vector, and the starting station, terminal station, stop station, and number of departures of the train are determined, so that the formulated operation plan can meet the travel needs of all passengers on the line with a given probability. The method obtains the train operation plan based on the distributed robust chance constraint model; in order to be able to better solve, the distributed robust chance constraint model is converted into a mixed integer linear programming model, so that the train operation plan can be obtained by solving the mixed integer linear programming model; and, by using the passenger demand sample under the worst distribution, the initial feasible solution is introduced, and when solving the mixed integer linear programming model, the search can be directly based on the initial feasible solution, which reduces the search range of the feasible domain, so that the optimal solution can be found more quickly, that is, the train operation plan is obtained. In this way, a fast and accurate compilation of a train operation plan that meets the needs of passengers is achieved.

[0058] The following is a detailed description of the train operation plan preparation method based on the distributed robust opportunity constraint model provided in the embodiment of the present application in conjunction with the accompanying drawings.

[0059] Reference Figure 1 As shown, Figure 1 1 is a flowchart of the steps of a method for compiling a train operation plan based on a distributed robust opportunity constraint model provided by an embodiment of the present application. Figure 1 As shown, the method for compiling a train operation plan based on a distributed robust opportunity constraint model may include steps S110 to S140:

[0060] Step S110: Taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust opportunity constraint model for the preparation of train operation plans is constructed.

[0061] In the embodiment of the present application, the problem of compiling a single-day operation plan for a single direction (upward or downward) on a passenger line is targeted. The variables to be decided in this problem are the line and frequency; wherein, the line decision includes selecting the starting station, the stop station, and the terminal station of the train, and the frequency decision is to determine the number of trains running on each line. In the embodiment of the present application, a line is decomposed into multiple direct processes. For example, if the stop strategy of a certain line is site 2-site 5-site 6, it can be decomposed into the direct process site 2-site 5, and the splicing of site 5-site 6. If all lines are decomposed, the original line and frequency decision variables can be changed to the number of trains for each direct process, that is, the number of trains for the direct process is used as the decision variable. After obtaining the appropriate number of trains for the direct process, the direct process is spliced ​​to obtain the original line and frequency decision.

[0062] Taking the number of trains in the direct process as the decision variable, the train operation plan compilation problem can be regarded as a directed graph network The edge capacity design problem of Figure 2 As shown, V represents the set of nodes and ε represents the set of directed edges. Each node (for example, station 0) v∈v in the graph represents each station on the passenger line. The directed edge from A to B represents the direct section from station A to B without stopping at any station; if there is no edge connection between two stations, it means that direct access between the two stations is not allowed (must stop at other stations). Any directed path in the graph (for example, station 1-station 3-station 4) can be used to represent a route (that is, starting from station 1, stopping at station 3, and ending at station 4). The decision variable of the feasible solution compilation problem is the capacity of each edge in the directed graph network. For example, if the capacity of an edge is 3, it means that there is a direct process on the line with 3 trains. Therefore, the decision variable of the distributed robust opportunity constraint model is the number of trains in the direct process, that is, the decision variable is the capacity x of each edge e. e , e∈ε, and requires x e A non-negative integer.

[0063] In an embodiment of the present application, a distributed robust chance constraint model is proposed to solve the problem of preparing train operation plans under fluctuating passenger demand. The distributed robust chance constraint model aims to minimize operating costs. Based on the distributed robust chance constraint model, all passenger demands can be met with a given probability while minimizing train operating costs when passenger demand cannot be accurately estimated.

[0064] In an optional embodiment, taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust opportunity constraint model for the preparation of train operation plans is constructed, including steps A1 and A2:

[0065] Step A1: construct an objective function, wherein the objective function aims to minimize the operating cost.

[0066] In the embodiment of the present application, it is assumed that the physical properties of each train are the same, and its operating cost is only related to the line. The cost of running a certain line l can be decomposed into fixed cost and variable cost, wherein the fixed cost is related to the starting station s and the terminal station t selected by the line, and the variable cost depends on which direct sections the line consists of, that is, the operating cost cost on a line l l It can be expressed as:

[0067]

[0068] in, represents the cost of starting at station s on line l, represents the cost of terminating at station t on line l, cost e Represents the cost of the path passing through edge e.

[0069] In the case of minimizing cost as the goal, if the capacity x of each edge (i.e., each direct process) e It is known that when the edges are spliced ​​into paths (direct segments are spliced ​​into lines), the fixed cost should be reduced as much as possible, that is, the number of lines opened should be reduced as much as possible, so as to obtain the objective function based on the spliced ​​path.

[0070] Specifically, constructing an objective function includes: constructing a first cost according to the number of trains in the direct process and the cost of the trains passing through the direct process; constructing a second cost according to the cost of starting from a station and the number of trains starting from the station, the number of trains starting from the station is determined by the non-negative part of the difference between the number of trains departing from the station and the number of trains arriving at the station; constructing a third cost according to the cost of terminating at the station and the number of trains terminating at the station, the number of trains terminating at the station is determined by the non-negative part of the difference between the number of trains arriving at the station and the number of trains departing from the station; and obtaining an objective function according to the first cost, the second cost and the third cost.

[0071] For example, for a certain station s, the number of trains starting from this station should be equal to the number of trains departing from this station (the capacity of the edge starting from s) minus the number of trains arriving at this station (the capacity of the edge ending at s). Similarly, the number of trains ending at a certain station t should be equal to the number of trains arriving at this station minus the number of trains triggered from this station.

[0072] For example, the objective function f(x) is expressed as:

[0073]

[0074] Among them, ε represents the set of all direct processes; V represents the set of stations on the route; ε + (v) represents the set of all edges leaving node v; ε - (v) represents the set of all edges pointing to v; function (a) + It means taking the value of the non-negative part of a, that is, max(a,0); represents the cost of originating at site v; represents the cost of terminating at site v; cost e Represents the cost of the path passing through edge e; the first item in the objective function f(x) is the first cost, that is, the variable cost; the second item in the objective function f(x) is the second cost, that is, the cost starting from each site; the third item in the objective function f(x) is the third cost, that is, the cost at each site.

[0075] Step A2: construct a distributional robustness chance constraint condition, which is used to constrain the train operation plan to meet the passenger demand under the worst distribution with a given probability.

[0076] In the embodiment of the present application, the constraint of the distributed robust opportunity constraint model is mainly to require that the train operation plan can meet the travel needs of all passengers. When solving the problem of formulating the operation plan, the embodiment of the present application does not consider the passenger transfer problem (transfer cost), because transfer is related to time, so the transfer problem is more suitable for consideration in the subsequent timetable decision problem.

[0077] The travel demand of passengers is characterized by their origin and destination (OD pair is used to represent the travel demand of passengers). Different origins or destinations have different corresponding passenger demands, so the triple (s k ,t k ,d k ) to represent the departure / starting station of the OD pair with index k (s k ), destination / key station (t k ), and passenger demand / number of passengers (d k ); where k belongs to the set (Contains the set of all OD pairs). If OD pair k is regarded as commodity k, it can be modeled as a classic graph and network problem, namely, the multi-commodity flow problem. It can be seen as a commodity k with d k The flow of traffic into s k, the commodity flows through the graph and chooses a path to flow to t k , then from t k Outflow k .

[0078] Since the probability distribution of passenger demand cannot be accurately estimated, in order to better meet the needs of passengers, the embodiment of the present application uses the train operation plan to meet the passenger demand under the worst distribution as a distributed robust chance constraint. In this way, the robust chance constraint model based on the distributed robust chance constraint can still meet all passenger demands with a given probability when the passenger demand cannot be accurately estimated.

[0079] In an optional embodiment, constructing the distribution blue stick chance constraint condition includes steps A2-1 to A2-4:

[0080] Step A2-1: Construct the deterministic problem constraints and construct the demand probability distribution that the passenger demand obeys.

[0081] In the embodiment of the present application, when the passenger demands d k When the train operation planner is certain (i.e., assuming that the train operation planner can fully predict the passenger demand on the day of train operation), the deterministic problem constraints are constructed.

[0082] Specifically, construct deterministic problem constraints, including:

[0083] Constructing a first constraint condition, wherein the first constraint condition is used to constrain the number of passengers in the direct process to be no greater than the train capacity in the direct process, wherein the train capacity in the direct process is determined according to the number of trains passing through the direct process and the capacity of each train;

[0084] A second constraint condition is constructed, where the second constraint condition is used to constrain the number of incoming passengers at an intermediate station of a passenger travel demand to be equal to the number of outgoing passengers, where the passenger travel demand includes a starting station and a terminal station.

[0085] For example, the first constraint (1-1) and the second constraint (1-2) are expressed as:

[0086]

[0087] in, is the introduced decision variable, i.e., the effect of OD on k The number of passengers is arranged on the train with direct process e, that is, represents the number of passengers of OD pair k who take the train with direct process e; Cap represents the upper limit (capacity) of each train; y represents all decision variables A collection of ; x represents the total number of trains on each direct route, that is, the train operation plan.

[0088] The first constraint (1-1) indicates that the number of passengers in the direct process is not greater than the capacity of the train in the direct process, that is, the flow through the direct process e cannot exceed the upper limit of the capacity of the direct process e, that is, the number of passengers assigned to the train containing the direct process e must not exceed the number of trains containing the direct process e multiplied by the capacity of a single train. The second constraint (1-2) is the flow balance constraint, which means that the number of inflow passengers at the intermediate station of the passenger travel demand is equal to the number of outflow passengers, that is, the inflow of commodity k at the intermediate node is equal to the outflow, and at the departure node s k The net inflow is d k , when arriving at node t k The net outflow is d k .

[0089] In practical applications, due to passenger demand d k cannot be accurately predicted, so we construct a demand probability distribution that passenger demand follows. Specifically, consider the demand d k It obeys a probability distribution F, which belongs to a distribution set D(θ), where D(θ) represents an estimated distribution The set of all probability distributions whose distance does not exceed θ, the passenger demand obeys the demand probability distribution expressed as:

[0090]

[0091] in, It is supported on N points The discrete distribution of d takes the probability of each point as {p 1 ,…,p N}, Each point represents a sample of passenger demand.

[0092] Probability distribution F and estimated distribution The distance between The ∞-Wasserstein distance is used, which is defined as:

[0093]

[0094] Among them, Π-ess.sup‖ξ 1 -ξ 2 ‖ 1 It means ‖ξ 1 -ξ 2 ‖ 1 The supremum of .

[0095] Step A2-2: According to the deterministic problem constraints, determine the set of train operation plans that can satisfy the passenger flow.

[0096] In the embodiment of the present application, for a given train operation plan x, S(x) is used to represent the set of train operation plans that can satisfy the passenger flow, that is:

[0097]

[0098] That is to say, the set of train operation plans x that can satisfy the passenger flow d is determined under the condition of satisfying the above-mentioned first constraint condition (1-1) and the second constraint condition (1-2).

[0099] Step A2-3: Based on the set of passenger flows, construct opportunity constraints that satisfy the demand probability distribution.

[0100] In the embodiment of the present application, the opportunity constraint of the probability distribution requires that the train operation plan can still meet the passenger travel demand with a given probability 1-∈ under the fluctuating passenger flow, that is:

[0101]

[0102] in, Represents the probability function of the distribution, ∈ represents a number between 0 and 1.

[0103] Step A2-4: taking the chance constraint condition under the worst distribution in the demand probability distribution as the distributed robust chance constraint condition.

[0104] In the embodiment of the present application, since the probability distribution of passenger demand cannot be accurately estimated, a distributed robust opportunity constraint model is adopted, which requires that the opportunity constraint condition of the demand probability distribution can still be satisfied when the passenger demand obeys the worst distribution in the demand probability distribution D(θ), that is:

[0105]

[0106] in, Represents the worst distribution function under the demand probability distribution D(θ).

[0107] Finally, the distributed robust opportunity constraint model for train operation plan compilation can be expressed as:

[0108]

[0109] Among them, (1-4) represents the objective function, (1-5) and (1-6) represent the distribution of robust chance constraints.

[0110] Step S120: converting the distributed robust chance constraint model into a mixed integer linear programming model by linearization.

[0111] In an embodiment of the present application, in order to make the proposed distributionally robust chance constraint model (1-4)-(1-6) solvable by a general solver, the distributionally robust chance constraint model is converted into an equivalent mixed integer linear programming model (MIP) through linearization.

[0112] For example, the mixed integer linear programming model is expressed as:

[0113]

[0114]

[0115] Among them, u s and u t is an auxiliary decision variable introduced to linearize the objective function f(x), and the 0-1 decision variable z n (i.e., passenger demand satisfaction decision variable) is used to indicate whether the passenger demand sample n can be satisfied by the train operation plan x, z n =1 means it cannot be satisfied, z n =0 means satisfied; The worst distribution in is actually N points by The probability distribution of z n =1 means Cannot be satisfied by x.

[0116] Step S130: Calculate the optimal value under deterministic problem planning based on the passenger demand sample under the worst distribution, and obtain an initial feasible solution based on the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model.

[0117] In the embodiment of the present application, for solving the mixed integer linear programming model, the solver usually adopts the branch and bound method to solve. In order to achieve a fast solution, the upper bound of the feasible domain of the mixed integer linear programming model is obtained according to the passenger demand sample under the worst distribution, so that the solver can prune the search tree according to the upper bound of the feasible domain, reduce the search range, and thus speed up the solution.

[0118] Specifically, according to multiple passenger demand samples under the worst distribution, the optimal value of the deterministic problem planning corresponding to each sample is calculated respectively, which is equivalent to converting the uncertain planning problem into multiple deterministic planning problems for solution. Therefore, a set of optimal values ​​can be quickly obtained by solving multiple deterministic planning problems. Therefore, according to the optimal value, the approximate optimal initial feasible solution is determined. Among them, the initial feasible solution refers to the initial value of the decision variable z that the passenger demand satisfies. In this way, when solving the mixed integer linear programming model later, the upper bound of the feasible domain of the mixed integer linear programming model given by the initial feasible solution can be used to start the calculation, thereby accelerating the solution.

[0119] In an optional embodiment, according to the passenger demand sample under the worst distribution, the optimal value under the deterministic problem planning is calculated, and an initial feasible solution is obtained according to the optimal value, including steps B1 to B2:

[0120] Step B1: construct a deterministic model corresponding to the deterministic problem planning, wherein the deterministic model is used to characterize minimizing the operating cost under deterministic passenger demand.

[0121] Step B2: Solving the deterministic model according to multiple passenger demand samples under the worst distribution to obtain multiple optimal values.

[0122] Specifically, in deterministic problem planning, passenger demand is certain, and the deterministic problem constraints are used as constraints of the deterministic model, that is, the above-mentioned first constraint (1-1) and the second constraint (1-2) are used as constraints of the deterministic model; the optimization goal of the deterministic model is still to minimize the operating cost, so the above-mentioned objective function f(x) is used as the objective function of the deterministic model.

[0123] For example, the deterministic model is represented as:

[0124]

[0125] st(1-1),(1-2)

[0126]

[0127] For each passenger demand sample d under the worst distribution k ,make Solve the above deterministic models respectively and get the optimal value OPT n , where the optimal value represents the operating cost of the train operation plan under the passenger demand sample under the worst distribution.

[0128] Further, an initial feasible solution is obtained according to the optimal value, including steps C1 to C4:

[0129] Step C1: Determine the passenger demand sample under the worst distribution corresponding to the optimal value greater than the cost threshold among the multiple optimal values ​​as the first passenger demand sample that cannot be satisfied by the train operation plan.

[0130] Step C2: Determine the passenger demand sample under the worst distribution corresponding to the optimal value that is not greater than the cost threshold among the multiple optimal values ​​as the second passenger demand sample that can be satisfied by the train operation plan.

[0131] Step C3: setting the value of the passenger demand satisfaction decision variable corresponding to the first passenger demand sample to not satisfied, and setting the value of the passenger demand satisfaction decision variable corresponding to the second passenger demand sample to satisfied.

[0132] Step C4: Obtain an initial feasible solution according to the passenger demand satisfaction decision variable corresponding to each of the first passenger demand samples and the passenger demand satisfaction decision variable corresponding to each of the second passenger demand samples.

[0133] In an embodiment of the present application, the optimal value represents the operating cost of the train operation plan under the passenger demand sample under the worst distribution. In order to achieve the goal of minimizing the operating cost, the optimal value and the cost threshold are compared, and the train operation plan with a lower operating cost is selected as the preliminary train operation plan, that is, a train operation plan that meets the opportunity constraints under the worst distribution is selected.

[0134] For multiple optimal values It can be sorted from large to small, and the corresponding index after sorting is Right now:

[0135]

[0136] Therefore, the optimal value greater than the cost threshold and the optimal value not greater than the cost threshold are selected according to the sorted optimal value, that is:

[0137] Take j max satisfy and

[0138] n≤j max The passenger demand sample under the worst distribution is determined as the first passenger demand sample that cannot be satisfied by the train operation plan, n>j max The passenger demand sample under the worst distribution is determined as the second passenger demand sample that can be satisfied by the train operation plan. The passenger demand satisfaction decision variable is a 0-1 decision variable, and the value of the passenger demand satisfaction decision variable corresponding to the first passenger demand sample is set to not satisfied, that is, the passenger demand satisfaction decision variable The value of the passenger demand satisfaction decision variable corresponding to the second passenger demand sample is set to satisfied, that is, the passenger demand satisfaction decision variable

[0139] Finally, the passenger demand satisfaction decision variable corresponding to each first passenger demand sample and the passenger demand satisfaction decision variable corresponding to each second passenger demand sample are taken as initial feasible solutions.

[0140] Step S140: Solve the mixed integer linear programming model according to the initial feasible solution to obtain a train operation plan.

[0141] In an embodiment of the present application, when solving a mixed integer linear programming model, the initial feasible solution is used as the initial value of the passenger demand satisfaction decision variable of the mixed integer linear programming model, so that the solver can prune the search tree according to the initial feasible solution, reduce the search range, and greatly improve the efficiency of the solution.

[0142] Through the above implementation process, a distributed robust chance constraint model is proposed for the problem of preparing train operation plans under passenger demand fluctuations. The distributed robust chance constraint model can meet all passenger demands with a given probability when passenger demand cannot be accurately estimated; in order to better solve, the distributed robust chance constraint model is converted into a mixed integer linear programming model, so that the train operation plan can be obtained by solving the mixed integer linear programming model; and by using the passenger demand sample under the worst distribution, the initial feasible solution is introduced. When solving the mixed integer linear programming model, the search can be directly started from the initial feasible solution to reduce the search range of the feasible domain, so that the optimal solution can be found more quickly, that is, the train operation plan is obtained. In this way, a train operation plan that meets passenger demand can be quickly and accurately prepared.

[0143] In an optional embodiment, in order to further accelerate the solution of the mixed integer linear programming model, the method further includes the following steps:

[0144] Step S150: constructing a valid inequality, wherein the valid inequality is used to narrow the range of the feasible domain of the mixed integer linear programming model.

[0145] Step S160: using the effective inequality as a constraint, solving the mixed integer linear programming model according to the initial feasible solution, and obtaining a train operation plan.

[0146] In the embodiment of the present application, considering that in the mixed integer programming problem, the effective inequality can make the relaxed feasible domain closer to the convex hull of the original feasible domain by reducing the size of the feasible domain after the integer variables are relaxed, thereby reducing the time required to solve the problem. The embodiment of the present application constructs an effective inequality for the converted mixed integer linear programming model to narrow the scope of the feasible domain of the mixed integer linear programming model, thereby using the effective inequality as a constraint to accelerate the solution of the mixed integer linear programming model.

[0147] Specifically, for each edge (i.e., direct process) e∈ε, let w e is any non-negative integer assigned to the edge; let l k (w) indicates from site s k To site k The shortest path length, where the length of each edge e is w e , so define h n (w) is:

[0148]

[0149] In descending order Sorting, the subscript after sorting is τ, that is:

[0150]

[0151] Use i max (w) means satisfied and An integer.

[0152] Therefore, according to the above positioning h n (w), construct a valid inequality.

[0153] Specifically, the effective inequality includes at least one of the following:

[0154] Item D-1: a first valid inequality, which is used to narrow the feasible domain of the train operation plan in the mixed integer linear programming model;

[0155] Item D-2: The second effective inequality, which is used to narrow the feasible domain of the passenger demand satisfaction decision variable in the mixed integer linear programming model, and the passenger demand satisfaction decision variable is used to characterize whether the passenger demand under the passenger demand sample can be met by the train operation plan.

[0156] In the embodiment of the present application, the first valid inequality is a valid inequality of the transformed mixed integer linear programming model, that is, it will not change the feasible domain. It is added to the mixed integer linear programming model as a constraint, thereby narrowing the feasible domain of the train operation plan in the mixed integer linear programming model without changing the optimal solution.

[0157] For example, the first valid inequality is expressed as:

[0158]

[0159] i=1,…,i max (w)

[0160] Through the first effective inequality, the above constraint (2-2) can be approximated So that x can be cut off e Relaxation to continuous variables The value of is adjusted to reduce the feasible domain after relaxation, so that the feasible domain of the relaxed train operation plan is close to the convex hull of the original integer programming problem, achieving accelerated solution.

[0161] The second effective inequality is used to narrow the feasible region of the passenger demand satisfaction decision variables in the mixed integer linear programming model. For example, let Satisfy h γ(i) (w)≥h γ(i+1) (w) for i = 1, ..., l; where

[0162] The second effective inequality can be expressed as:

[0163]

[0164] The second effective inequality is obtained based on the first effective inequality, and can further cut off the feasible domain after the integer variable z (passenger demand satisfaction decision variable) is relaxed, thereby achieving an acceleration effect.

[0165] When solving a mixed integer linear programming model, the first valid inequality and the second valid inequality can be selectively added as constraints to the mixed integer linear programming model to obtain a new optimization problem. The optimal solution of the new optimization problem is consistent with the optimal solution of the original mixed integer linear programming model, but the solution speed will be faster.

[0166] In an embodiment of the present application, the distributed robust chance constraint model can satisfy all passenger demands with a given probability even when passenger demands cannot be accurately estimated; in order to be able to solve better, the distributed robust chance constraint model is converted into a mixed integer linear programming model, so that the train operation plan can be obtained by solving the mixed integer linear programming model; and, by using the passenger demand sample under the worst distribution, introducing the initial feasible solution, and by adding valid inequalities, when solving the mixed integer linear programming model, the search can be directly started from the initial feasible solution, reducing the search range of the feasible domain, so that the optimal solution can be found more quickly, that is, the train operation plan is obtained. In this way, a train operation plan that meets passenger needs can be quickly and accurately compiled.

[0167] Furthermore, in order to illustrate the performance of the train operation plan preparation method based on the distributed robust opportunity constraint model provided in the embodiment of the present application, the Wuhan-Guangzhou high-speed railway passenger line with 17 stations is taken as an example to verify the robustness of the train operation plan generated based on the distributed robust opportunity constraint model under passenger demand fluctuations, as well as the effectiveness of the two accelerated solution methods proposed in the embodiment of the present application.

[0168] For example, Figure 3 is a performance comparison chart of different train operation plan compilation methods provided in the embodiment of the present application, Figure 3 The robustness of the distributed robust chance constraint model (DRCC) is shown under different probability distributions of passenger demand (i.e., empirical distribution, normal distribution, and shifted normal distribution). The horizontal axis represents the operating cost of the train operation plan (related to the number of trains operated, total operating time, and mileage), and the vertical axis represents the probability that the corresponding operation plan cannot meet all passenger demands.

[0169] Generally speaking, as the number of trains running increases, operating costs will rise, capacity will increase, and the probability of passenger demand not being met will decrease. Therefore, there is a trade-off between operating costs and the probability of meeting passenger demand. Figure 3 It can be seen that compared with the classic robust optimization method (RO), the train operation plan generated by the distributed robust chance constraint model (DRCCθ>0) in the embodiment of the present application can meet the travel needs of passengers at a lower cost. Figure 3 The results under the rightmost shifted normal distribution show that, compared with the general chance constraint model (θ = 0), the distributed robust chance constraint model is still robust when the test data distribution deviates from the training data distribution, that is, as the cost increases, the probability of unmet passenger demand decreases steadily.

[0170] Table 1 shows the solution time (Time, unit: seconds) of the mixed integer linear programming model (MIP) problem (Origin) when the data weights are empirical distribution (Empirical distribution) and approximate normal distribution (Normal distribution), and the solution based on the initial feasible solution in the embodiment of the present application, that is, the hot start method (WS), and further using the first effective inequality (WS-VI) and the second effective inequality (WS-SVI), and the solution time is limited to the optimization gap (Gap, percentage) within 1 hour.

[0171] The results show that compared with directly solving the MIP problem, the hot start method can quickly find a feasible solution, thereby making the final optimization gap smaller, especially when the problem scale is relatively large; further use of effective inequalities can make the problem that originally could not be solved within 1 hour get the optimal solution within a few minutes, greatly improving the solution efficiency.

[0172] Table 1 Comparison results of solution time

[0173]

[0174] The embodiment of the present application also provides a train operation plan preparation device based on a distributed robust opportunity constraint model, referring to Figure 4 As shown, Figure 4 : is a structural schematic diagram of a train operation plan preparation device based on a distributed robust opportunity constraint model provided in an embodiment of the present application, the device comprising:

[0175] The first construction module 410 is used to construct a distributed robust opportunity constraint model for the preparation of train operation plans, taking the number of trains in the direct process as a decision variable and minimizing the operating cost as the goal;

[0176] A first conversion module 420, configured to convert the distributed robust chance constraint model into a mixed integer linear programming model by linearization;

[0177] A first calculation module 430 is used to calculate an optimal value under deterministic problem programming according to the passenger demand sample under the worst distribution, and obtain an initial feasible solution according to the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model;

[0178] The first solving module 440 is used to solve the mixed integer linear programming model according to the initial feasible solution to obtain a train operation plan.

[0179] In an optional embodiment, the device further includes:

[0180] A second building module is used to build a valid inequality, wherein the valid inequality is used to narrow the range of the feasible domain of the mixed integer linear programming model;

[0181] The second solving module is used to use the effective inequality as a constraint, solve the mixed integer linear programming model according to the initial feasible solution, and obtain a train operation plan.

[0182] In an optional embodiment, the effective inequality includes at least one of the following:

[0183] A first effective inequality, wherein the first effective inequality is used to narrow the feasible domain of the train operation plan in the mixed integer linear programming model;

[0184] The second effective inequality is used to narrow the feasible domain of the passenger demand satisfaction decision variable in the mixed integer linear programming model, and the passenger demand satisfaction decision variable is used to characterize whether the passenger demand under the passenger demand sample can be satisfied by the train operation plan.

[0185] In an optional embodiment, the first building block includes:

[0186] A function building module, used for building an objective function, wherein the objective function aims at minimizing the operating cost;

[0187] The constraint construction module is used to construct the distributed robust chance constraint condition, and the distributed robust chance constraint condition is used to constrain the train operation plan to meet the passenger demand under the worst distribution with a given probability.

[0188] In an optional embodiment, the function building module includes:

[0189] A first construction submodule, configured to construct a first cost according to the number of trains in the direct process and the cost of the trains passing through the direct process;

[0190] A second construction submodule is used to construct a second cost according to the cost of starting at the station and the number of trains starting from the station, wherein the number of trains starting from the station is determined according to the non-negative part of the difference between the number of trains departing from the station and the number of trains arriving at the station;

[0191] A third construction submodule is used to construct a third cost according to the cost of terminating at the station and the number of trains terminating at the station, wherein the number of trains terminating at the station is determined according to the non-negative part of the difference between the number of trains arriving at the station and the number of trains departing from the station;

[0192] The objective function module is used to obtain an objective function according to the first cost, the second cost and the third cost.

[0193] In an optional embodiment, the constraint building module includes:

[0194] The fourth construction submodule is used to construct the deterministic problem constraints and to construct the demand probability distribution that the passenger demand obeys;

[0195] A first determination module is used to determine a set of train operation plans that can satisfy passenger flow according to the deterministic problem constraints;

[0196] A fifth construction submodule, configured to construct, according to the set of passenger flows, an opportunity constraint condition satisfying the demand probability distribution;

[0197] The constraint condition module is used to use the opportunity constraint condition under the worst distribution in the demand probability distribution as the distributed robust opportunity constraint condition.

[0198] In an optional embodiment, the fourth construction submodule includes:

[0199] A first constraint construction submodule is used to construct a first constraint condition, wherein the first constraint condition is used to constrain the number of passengers in the direct process to be no greater than the train capacity in the direct process, and the train capacity in the direct process is determined according to the number of trains passing through the direct process and the capacity of each train;

[0200] The second constraint construction submodule is used to construct a second constraint condition, wherein the second constraint condition is used to constrain the number of incoming passengers at an intermediate station of passenger travel demand to be equal to the number of outgoing passengers, and the passenger travel demand includes a starting station and a terminal station.

[0201] In an optional embodiment, the first calculation module includes:

[0202] A third building module is used to build a deterministic model corresponding to the deterministic problem planning, wherein the deterministic model is used to characterize minimizing the operating cost under deterministic passenger demand;

[0203] The optimal value calculation module is used to solve the deterministic model according to multiple passenger demand samples under the worst distribution to obtain multiple optimal values.

[0204] In an optional embodiment, the third building block includes:

[0205] A second determination module is used to determine the passenger demand sample under the worst distribution corresponding to the optimal value greater than the cost threshold among the multiple optimal values ​​as a first passenger demand sample that cannot be satisfied by the train operation plan;

[0206] A third determination module is used to determine the passenger demand sample under the worst distribution corresponding to the optimal value that is not greater than the cost threshold among the multiple optimal values ​​as a second passenger demand sample that can be satisfied by the train operation plan;

[0207] A first setting module, configured to set the value of the passenger demand satisfaction decision variable corresponding to the first passenger demand sample to not satisfied, and set the value of the passenger demand satisfaction decision variable corresponding to the second passenger demand sample to satisfied;

[0208] The initial feasible solution module is used to obtain an initial feasible solution according to the passenger demand satisfaction decision variable corresponding to each of the first passenger demand samples and the passenger demand satisfaction decision variable corresponding to each of the second passenger demand samples.

[0209] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0210] The embodiments of the present application are described with reference to the flowcharts and / or block diagrams of the methods and devices according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0211] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0212] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0213] Although the preferred embodiments of the present application have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present application.

[0214] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or terminal device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or terminal device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or terminal device including the elements.

[0215] The above is a detailed introduction to a method and device for compiling a train operation plan based on a distributed robust opportunity constraint model provided by the present application. This article uses specific examples to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for general technical personnel in this field, according to the idea of ​​the present application, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A method for compiling a train operation plan based on a distributed robust opportunity constraint model, characterized in that: The method comprises: Taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust chance constraint model for the preparation of train operation plans is constructed. By linearization, the distributed robust chance constraint model is converted into a mixed integer linear programming model; According to the passenger demand sample under the worst distribution, the optimal value under the deterministic problem programming is calculated, and an initial feasible solution is obtained according to the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model; The mixed integer linear programming model is solved according to the initial feasible solution to obtain a train operation plan.

2. The method according to claim 1, characterized in that The method further comprises: Constructing an effective inequality, wherein the effective inequality is used to narrow the range of the feasible domain of the mixed integer linear programming model; According to the initial feasible solution, the mixed integer linear programming model is solved to obtain a train operation plan, including: The effective inequality is used as a constraint, and the mixed integer linear programming model is solved according to the initial feasible solution to obtain a train operation plan.

3. The method according to claim 2, characterized in that The valid inequality includes at least one of the following: A first effective inequality, wherein the first effective inequality is used to reduce the feasible domain of the train operation scheme in the mixed integer linear programming model; The second effective inequality is used to narrow the feasible domain of the passenger demand satisfaction decision variable in the mixed integer linear programming model, and the passenger demand satisfaction decision variable is used to characterize whether the passenger demand under the passenger demand sample can be satisfied by the train operation plan.

4. The method according to claim 1, characterized in that: Taking the number of trains in the direct process as the decision variable and minimizing the operating cost as the goal, a distributed robust opportunity constraint model for the preparation of train operation plans is constructed, including: Constructing an objective function, wherein the objective function aims to minimize the operating cost; A distributed robust chance constraint condition is constructed, wherein the distributed robust chance constraint condition is used to constrain the train operation plan to meet the passenger demand under the worst distribution with a given probability.

5. The method according to claim 4, characterized in that Construct the objective function, including: constructing a first cost according to the number of trains in the direct process and the cost of the trains passing through the direct process; constructing a second cost based on the cost of departing from the station and the number of trains departing from the station, wherein the number of trains departing from the station is determined by the non-negative part of the difference between the number of trains departing from the station and the number of trains arriving at the station; constructing a third cost according to the cost of terminating at the station and the number of trains terminating at the station, wherein the number of trains terminating at the station is determined by the non-negative part of the difference between the number of trains arriving at the station and the number of trains departing from the station; An objective function is obtained according to the first cost, the second cost and the third cost.

6. The method according to claim 4, characterized in that Construct the distributed robust opportunity constraints, including: Construct deterministic problem constraints, and construct the demand probability distribution that passenger demand obeys; According to the deterministic problem constraints, determining a set of train operation plans that can satisfy passenger flow; According to the set of passenger flows, constructing opportunity constraints that satisfy the demand probability distribution; The chance constraint condition under the worst distribution in the demand probability distribution is used as the distributed robust chance constraint condition.

7. The method according to claim 5, characterized in that Construct deterministic problem constraints, including: Constructing a first constraint condition, wherein the first constraint condition is used to constrain the number of passengers in the direct process to be no greater than the train capacity in the direct process, wherein the train capacity in the direct process is determined according to the number of trains passing through the direct process and the capacity of each train; A second constraint condition is constructed, where the second constraint condition is used to constrain the number of incoming passengers at an intermediate station of a passenger travel demand to be equal to the number of outgoing passengers, where the passenger travel demand includes a starting station and a terminal station.

8. The method according to claim 1, characterized in that According to the passenger demand sample under the worst distribution, the optimal value under the deterministic problem planning is calculated, and an initial feasible solution is obtained according to the optimal value, including: Constructing a deterministic model corresponding to the deterministic problem planning, wherein the deterministic model is used to characterize minimizing the operating cost under deterministic passenger demand; The deterministic model is solved according to a plurality of passenger demand samples under the worst distribution to obtain a plurality of optimal values.

9. The method according to claim 8, characterized in that An initial feasible solution is obtained according to the optimal value, including: Determine the passenger demand sample under the worst distribution corresponding to the optimal value greater than the cost threshold among the multiple optimal values ​​as the first passenger demand sample that cannot be satisfied by the train operation plan; Determine the passenger demand sample under the worst distribution corresponding to the optimal value that is not greater than the cost threshold among the multiple optimal values ​​as a second passenger demand sample that can be satisfied by the train operation plan; The value of the passenger demand satisfaction decision variable corresponding to the first passenger demand sample is set to not satisfied, and the value of the passenger demand satisfaction decision variable corresponding to the second passenger demand sample is set to satisfied; An initial feasible solution is obtained according to the passenger demand satisfaction decision variable corresponding to each of the first passenger demand samples and the passenger demand satisfaction decision variable corresponding to each of the second passenger demand samples.

10. A train operation plan preparation device based on a distributed robust opportunity constraint model, characterized in that: The device comprises: The first building block uses the number of trains used in the direct process as the decision variable and takes minimizing the operating cost as the goal to build a distributed robust opportunity constraint model for the preparation of train operation plans; A first conversion module is used to convert the distributed robust chance constraint model into a mixed integer linear programming model by linearization; A first calculation module is used to calculate an optimal value under deterministic problem programming according to the passenger demand sample under the worst distribution, and obtain an initial feasible solution according to the optimal value, wherein the initial feasible solution is used to characterize the upper bound of the feasible domain of the mixed integer linear programming model; The first solving module is used to solve the mixed integer linear programming model according to the initial feasible solution to obtain a train operation plan.

Citation Information

Patent Citations

  • Distributed photovoltaic limit grid-connected capacity evaluation method based on distributed robust optimization

    CN113076626A

  • Multi-stroke drop-and-pull connection transportation method considering elastic time

    CN115564627A

  • Two-stage regional integrated energy system distribution robust economic dispatching method

    CN115619143A

  • Steelmaking continuous casting scheduling method and device of distributed robust joint opportunity constraint model

    CN116088457A

  • Urban rail train operation adjustment and passenger flow control collaborative optimization method under operation interruption

    CN118095750A

Cited By

  • Railway line selection method considering active fault zone risk, medium and equipment

    CN119740342A