A method and application for compiling parking wiring diagram for metropolitan rail transit mainline

Abstract

The present invention belongs to the technical field of rail transit engineering design, and in particular, relates to a method and application for compiling a main line parking wiring diagram for metropolitan rail transit, including the following steps: obtaining basic project data and pre-sequence data; establishing a wiring diagram compilation model for main line parking of metropolitan rail transit; solving based on the Pareto optimal strategy; and completing the wiring diagram compilation in combination with the setting requirements of single crossing lines, passing lines, and return lines. The present invention considers factors such as the investment in yard engineering, the investment in station parking line engineering, the number of main line parking, the spacing between parking lines, the setting of yard tracks, the maintenance rules of line contact network vehicles, and the rules of all-day vehicle operation, and constructs a multi-objective mathematical programming model and solution strategy to form a method for compiling a main line parking wiring diagram for metropolitan rail transit. The present invention also solves the technical problem of accurately calculating the number of main line parking lots, greatly improving the design quality and efficiency.

Description

Technical Field

[0001] The present invention belongs to the technical field of rail transit engineering design, and in particular relates to a method for compiling a mainline parking wiring diagram for metropolitan rail transit and its application. Background Art

[0002] The main line of the rail transit project needs regular maintenance. Usually, all vehicles will return to the depot to stop after they are out of operation at night, and some trains will also be inspected and maintained according to the maintenance plan. The scale of the depot construction is generally determined according to the number of trains that need to stop in the near and long term. However, in the urban circle, due to the shortage of land resources, it is impossible to build a depot to meet the parking needs of all trains, which requires setting up nighttime parking conditions for some trains. According to the rail transit project line, contact network, and vehicle maintenance regulations, these maintenance operations can be completed every two days, which makes it possible for some trains that cannot return to the depot to stop on the main line at night. When the train stops on the main line at night, the stop position is very important. It can be on the station platform or on the parking line; in order to effectively reduce the scale of the depot, some vehicles can also stop on the parking line within the main line during the daytime operation of the line, which will have an important impact on the preparation of the wiring diagram. In urban areas where land resources are expensive, how many stop lines should be set up for rail transit projects, how many trains should be arranged to stop on the main line at night, and how many trains should be arranged to stop on the stop lines during the day. This is closely related to the line, contact network, vehicle maintenance regulations, wiring layout of stations along the line, and the line's driving plans at different times of the day. There is currently a lack of specialized research on this issue. In addition, the transportation organization method for vehicles returning to the depot at night will also cause problems such as long empty driving distances, complex processes within the depot, and the need to start trains long in advance for morning operations. Summary of the invention

[0003] In order to solve the problems existing in the prior art, the present invention provides a method and application for compiling a mainline parking wiring diagram for metropolitan rail transit.

[0004] The present invention is implemented as follows: a method and application for compiling a parking wiring diagram for a metropolitan rail transit mainline, comprising the following steps:

[0005] Step 1: Obtain basic project data and previous information;

[0006] Step 2: Establish a wiring diagram compilation model for metropolitan rail transit mainline parking;

[0007] Step 3: Solve based on Pareto optimal strategy;

[0008] Step 4: Complete the wiring diagram based on the requirements for setting up single crossing lines, passing lines, and return lines.

[0009] Furthermore, the basic data and previous information of the project are obtained, including:

[0010] The number of stations on the line, the passenger flow forecast data of the annual peak hour section, the daily passenger flow section, the number of people getting on and off at each station throughout the day, the length of the entry and exit lines, the wiring conditions of each station, the travel speed of the entire line, the line intersection plan, the daily driving plan, the maximum design speed, the number of vehicles used during peak hours in the near and long term, the number of vehicles used during off-peak hours in the near and long term, the number of spare vehicles and other previous information.

[0011] Furthermore, the wiring diagram compilation model for metropolitan rail transit mainline parking is established, including:

[0012] The wiring diagram compilation model for mainline parking of metropolitan rail transit includes decision variables, objective functions, and constraint conditions.

[0013] The decision variables include: i ,y j , z;

