Method for calculating number of trains attached to lines of intelligent rail express system
By combining the deficit function model and mathematical planning model, considering the charging demand and turnback time of the intelligent rail train, the problem of difficulty in calculating the fleet size of the intelligent rail line is solved, and more accurate fleet size and charging task optimization is achieved, providing Intuitive analysis tool.
Patent Information
- Application Number
- CN202411155863.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-22
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2044-08-22
AI Technical Summary
Traditional methods are difficult to accurately calculate the changes in train turnover time in intelligent rail express systems, which makes it impossible to directly apply to the calculation of fleet size of intelligent rail lines.
The deficit function model and mathematical planning model are used, combined with the network flow integer planning model, considering the charging demand and turn-back preparation time of the train, and the dual-objective linear planning model and the deficit function graphical scheduling model are calculated to calculate the number of trains used in the minimized line and Number of charging tasks.
More accurately determine the fleet size of the intelligent rail line, optimize the number of trains and charge times, provide intuitive visual analysis tools, and help operation management choose reasonable fleet size solutions.
Smart Images

Figure CN118917102A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of intelligent rail transportation, and in particular to a method for calculating the number of trains assigned to a line of an intelligent rail express system. Background Art
[0002] In recent years, with the development of emerging technologies, a new mode of transportation—Autonomous Rail Rapid Transit (ART)—has been successfully developed and has begun operating in several cities around the world. This system utilizes virtual track technology, guiding and controlling ART vehicles through automated and virtual tracking, breaking the limitations of traditional rail. Another feature of ART is its flexible vehicle formations, providing variable passenger capacity to better meet passenger demand and reduce the number of empty seats. ART not only has lower construction and operating costs than traditional rail transit, but also offers a higher passenger capacity than buses. It combines the flexibility of buses with the efficiency of rail transit, while also having a lower construction cost than light rail. Furthermore, ART offers numerous economic, environmental, and social benefits, such as reduced traffic congestion, fewer parking requirements, lower greenhouse gas emissions, and the promotion of transit-oriented development. Therefore, it is a highly attractive option for urban public transportation.
[0003] During the initial operational planning phase of the smart rail system, transportation planners need to forecast passenger demand based on actual conditions. This allows them to design network routes, develop vehicle schedules, and determine the size of the associated fleet. Determining the size of the associated fleet is crucial. Vehicle acquisition costs are a major expense for operators, and the size of the associated fleet directly impacts the service quality of the smart rail system. An insufficiently sized fleet will lead to decreased operational efficiency, increased passenger wait times, and a decline in overall service quality. An oversized fleet will result in idle vehicles and unnecessary vehicle purchase costs, ultimately impacting the economic viability of the entire smart rail system. Therefore, determining the appropriate size of the associated fleet for each smart rail line is crucial.
[0004] The traditional calculation method is to divide the train's turnaround time by the train's departure interval to determine the number of operating vehicles required for a line. However, this method is limited in that it treats the train's turnaround time as a fixed value. However, in actual operation, the turnaround time of smart rail trains varies from one trip to the next due to the need for recharging. This makes the traditional calculation method difficult to directly apply to the calculation of the number of vehicles assigned to smart rail lines. Summary of the Invention
[0005] In response to the above-mentioned deficiencies in the prior art, the present invention provides a method for calculating the number of trains assigned to intelligent rail express systems. This method comprehensively considers constraints such as the charging requirements and turnaround preparation time of intelligent rail trains, and combines the deficit function model with the mathematical programming model to more accurately determine the size of the intelligent rail line assigned fleet.
[0006] In order to achieve the above-mentioned object of the invention, the technical solution adopted by the present invention is:
[0007] A method for calculating the number of trains assigned to a line of an intelligent rail express system comprises the following steps:
[0008] Generate train service information for the entire day's operation period based on the line operation period and train departure intervals of the intelligent rail express system, and calculate the minimum number of line-operated trains required to execute all service trips based on the train service trip data information;
[0009] A dual-objective linear programming model was constructed with the objective function of minimizing the number of trains in operation on the line and minimizing the number of train charging tasks. Based on the minimum number of trains in operation on the line, multiple feasible numbers of trains in operation and the corresponding total number of train charging tasks were calculated.
[0010] Use the deficit function graphical dispatch model to draw the deficit function image of each origin and destination station;
[0011] Based on multiple different feasible numbers of trains and the corresponding total number of train charging tasks, a two-dimensional Pareto solution set graph is drawn, and the number of trains to be used is determined by combining the deficit function graph;
[0012] According to the number of spare trains and trains under repair in the intelligent rail express system, the number of trains assigned to the intelligent rail express system line is calculated based on the determined number of operating trains.
[0013] Preferably, the minimum number of line-operated trains required to execute all service trips is calculated based on the train service trip data information, including the following steps:
[0014] Based on the train service data, a network flow integer programming model without considering charging is constructed;
[0015] Solve the network flow integer programming model without considering charging to obtain the maximum feasible number of train connections;
[0016] The minimum number of line-operated trains required to execute all service trips is calculated based on the maximum feasible number of train connections.
[0017] As a preferred method, the network flow integer programming model without considering charging is constructed as follows:
[0018]
[0019] The constraints are:
[0020] x j -(x i +t i +△t i +z ij )≥(x ij -1)*M1,i,j∈I
[0021]
[0022] Among them, Max is the maximum value function, C VS (I) is the number of feasible train connections, I is the set of train service trips, x ij is a 0-1 variable indicating whether train number i and train number j are executed by the same train, x j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, △t i is the turnaround preparation time for train number i, z ij is the judgment coefficient of whether train number i and train number j are located at the same station, M1 is a set positive parameter, and T is the length of the operating cycle.
[0023] As a preferred method, the minimum number of line-operated trains required to execute all service trips is calculated based on the maximum feasible train connection number as follows:
[0024] Min F VS (I)=|I|-MaxC VS (I)
[0025] Among them, Min is the minimum function, F VS (I) is the number of trains used on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, C VS (I) is the number of feasible train connections.
[0026] Preferably, a dual-objective linear programming model is constructed with the objective function of minimizing the number of trains in operation on the line and minimizing the number of train charging tasks. Based on the minimum number of trains in operation on the line, multiple different feasible numbers of trains in operation and corresponding numbers of train charging tasks are calculated, including the following steps:
[0027] Construct a dual-objective linear programming model with the objective function of minimizing the number of trains used on the line and minimizing the number of train charging tasks;
[0028] The objective function of minimizing the number of trains used on the line in the dual-objective linear programming model is converted into constraints, resulting in a single-objective linear programming model with the objective function of minimizing the number of train charging tasks.
[0029] Based on the minimum number of trains used on the line, the number of feasible train connections is gradually increased in steps of 1. The single-objective linear programming model with the objective function of minimizing the number of train charging tasks is solved, and multiple different feasible numbers of trains used and the corresponding numbers of train charging tasks are obtained.
[0030] As a preferred method, a dual-objective linear programming model is constructed with the objective function of minimizing the number of trains used on the line and minimizing the number of train charging tasks, specifically:
[0031]
[0032] The constraints are:
[0033]
[0034] Among them, Min is the minimum function, F VS (I) is the number of trains used on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, x ij is a 0-1 variable indicating whether train number i and train number j are executed by the same train, F BS The number of charging tasks for the train, y ij is a 0-1 variable indicating whether train number i is connected to train number j and whether the train is charging. j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, Δt i is the turnaround preparation time for train number i, z ij is the judgment coefficient of whether train number i and train number j are located at the same station, Q is the maximum battery capacity of the train, is the remaining power of the train after the train number i is executed, P is the rated charging power of the charging pile, M2 is a set positive integer, is the remaining power of the train before the train number i, qi is the power consumed by each trip of train number i, α is the safety power threshold coefficient of the train, is the remaining power of the train before the execution of train number j, u ij is the remaining power of the train from train number i to train number j, r ij is a 0-1 variable indicating whether the train number i is connected and has a charging task, and T is the duration of the operation cycle.
[0035] Preferably, the deficit function graphical scheduling model is used to draw the deficit function image of each originating and terminating station, including:
[0036] With time as the horizontal axis and the difference between the total number of departing trains and the total number of arriving trains at the originating and terminating stations before the set time as the vertical axis, the inverse function graph of each originating and terminating station is plotted.
[0037] Preferably, according to a plurality of different feasible numbers of trains to be used and the corresponding total number of train charging tasks, a two-dimensional Pareto solution set image is drawn, and the number of trains to be used is determined in combination with the inverse function image, including the following steps:
[0038] With the number of feasible trains as the horizontal axis and the total number of train charging tasks as the vertical axis, the values of multiple different feasible train numbers and the corresponding total number of train charging tasks are plotted in the form of points on a two-dimensional coordinate system to obtain a two-dimensional Pareto solution set image;
[0039] A solution is selected from the two-dimensional Pareto solution set image, and the number of trains to be used is determined based on the number of feasible trains to be used for the selected solution.
[0040] Preferably, the number of trains assigned to the intelligent rail express system line is calculated based on the number of spare trains and the number of trains under repair of the intelligent rail express system and the determined number of operating trains, specifically:
[0041] Add the number of spare trains and trains under repair of the intelligent rail express system to the determined number of operating trains to obtain the number of trains assigned to the intelligent rail express system line.
[0042] Preferably, the number of spare trains in the intelligent rail express system is calculated as follows:
[0043]
[0044] Among them, N 备 is the number of spare trains, N 运 is the number of trains in operation, δ 备 is the reserve rate;
[0045] The calculation method for the number of trains under repair in the intelligent rail express system is:
[0046]
[0047] Among them, N 修 is the number of trains under repair, h i is the maintenance cycle coefficient of maintenance process i, t i is the detention time for repair process i.
[0048] The present invention has the following beneficial effects:
[0049] 1. This paper proposes a new calculation method for determining the fleet size of smart rail lines, which is used to determine the number of vehicles (trains) required for smart rail lines. This method considers three different fleet size components: the number of operating vehicles, the number of spare vehicles, and the number of vehicles under maintenance.
[0050] 2. Based on the network flow mathematical programming model, this paper considers the charging needs of smart rail trains and proposes a new dual-objective linear programming model. This model is then converted into a single-objective linear programming model. This model not only calculates the number of smart rail vehicles in operation but also optimizes the total number of charging times for smart rail trains. Furthermore, the "two-dimensional Pareto solution diagram" proposed in this paper can help operating management companies select a plan for the number of smart rail vehicles that best meets their actual needs.
[0051] 3. The present invention makes full use of the advantages of the graphical representation of the deficit function model. By drawing the corresponding deficit function image for each station, it can not only intuitively and visually analyze the train ownership of each station in the smart rail line at different time periods, that is, the abundance or shortage of trains, but also obtain the number of smart rail vehicles that each station should be equipped with during the full-day operation period. This greatly facilitates the research work on the scale of the station fleet in the road network and the scheduling operations of the operating staff. BRIEF DESCRIPTION OF THE DRAWINGS
[0052] Figure 1 A flow chart of a method for calculating the number of trains assigned to a line in an intelligent rail express system;
[0053] Figure 2 This is the deficit function diagram of the starting station of the smart rail line;
[0054] Figure 3 This is the deficit function diagram of the terminal station of the smart rail line. DETAILED DESCRIPTION
[0055] The specific embodiments of the present invention are described below to facilitate understanding of the present invention by those skilled in the art. However, it should be clear that the present invention is not limited to the scope of the specific embodiments. For those skilled in the art, as long as various changes are within the spirit and scope of the present invention as defined and determined by the appended claims, these changes are obvious, and all inventions and creations utilizing the concepts of the present invention are protected.
[0056] Because the charging requirements of smart rail trains result in varying turnaround times for each trip, the traditional method of calculating fleet size based on fixed vehicle turnaround times and departure intervals is unsuitable for smart rail lines. Therefore, this paper expands on the network flow mathematical programming model and leverages the graphical representation of the inverse function to better address the problem of calculating the number of vehicles assigned to smart rail lines with charging requirements.
[0057] like Figure 1 As shown, an embodiment of the present invention provides a method for calculating the number of trains assigned to a line in an intelligent rail express system, comprising the following steps S1 to S5:
[0058] S1. Generate train service information for the full-day operation period based on the line operation period and train departure interval of the intelligent rail express system, and calculate the minimum number of line operation trains required to execute all service trips based on the train service trip data information;
[0059] In an optional embodiment of the present invention, the present embodiment calculates the minimum number of line-operated trains required to execute all service trips based on train service trip data information, including the following steps:
[0060] Based on the train service data, a network flow integer programming model without considering charging is constructed;
[0061] Solve the network flow integer programming model without considering charging to obtain the maximum feasible number of train connections;
[0062] The minimum number of line-operated trains required to execute all service trips is calculated based on the maximum feasible number of train connections.
[0063] In this embodiment, the network maximum flow model for the minimum fleet size problem is constructed using three attributes of the service train data information and a judgment coefficient. The three attributes of the train data information are the departure time x of train number i and the departure time x of train number i. i , trip time t i , the turnaround preparation time △t of train number i i ; The judgment coefficient of whether train number i and j are located at the same station is z ij , judgment coefficient z ij The purpose is to constrain the train number u and j to be the same station, that is, no empty trains are allowed. The mathematical expression of the specific model is as follows:
[0064]
[0065] The constraints are:
[0066] x j -(x i +t i +△t i +z ij )≥(x ij -1)*M1,i,j∈I
[0067]
[0068]
[0069] Among them, Max is the maximum value function, C VS (I) is the number of feasible train connections, I is the set of train service trips, x ij Is a 0-1 variable indicating whether train number i and train number j are executed by the same train. If so, then x ij =1, otherwise x ij =0,x ij The value is mainly determined by the departure time of trains i and j, the travel time of train i, the turnaround time after train i ends, and the judgment coefficient of whether trains i and j are located at the same station; j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, Δt i is the turnaround preparation time for train number i, z ij is the judgment coefficient of whether train number i and train number j are located at the same station. If train number i and train number j are located at the same station, then z ij =0, otherwise the value is usually the length of the operating cycle; M1 is a set positive parameter, and its value is usually several times the length of the operating cycle; T is the length of the operating cycle.
[0070] By solving the above model, we can get the maximum feasible train connection number C VS (I), which is the corresponding maximum network flow in the network flow model.
[0071] The maximum feasible train connection number C obtained based on the solution VS (I), the minimum fleet size required can be calculated as follows:
[0072] MinF VS (I)=|I|-MaxC VS (I)
[0073] Among them, Min is the minimum function, F VS (I) is the number of trains used on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, C VS (I) is the number of feasible train connections.
[0074] S2. Construct a dual-objective linear programming model with the objective function of minimizing the number of trains in operation on the line and minimizing the number of train charging tasks. Based on the minimum number of trains in operation on the line, calculate multiple different feasible numbers of trains in operation and the corresponding total number of train charging tasks.
[0075] In an optional embodiment of the present invention, this embodiment constructs a dual-objective linear programming model whose objective function is to minimize the number of trains in operation on the line and minimize the number of train charging tasks. Based on the minimum number of trains in operation on the line, multiple different feasible numbers of trains in operation and corresponding numbers of train charging tasks are calculated, including the following steps:
[0076] Construct a dual-objective linear programming model with the objective function of minimizing the number of trains used on the line and minimizing the number of train charging tasks;
[0077] The objective function of minimizing the number of trains used on the line in the dual-objective linear programming model is converted into constraints, resulting in a single-objective linear programming model with the objective function of minimizing the number of train charging tasks.
[0078] Based on the minimum number of trains used on the line, the number of feasible train connections is gradually increased in steps of 1. The single-objective linear programming model with the objective function of minimizing the number of train charging tasks is solved, and multiple different feasible numbers of trains used and the corresponding numbers of train charging tasks are obtained.
[0079] In this embodiment, the network flow integer programming model of step S1 is expanded to fully consider the power consumption, safety power threshold, charging power of charging piles, etc. of the smart rail trains, and the objective function is to construct a dual-objective linear programming model with the objective function of minimizing the fleet size and minimizing the number of train charging tasks. Based on the calculation results in step S1, multiple feasible options for the number of smart rail trains and the number of charging tasks that take into account the train charging needs are calculated. The specific dual-objective linear programming model is as follows:
[0080]
[0081] The constraints are:
[0082] Train chain constraints:
[0083]
[0084] Constraints on whether trains i and j can connect:
[0085]
[0086] The constraints of train connections being greater than charging tasks:
[0087]
[0088] Power consumption constraints:
[0089]
[0090] Vehicle remaining power constraints:
[0091]
[0092] Among them, Min is the minimum function, F VS (I) is the number of trains used on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, x ij is a 0-1 variable indicating whether train number i and train number j are executed by the same train, F BS The number of charging tasks for the train, y ij is a 0-1 variable indicating whether train number i is connected to train number j and whether the train is charging. j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, Δt i is the turnaround preparation time for train number i, z ij is a 0-1 variable indicating whether train number i and train number j are located at the same station, Q is the maximum battery capacity of the train, is the remaining power of the train after the train number i is executed, P is the rated charging power of the charging pile, M2 is a set positive integer, is the remaining power of the train before train number i, q i is the power consumed by each trip of train number i, α is the safety power threshold coefficient of the train, is the remaining power of the train before the execution of train number j, u ij is the remaining power of the train from train number i to train number j, r ij is a 0-1 variable indicating whether the train number i is connected and has a charging task, and T is the duration of the operation cycle.
[0093] In the above model, the two objective functions are to minimize the number of trains used on the smart rail line and to minimize the total number of charging times of the smart rail trains. The departure time of train number i, j is x i , x j , assuming that the departure time is discretized into minutes. The train chain connection constraint ensures that each train can only be connected to one train before and after. The judgment basis for whether train i and j can be connected is based on the departure time of train i and j, the travel time of train i, the turnaround preparation time after the end of train i, the judgment coefficient of whether train i and j are located at the same station and the charging time of the train. If trains i and j can be executed by the same vehicle, x ij =1 or 0; if trips i and j cannot be performed by the same vehicle, then x ij = 0; if the train is charged after completing train number i and then executes train number j, then y ij =1; if the train does not need to be charged after completing trip i, then y ij= 0. The train connection greater than charging task constraint means that charging is only considered when there is a connection between trains; charging is not considered when there is no connection between trains. The power consumption constraint ensures that the train's remaining power does not fall below a pre-set power safety threshold. The vehicle's remaining power constraint ensures that the train has sufficient power to complete the next train's mission before executing the corresponding train.
[0094] This embodiment converts the objective function of the number of vehicles used on the smart rail line in the above model objective function into a constraint condition, and can obtain the following single-objective linear programming model for calculating the total number of charging times of smart rail trains during the full-day operation period:
[0095]
[0096] Add the following constraints based on the original ones:
[0097]
[0098] In step S1, the number of feasible train connections C VS Based on the solution of (I), the number of feasible train connections C VS (I) By increasing the step size by 1, the number of different smart rail vehicles and the corresponding number of charging times can be solved.
[0099] S3. Use the deficit function graphical dispatch model to draw a deficit function image for each originating and terminating station;
[0100] In an optional embodiment of the present invention, the embodiment uses the deficit function graphical scheduling model to draw the deficit function image of each originating and terminating station, including:
[0101] With time as the horizontal axis and the difference between the total number of departing trains and the total number of arriving trains at the originating and terminating stations before the set time as the vertical axis, the inverse function graph of each originating and terminating station is plotted.
[0102] In this embodiment, the deficit function model is a graphical model, also known as a step function. The connotation of this step function is: at a single station, if a vehicle is dispatched from the station, the function value is increased by 1; if a vehicle arrives at the station, the function value is reduced by 1. Its greatest advantage is that it can intuitively and visually analyze the vehicle ownership of each station in the line network at different time periods, that is, the abundance or shortage of the number of vehicles. This brings great convenience to the research work on the scale of station vehicles in the road network and the scheduling operations of the operation staff. The deficit function image is a two-dimensional image, in which the horizontal axis represents time and the vertical axis represents the difference between the total number of departure vehicles and the number of arrival vehicles before a certain moment (including the moment). The train service train information of the full-day operation period generated according to the line operation period and train departure interval of the intelligent rail express system can be used to draw the deficit function image of all the starting and ending stations of the line. Figure 2 and Figure 3 The deficit function diagram of the starting and ending stations of a certain intelligent rail line is given.
[0103] This embodiment takes advantage of the graphical representation of the deficit function model to draw a corresponding deficit function image for each station, thereby obtaining the number of smart rail line vehicles that should be equipped at each station.
[0104] S4. Draw a two-dimensional Pareto solution set graph based on multiple different feasible numbers of trains and the corresponding total number of train charging tasks, and determine the number of trains to be used in combination with the deficit function graph;
[0105] In an optional embodiment of the present invention, this embodiment draws a two-dimensional Pareto solution set graph based on multiple different feasible numbers of trains and the corresponding total number of train charging tasks, and determines the number of trains to be used in combination with the inverse function graph, including the following steps:
[0106] With the number of feasible trains as the horizontal axis and the total number of train charging tasks as the vertical axis, the values of multiple different feasible train numbers and the corresponding total number of train charging tasks are plotted in the form of points on a two-dimensional coordinate system to obtain a two-dimensional Pareto solution set image;
[0107] A solution is selected from the two-dimensional Pareto solution set image, and the number of trains to be used is determined according to the number of feasible trains to be used for the selected solution.
[0108] In this embodiment, for each scenario involving the number of trains in operation on a smart rail line and the total number of charging missions for smart rail trains, a two-dimensional Pareto solution graph is plotted that encompasses these two objectives. The minimum number of trains in operation on a line in the two-dimensional Pareto solution graph refers to the total number of trains in operation that perform all service trips. The total number of trains in operation can also be understood as the sum of the number of trains in operation deployed by all stations on the line. The deficit function graph, however, decomposes the total number of trains in operation by providing the required number of trains for each station on the line. Therefore, dispatchers can select a scenario with the required number of trains in operation based on the resulting two-dimensional Pareto solution graph and the deficit function graph for each station under different circumstances.
[0109] This embodiment calculates the total number of charging tasks for each new smart rail line fleet size plan adjusted in step S2. Then, using these two indicators as horizontal and vertical coordinates, the values obtained from each adjustment and solution are plotted as points on a two-dimensional coordinate graph, resulting in a Pareto-optimal solution set for these two indicators. Dispatchers select a solution from the Pareto-optimal solution set based on actual needs and use the corresponding smart rail line fleet size plan as the final operational fleet size plan.
[0110] S5. Calculate the number of trains assigned to the intelligent rail express system line based on the number of spare trains and trains under repair in the intelligent rail express system and the number of operating trains determined.
[0111] In an optional embodiment of the present invention, the number of trains assigned to the intelligent rail express system line is calculated based on the number of spare trains and the number of trains under repair of the intelligent rail express system and the determined number of operating trains, specifically:
[0112] Add the number of spare trains and trains under repair of the intelligent rail express system to the determined number of operating trains to obtain the number of trains assigned to the intelligent rail express system line.
[0113] In this embodiment, the number of spare trains and the number of trains under repair of the smart rail train are calculated based on the maintenance schedule and maintenance system of the smart rail train.
[0114] A spare car is a train that is used to replace a faulty train when a train breaks down, and is put into service on the main line as a reserve to ensure normal operation of the line. The spare rate for the same operating period is a fixed value and is calculated based on a certain spare rate. The number of spare cars is calculated as follows:
[0115]
[0116] Among them, N 备 is the number of spare trains, N 运 is the number of trains in operation, δ备 is the reserve rate;
[0117] Regarding the number of vehicles under repair, except for train inspection, all levels of maintenance are only carried out during statutory working hours, that is, the annual maintenance working time is 250 days (calculated as 365 days a year). Based on the total workload of maintenance at all levels throughout the year, the formula for calculating the average number of vehicles under repair per day is as follows:
[0118]
[0119] Among them, N 修 is the number of trains under repair, N 运 is the number of trains in operation, h i is the maintenance cycle coefficient of maintenance process i, t i is the detention time for repair process i.
[0120] Finally, add up the number of operating vehicles, spare vehicles, and vehicles under repair to get the number of trains assigned to the smart rail line:
[0121] N 配 =N 运 +N 备 +N 修
[0122] In this embodiment, the network maximum flow model for the minimum fleet size problem is solved using optimization solver software, and the inverse function image and the two-dimensional Pareto solution set image are drawn using a drawing software tool.
[0123] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, 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 device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. 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.
[0124] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.
[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.
[0126] Specific embodiments are used in the present invention to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core ideas. At the same time, for those skilled in the art, according to the ideas of the present invention, there may be changes in the specific implementation methods and application scopes. In summary, the contents of this specification should not be understood as limiting the present invention.
[0127] Those skilled in the art will appreciate that the embodiments described herein are intended to help readers understand the principles of the present invention, and it should be understood that the scope of protection of the present invention is not limited to such specific descriptions and embodiments. Those skilled in the art can make various other specific variations and combinations based on the technical teachings disclosed in the present invention without departing from the essence of the present invention, and such variations and combinations are still within the scope of protection of the present invention.
Claims
1. A method for calculating the number of trains assigned to a line of an intelligent rail express system, characterized in that: The following steps are involved: Generate train service information for the full-day operation period according to the line operation period and train departure interval of the intelligent rail express system, and calculate the minimum number of line operation trains required to execute all service trips based on the train service trip data information; A dual-objective linear programming model with the objective function of minimizing the number of trains in operation on the line and minimizing the number of train charging tasks is constructed. Based on the minimum number of trains in operation on the line, multiple different feasible numbers of trains in operation and the corresponding total number of train charging tasks are calculated; Use the deficit function graphical dispatch model to draw the deficit function image of each departure and arrival station; According to multiple different feasible numbers of trains and the corresponding total number of train charging tasks, a two-dimensional Pareto solution set graph is drawn, and the number of trains to be used is determined in combination with the deficit function graph; According to the number of spare trains and trains under repair in the intelligent rail express system, the number of trains assigned to the intelligent rail express system line is calculated based on the determined number of operating trains.
2. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: Calculating the minimum number of line operation trains required to execute all service trains based on train service train number data information includes the following steps: Based on the train service data information, a network flow integer programming model without considering charging is constructed; Solve the network flow integer programming model without considering charging to obtain the maximum feasible number of train connections; The minimum number of line-operated trains required to execute all service trips is calculated based on the maximum feasible number of train connections.
3. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 2, characterized in that: The specific integer programming model for network flow without considering charging is as follows: The constraints are: Among them, Max is the maximum value function, C VS (I) is the number of feasible train connections, I is the set of train service numbers, x ij is a 0-1 variable indicating whether train number i and train number j are executed by the same train, x j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, △t i is the turnaround preparation time of train number i, z ij is the judgment coefficient of whether train number i and train number j are located in the same station, M1 is the set positive parameter, and T is the length of the operation cycle.
4. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 2, characterized in that: The minimum number of line operation trains required to execute all service trips is calculated based on the maximum number of feasible train connections: MinF VS (I)=|I|-MaxC VS (I) Among them, Min is the minimum function, F VS (I) is the number of trains in service on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, C VS (I) is the number of feasible train connections.
5. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: A dual-objective linear programming model with the objective function of minimizing the number of line operating trains and minimizing the number of train charging tasks is constructed, and multiple different feasible numbers of operating trains and corresponding numbers of train charging tasks are calculated based on the minimum number of line operating trains, including the following steps: Construct a dual-objective linear programming model with the objective function of minimizing the number of trains used on the line and minimizing the number of train charging tasks; The objective function of minimizing the number of trains used on the line in the dual-objective linear programming model is transformed into a constraint condition, and a single-objective linear programming model with the objective function of minimizing the number of train charging tasks is obtained; Based on the minimum number of trains in operation on the line, the number of feasible train connections is gradually increased in steps of 1, and a single-objective linear programming model with the objective function of minimizing the number of train charging tasks is solved to obtain multiple different feasible numbers of trains in operation and the corresponding numbers of train charging tasks.
6. A method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 5, characterized in that: A dual-objective linear programming model with the objective function of minimizing the number of line operating trains and minimizing the number of train charging tasks is constructed, specifically: The constraints are: Among them, Min is the minimum function, F VS (I) is the number of trains in service on the line, |I| is the number of all trains in the train service set I, Max is the maximum value function, x ij is a 0-1 variable indicating whether train number i and train number j are executed by the same train, F BS The number of charging tasks for the train, y ij is a 0-1 variable indicating whether train number i is connected to train number j and the train is charged, x j is the departure time of train number j, x i is the departure time of train number i, t i is the travel time of train number i, △t i is the turnaround preparation time of train number i, z ij is the judgment coefficient of whether train number i and train number j are located at the same station, Q is the maximum battery capacity of the train, is the remaining power of the train after the train number i is executed, P is the rated charging power of the charging pile, M2 is a set positive integer, is the remaining power of the train before train number i, q i is the power consumed by each trip of train number i, α is the safety power threshold coefficient of the train, is the remaining power of the train before the execution of train number j, u ij is the remaining power of the train from train number i to train number j, r ij is a 0-1 variable indicating whether train number i and train number j are connected and have charging tasks, and T is the duration of the operation cycle.
7. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: The deficit function diagram scheduling model is used to draw the deficit function image of each departure and arrival station, including: With time as the horizontal axis and the difference between the total number of departing trains and the total number of arriving trains at the originating and terminating stations before the set time as the vertical axis, the inverse function graph of each originating and terminating station is plotted.
8. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: According to a plurality of different feasible numbers of trains and the corresponding total number of train charging tasks, a two-dimensional Pareto solution set image is drawn, and the number of trains to be used is determined in combination with the deficit function image, including the following steps: With the number of feasible trains as the horizontal coordinate and the total number of train charging tasks as the vertical coordinate, multiple different numbers of feasible trains and the corresponding total number of train charging tasks are plotted in the form of points on a two-dimensional coordinate system to obtain a two-dimensional Pareto solution set image; A solution is selected from the two-dimensional Pareto solution set image, and the number of operating trains is determined according to the number of feasible operating trains of the selected solution.
9. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: According to the number of spare trains and trains under repair of the intelligent rail express system, the number of trains assigned to the intelligent rail express system line is calculated based on the determined number of operating trains, specifically: Add the number of spare trains and trains under repair of the intelligent rail express system to the determined number of operating trains to obtain the number of trains assigned to the intelligent rail express system line.
10. The method for calculating the number of trains assigned to a line of an intelligent rail express system according to claim 1, characterized in that: The calculation method for the number of spare trains in the intelligent rail express system is: N 备 =[N 运 *d 备 ] Among them, N 备 is the number of spare trains, N 运 is the number of trains in operation, δ 备 is the reserve rate; The calculation method for the number of trains under repair in the intelligent rail express system is: Among them, N 修 is the number of trains under repair, h i is the maintenance cycle coefficient of maintenance process i, t i is the detention time for repair process i.
Citation Information
Patent Citations
Single-line public vehicle scheduling method combining expert experience and operational optimization
CN111539133A
Demand response bus flexible scheduling optimization method based on man-machine collaborative decision
CN117575292A
Scheduling processing method and device, equipment, storage medium and program product
CN118521054A
Cited By
Interval train number inspection method, medium and system
CN119682807A
Method, medium and system for checking the number of trains in a section
CN119682807B