[0014] Among them, the decision variable x i is a binary variable, which is used to indicate whether the i-th station has a stop line. If yes, it takes 1, otherwise it takes 0. The decision variable y j is a binary variable, used to indicate whether the jth track of the section is set, if yes, it takes 1, otherwise it takes 0; the decision variable z is an integer variable, used to indicate the number of mainline parking at night;

[0015] The objective function takes the minimum overall investment scale of station parking lines and yard tracks and the maximum number of trains parked on the main line as the optimization goal. The objective function is shown in formulas (1) and (2):

[0016]

[0017] Where W1 represents the overall investment scale of the setting of parking lines and track sections of all stations along the entire line, in units of 10,000 yuan; c i represents the engineering investment for setting up the parking line at station i, in ten thousand yuan; c′ j It represents the engineering investment for setting up the j-th track in the yard, in ten thousand yuan; I represents the station collection; J represents the yard track collection.

[0018] max W2=z Formula (2)

[0019] Where W2 represents the total number of trains stopping on the main line at night, in trains;

[0020] The constraints include: the number of parking lots on the main line, the maximum spacing requirements for wiring settings, and the order constraints for track settings in the yard.

[0021] Furthermore, the solution based on Pareto optimal strategy includes:

[0022] Firstly, only the objective function formula (2) is considered as the objective function of the planning model to solve, and the full-line parking line arrangement scheme under the condition of maximizing the number of trains stopping on the main line is obtained. Then, the objective of maximizing the number of trains stopping on the main line is transformed and added to the wiring diagram compilation model. The specific transformation form is as follows:

[0023]

[0024] In the formula, represents the optimal target value of the wiring diagram compilation model under the condition of considering only the single objective function formula (2), ε represents the maximum deviation of the decision maker from the number of trains stopping on the main line, 0≤ε≤ε max , ε max The maximum tolerance acceptable to decision makers;

[0025] Then, by adjusting the ε value, the corresponding approximate Pareto frontier is obtained, which makes it easier for decision makers to choose a satisfactory solution.

[0026] Furthermore, according to the actual land use situation in the metropolitan area, the full-line wiring diagram is compiled by considering the mainline parking under the premise of limiting the yard scale; for the decision variable y j , before compiling the wiring diagram, define where j * Indicates the maximum number of tracks corresponding to the limited field section size.

[0027] Furthermore, in the case where there are multiple sections, tracks are set separately for each section.

[0028] Furthermore, the idle mileage of the train's dispatching and receiving vehicles when they are not carrying passengers entering or leaving the yard is calculated, thereby calculating the operational energy savings.

[0029] Furthermore, the parking line setting intervals are different under different rescue speed conditions.

[0030] Furthermore, the passing line, the turning line and the stop line are arranged in combination.

[0031] In a second aspect, the present invention provides a system for compiling a wiring diagram for main line parking of metropolitan rail transit, which is used to implement a method for compiling a wiring diagram for main line parking of metropolitan rail transit.

[0032] In the third aspect, the present invention provides a device for compiling a main line parking wiring diagram for urban rail transit, comprising: a memory and a processor, wherein the memory stores executable code that can be loaded and executed by the processor for a method for compiling a main line parking wiring diagram for urban rail transit.

[0033] In a fourth aspect, the present invention provides a machine-readable storage medium for compiling a main line parking wiring diagram for metropolitan rail transit, storing executable code that can be loaded and executed by a processor for a method for compiling a main line parking wiring diagram for metropolitan rail transit.

[0034] Combining all the above technical solutions, the advantages and positive effects of the present invention are as follows:

[0035] 1. The present invention conducts special research on the preparation method and application of the main line parking wiring diagram of urban rail transit, improves the wiring diagram preparation work, is conducive to reducing the engineering investment in site construction, reducing vehicle idle mileage, shortening the operation preparation time while ensuring the same operation service time, improving the efficiency of the main line operation time, increasing the night operation and maintenance time, and reducing the operation cost.

[0036] 2. The present invention takes into account factors such as the investment in yard engineering, the investment in station parking line engineering, the number of mainline parking lots, the spacing between parking lines, the yard track settings, the line contact network vehicle maintenance rules, and the daily vehicle operation rules, and constructs a multi-objective mathematical programming model and solution strategy to form a method for compiling a mainline parking wiring diagram for urban rail transit, which solves the technical problem of accurately calculating the number of mainline parking lots and greatly improves the design quality and efficiency.

[0037] 3. Through the proposal of the wiring diagram compilation method in the present invention, it is possible to provide an effective implementation method for the compilation of mainline parking wiring diagrams in the design of urban rail transit, filling the research gap in the relevant field.

[0038] 4. The technical solution of the present invention will have significant expected benefits after transformation, taking time cost and operating cost as examples, as follows:

[0039] ①. After the end of each day's operation, the train is parked on the main line, which can reduce the idle mileage of the train on the entry and exit lines and save operating costs.

[0040] ②. Trains parked on the main line at night can enter the operating position more quickly when they depart in the morning, saving operation preparation time and improving service levels.

[0041] ③. Save land for vehicle depots, avoid large-scale occupation of urban land resources, and improve land resource utilization.

[0042] ④. When an operating train breaks down, the spare train parked on the parking line can be immediately put into use to shorten the operation interruption time. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments of the present application. 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 creative work.

[0044] Figure 1 It is a flow chart of a method for compiling a parking wiring diagram for a main line of metropolitan rail transit provided by an embodiment of the present invention;

[0045] Figure 2 It is a module diagram of a system for compiling a mainline parking wiring diagram for metropolitan rail transit provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0047] The terms used in the embodiments of the present invention are only for the purpose of describing specific embodiments, and are not intended to limit the present invention. The singular forms "a", "said" and "the" used in the embodiments of the present invention and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings, and "multiple" generally includes at least two.

[0048] In addition, the step sequence in the following method embodiments is only an example and not a strict limitation.

[0049] Example 1

[0050] like Figure 1 As shown, this embodiment provides a method for compiling a parking wiring diagram for a metropolitan rail transit mainline, including:

[0051] Step 1: Obtain basic project data and previous information;

[0052] Step 2: Establish a wiring diagram compilation model for metropolitan rail transit mainline parking;

[0053] Step 3: Solve based on Pareto optimal strategy;

[0054] Step 4: Complete the wiring diagram based on the requirements for setting up single crossing lines, passing lines, and return lines.

[0055] In step 1, basic data and previous information of the project are obtained; specifically, including: the number of stations on the line, the passenger flow forecast data of the annual peak hour section, the full-day passenger flow section, the number of people getting on and off at each station throughout the day, the length of the entry and exit lines, the wiring setting conditions of each station, the travel speed of the entire line, the line intersection plan, the full-day driving plan, the maximum design speed, the number of vehicles used in peak hours in the near and long term, the number of vehicles used in off-peak periods in the near and long term, and the previous information on the number of spare vehicles.

[0056] In step 2, a wiring diagram compilation model for metropolitan rail transit mainline parking is established; specifically, the wiring diagram compilation model for metropolitan rail transit mainline parking includes decision variables, objective functions, and constraints.

[0057] The decision variables include: i ,y j , z;

[0058] Among them, the decision variable x i is a binary variable, which is used to indicate whether the i-th station has a stop line. If yes, it takes 1, otherwise it takes 0. The decision variable y j is a binary variable, used to indicate whether the jth track of the section is set, if yes, it takes 1, otherwise it takes 0; the decision variable z is an integer variable, used to indicate the number of mainline parking at night;

[0059] The objective function takes the minimum overall investment scale of station parking lines and yard tracks and the maximum number of trains parked on the main line as the optimization goal. The objective function is shown in formulas (1) and (2):

[0060]

[0061] Where W1 represents the overall investment scale of the setting of parking lines and track sections of all stations along the entire line, in units of 10,000 yuan; c i represents the engineering investment for setting up the parking line at station i, in ten thousand yuan; c′ j It represents the engineering investment for setting up the j-th track in the yard, in ten thousand yuan; I represents the station collection; J represents the yard track collection.

[0062] max W2=z Formula (2)

[0063] Where W2 represents the total number of trains stopping on the main line at night, in trains;

[0064] The constraints include: the number of parking lots on the main line, the maximum spacing requirements for wiring settings, and the order constraints for track settings in the yard.

[0065] Specifically, the main line parking quantity range constraint should be no less than the number of trains that the depot cannot accommodate at night, no more than the number of trains that do not need to undergo vehicle maintenance on the day, and the maximum number of trains that the main line can accommodate during off-peak operation, as shown in formula (4):

[0066]

[0067] Among them, N 高峰运 Indicates the number of vehicles in use during peak hours on the main line, N 备 Indicates the number of spare vehicles, N 平峰运 Indicates the number of vehicles in use during off-peak hours.

[0068] Specifically, the maximum spacing requirement for wiring arrangement is that the interval between two stations with stop lines is not greater than a given distance, that is, if the target station has a stop line within a given distance, then at least one station within the given distance should also have a stop line; otherwise, at least one station within the given distance should have a stop line, as shown in formula (5):

[0069]

[0070] Among them, Δ represents the given distance, x i+h Indicates the target station x i The hth station after, H represents the target station x i The number of the station farthest from the end where a stop line must be set; L i , L i+H , L i+H+1 They respectively represent the distances from the i-th, i+H-th, and i+H+1-th stations to the starting point of the line.

[0071] Specifically, the track setting order constraint of the field section indicates that when the inner and outer tracks of a field section are set, all the inner tracks are set, as shown in formula (6):

[0072]

[0073] Among them, y k Indicates the setting of the kth track in the field. If y k =1, indicating that the kth track in the field has been set; if y k =0, indicating that the kth track is not set in the field.

[0074] In step 3, the solution is obtained based on the Pareto optimal strategy; specifically, it includes: firstly, only considering the objective function formula (2) as the objective function of the planning model for solution, and obtaining the full-line parking line arrangement plan under the condition of maximizing the number of trains stopping on the main line, and then transforming the objective of maximizing the number of trains stopping on the main line and adding it to the wiring diagram compilation model. The specific transformation form is as follows:

[0075]

[0076] In the formula, represents the optimal target value of the wiring diagram compilation model under the condition of considering only the single objective function formula (2), ε represents the maximum deviation of the decision maker from the number of trains stopping on the main line, 0≤ε≤ε max , ε max The maximum tolerance acceptable to decision makers;

[0077] Then, by adjusting the ε value, the corresponding approximate Pareto frontier is obtained, which makes it easier for decision makers to choose a satisfactory solution.

[0078] Furthermore, the single-objective model involved in the solution process is a nonlinear model. In order to facilitate the solution using existing technologies, all nonlinear constraints can be linearized first.

[0079] Specifically, in formula (4), we can let At the same time, R should satisfy formula (7) to formula (11):

[0080] R≥(N 高峰运 +N 备 ) / 2 Formula (7)

[0081]

[0082] R≤(N 高峰运 +N 备 ) / 2+(1-μ)M Formula (9)

[0083]

[0084] μ∈{0,1}, M is a large positive number (11)

[0085] At this time, formula (4) can be transformed into:

[0086]

[0087] Specifically, formula (6) can be transformed into formula (13) to formula (14):

[0088] y k ≤y j j=1,2,...,k,k∈J Formula (13)

[0089]

[0090] Therefore, the single-objective nonlinear model of the solution process can be transformed into a single-objective linear model, which can be quickly solved using existing technologies and will not be discussed in detail here.

[0091] Furthermore, according to the actual land use situation in the metropolitan area, the full-line wiring diagram is compiled by considering the mainline parking under the premise of limiting the yard scale; for the decision variable y j , before compiling the wiring diagram, define where j * Indicates the maximum number of tracks corresponding to the limited field section size.

[0092] Furthermore, in the case where there are multiple sections, the tracks for each section need to be set separately.

[0093] Furthermore, the idle mileage of the trains entering and exiting the depot without passengers is calculated, so as to calculate the operational energy savings. The idle distance of the trains on the entry and exit lines can be saved by parking on the main line. The number of main line parking is calculated by the above method. The multiplication of the two is the total idle mileage without passengers, which is then multiplied by the energy consumption index per unit kilometer of the vehicle, so as to calculate the operational energy savings brought by the main line parking.

[0094] Furthermore, the spacing of the stop lines is different under different rescue speeds. For example, for urban rail transit with a maximum operating speed of 80km / h, the spacing of the stop lines is 8km to 10km; for urban rail transit with a maximum operating speed of 160km / h, the spacing of the stop lines is within 20km.

[0095] In step 4, the station where the stop line is set is determined according to the above steps, and then the station wiring is comprehensively arranged in combination with the passing line, the return line and the single crossover line. For example, if the stop line is determined to be arranged at a certain station, and the return line is also to be set at the station, the wiring form of the station will be selected to meet the parking function and the return function at the same time. Finally, the single crossover line is arranged according to the established spacing to complete the wiring diagram.

[0096] Example 2

[0097] Accordingly, the present invention provides a system for compiling a parking wiring diagram for a metropolitan rail transit mainline, which is used to implement the method for compiling a parking wiring diagram for a metropolitan rail transit mainline in the above-mentioned embodiment 1. Figure 2 As shown, the system includes:

[0098] The module for obtaining basic project data and previous data is used to input the previous data of the number of line stations, annual peak hour sections, all-day passenger flow sections, passenger flow forecast data of the number of people getting on and off at each station throughout the day, the length of the entry and exit lines, the wiring conditions of each station, the travel speed of the entire line, the line intersection plan, the all-day driving plan, the maximum design speed, the number of vehicles used in peak hours in the near and long term, the number of vehicles used in off-peak hours in the near and long term, and the number of spare vehicles into the system;

[0099] Model building module, used to build a wiring diagram compilation model for metropolitan rail transit mainline parking;

[0100] Solution strategy module, which solves based on Pareto optimal strategy;

[0101] The wiring diagram preparation module completes the wiring diagram preparation in combination with the setting requirements of single crossing line, passing line and return line.

[0102] Example 3

[0103] The present invention provides a device for compiling a main line parking wiring diagram for metropolitan rail transit, comprising: a memory and a processor, wherein the memory stores executable code that can be loaded by the processor and executes a method for compiling a main line parking wiring diagram for metropolitan rail transit as described in Example 1.

[0104] Example 4

[0105] The present invention provides a machine-readable storage medium for compiling a mainline parking wiring diagram for metropolitan rail transit, storing executable code that can be loaded by a processor and executed by the method for compiling a mainline parking wiring diagram for metropolitan rail transit as described in Example 1.

[0106] Example 5

[0107] The present invention provides an information data processing terminal for compiling a main line parking wiring diagram for metropolitan rail transit. The information data processing terminal is used to provide a user input interface to implement the steps of the method for compiling a main line parking wiring diagram for metropolitan rail transit as described in Example 1 when executed on an electronic device. The information data processing terminal is not limited to mobile phones, computers, and switches.

[0108] Example 6

[0109] The present invention provides a server for compiling a main line parking wiring diagram for metropolitan rail transit. When the server is implemented on an electronic device, it provides a user input interface to implement the steps of the method for compiling a main line parking wiring diagram for metropolitan rail transit as described in Example 1.

[0110] It should be noted that if the modules or units in the above embodiments are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the steps in the above embodiment method, which can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of the above method embodiments can be implemented. Among them, the computer program includes computer program code, which can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium can at least include: any entity or device that can carry the computer program code to the camera / terminal device, recording medium, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium. For example, a USB flash drive, a mobile hard disk, a disk or an optical disk.

[0111] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any modifications, equivalent substitutions and improvements made by any technician familiar with the technical field within the technical scope disclosed by the present invention and within the spirit and principle of the present invention should be covered by the protection scope of the present invention.

Claims

1. A method for compiling a parking wiring diagram for a metropolitan rail transit mainline, characterized in that: The following steps are involved: Step 1: Obtain basic project data and previous information; Step 2: Establish a wiring diagram compilation model for metropolitan rail transit mainline parking; The wiring diagram compilation model for metropolitan rail transit mainline parking includes decision variables, objective functions, and constraint conditions; The decision variables include: i ,y j , z; Among them, the decision variable x i is a binary variable, which is used to indicate whether the i-th station has a stop line. If yes, it takes 1, otherwise it takes 0. The decision variable y j is a binary variable, used to indicate whether the jth track of the section is set, if yes, it takes 1, otherwise it takes 0; the decision variable z is an integer variable, used to indicate the number of mainline parking at night; The objective function takes the minimum overall investment scale of station parking lines and yard tracks and the maximum number of trains parked on the main line as the optimization goal. The objective function is shown in formulas (1) and (2): Where W1 represents the overall investment scale of the setting of parking lines and track sections of all stations along the entire line, in units of 10,000 yuan; c i represents the engineering investment for setting up the parking line at station i, in ten thousand yuan; c′ j represents the engineering investment for setting up the jth track in the yard, in ten thousand yuan; I represents the station set; J represents the yard track set; max W2=z Formula (2) Where W2 represents the total number of trains stopping on the main line at night, in trains; The constraints include: the number of parking spaces on the main line, the maximum spacing requirements for wiring, and the order constraints for track setting in the yard; Step 3: Solve based on Pareto optimal strategy; Step 4: Complete the wiring diagram based on the requirements for setting up single crossing lines, passing lines, and return lines.

2. A method for compiling a parking wiring diagram for a metropolitan rail transit mainline as claimed in claim 1, characterized in that: In step 1, the basic data and previous information of the project are obtained, including: the number of stations on the line, the passenger flow forecast data of the annual peak hour section, the full-day passenger flow section, the number of people getting on and off at each station throughout the day, the length of the entry and exit lines, the wiring setting conditions of each station, the travel speed of the entire line, the line intersection plan, the full-day driving plan, the maximum design speed, the number of vehicles used in peak hours in the near and long term, the number of vehicles used in off-peak periods in the near and long term, and the previous information of the number of spare vehicles.

3. A method for compiling a parking layout diagram for metropolitan rail transit mainline as claimed in claim 1, characterized in that: In step 2, according to the actual land use situation in the metropolitan area, the full-line wiring diagram is compiled by considering the mainline parking under the premise of limiting the yard scale; for the decision variable y j , before compiling the wiring diagram, define where j * Indicates the maximum number of tracks corresponding to the limited field section size.

4. A method for compiling a parking wiring diagram for a metropolitan rail transit mainline as claimed in claim 1, characterized in that: In step 3: firstly, only the objective function formula (2) is considered as the objective function of the planning model to solve, and the full-line parking line arrangement scheme under the condition of maximizing the number of trains stopping on the main line is obtained. Then, the objective of maximizing the number of trains stopping on the main line is transformed and added to the wiring diagram compilation model. The specific transformation form is as follows: In the formula, represents the optimal target value of the wiring diagram compilation model under the condition of considering only the single objective function formula (2), ε represents the maximum deviation of the decision maker from the number of trains stopping on the main line, 0≤ε≤ε max , ε max The maximum tolerance acceptable to decision makers; Then, by adjusting the ε value, the corresponding approximate Pareto frontier is obtained, which makes it easier for decision makers to choose a satisfactory solution.

5. The method for compiling a parking wiring diagram for a metropolitan rail transit mainline as claimed in claim 1, characterized in that: The wiring diagram compilation method also includes separately setting tracks for each section when there are multiple sections.

6. A method for compiling a parking wiring diagram for a metropolitan rail transit mainline as claimed in claim 1, characterized in that: The wiring diagram preparation method also includes calculating the idle mileage of train receiving and dispatching vehicles when they are not carrying passengers entering or leaving the yard, thereby calculating the operating energy consumption savings.

7. A method for compiling a parking wiring diagram for a metropolitan rail transit mainline as claimed in claim 1, characterized in that: The wiring diagram compilation method also includes setting stop lines under different rescue speed conditions.

8. A system for compiling parking wiring diagrams for metropolitan rail transit main lines, characterized by: A method for compiling a wiring diagram for mainline parking of metropolitan rail transit as described in any one of claims 1-7 above.

9. A device for compiling a parking wiring diagram for metropolitan rail transit mainline, characterized by: It comprises a memory and a processor, wherein the memory stores executable code which can be loaded by the processor and executes a method for compiling a wiring diagram for mainline parking of metropolitan rail transit as described in any one of claims 1 to 7.

10. A computer-readable storage medium for compiling a parking layout diagram for a metropolitan rail transit mainline, characterized in that: The device stores executable code that can be loaded by a processor and executed by a method for compiling a wiring diagram for mainline parking of metropolitan rail transit as described in any one of claims 1 to 7.

Images