Method and device for drawing running charts of large and small road traffic plans

Abstract

The invention provides a method and a device for drawing a plan running diagram of a large and small road intersection, and relates to the technical field of rail transit, and the method comprises the steps: constructing a target function based on the total running time of the large and small road intersection; the total operation time of the large and small intersections is the sum of the downlink operation time and the uplink operation time of the large and small intersections and the turn-back time of turn-back stations on the large and small intersections; the target function shows that the required number of vehicle bottoms is minimum when the total operation time of the large and small intersections is shortest; based on the objective function, determining the minimum turn-back time of turn-back stations on the large and small intersections; and based on the minimum turn-back time and the preset number of vehicle bottoms on the large and small intersections, a large and small intersection running chart is painted. Through the minimum turn-back time determined by the target function and the number of the vehicle bottoms on the preset large and small intersections, the large and small intersections running diagrams which are uniform in interval, consistent in turn-back time and accord with the operation requirements can be painted, cross conflicts of trains on different intersections are prevented from being processed, the complexity of painting the large and small intersections running diagrams is reduced, and the painting efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the field of rail transit technology, and in particular to a method and device for drawing a large and small route plan operation diagram. Background Art

[0002] Urban rail transit is the backbone of urban public transportation. It is energy-saving, land-saving, large-capacity, all-weather, pollution-free (or less-polluting) and safe. It is a green and environmentally friendly transportation system, especially suitable for large and medium-sized cities. Therefore, the preparation of a planned operation diagram is also crucial for urban rail transit.

[0003] In the related technology, although it is possible to compile operating diagrams for large and small routes, conflicts between operating lines will occur during the compilation process, and the operating lines need to be adjusted subsequently to resolve the conflicts. The drawn operating diagram will have problems such as uneven intervals and inconsistent train return times, which is quite complex. Summary of the invention

[0004] The present invention provides a method and device for drawing a large and small route plan operation diagram, which is used to solve the problem that the compilation of a train operation diagram under a large and small route mode needs to deal with the crossing conflicts of trains on different routes, which has a certain complexity.

[0005] The present invention provides a method for drawing a large and small route plan operation diagram, comprising: Based on the total running time of the large and small routes, an objective function is constructed; the total running time of the large and small routes is the sum of the down-running time, the up-running time and the turnaround time of the turnaround station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total running time of the large and small routes is the shortest; Based on the objective function, determining the minimum turnaround time of the turnaround station on the large and small routes; Based on the minimum turning time and the number of vehicle bottoms on the preset large and small routes, a large and small route operation diagram is compiled.

[0006] According to a method for drawing a large and small route plan operation diagram provided by the present invention, the objective function is constructed based on the total operation time of the large and small routes, including: Setting constraints based on the total running time of the large and small routes, the operating ratio of the large and small routes, and the tracking interval time on the small routes; Based on the constraint conditions and the return time, the objective function is constructed.

[0007] According to a method for drawing a large-and-small route plan operation diagram provided by the present invention, the method of determining the minimum turnaround time of the turnaround station on the large-and-small route based on the objective function includes: Step A: Initializing the return time based on the objective function; Step B: Determine whether the return time after initialization meets the constraint condition; Step C: when the return time after the initialization does not meet the constraint condition, determine a first return time based on a preset step size and the return time after the initialization, and determine the first return time as the return time after the initialization, and repeat steps B to C until the return time after the initialization meets the constraint condition; Step D: Determine the initialized turnaround time that meets the constraint conditions as the minimum turnaround time of the turnaround stations on the large and small routes.

[0008] According to a method for drawing a large and small route planning operation diagram provided by the present invention, drawing the large and small route operation diagram based on the minimum return time and the number of vehicle bottoms on the preset large and small routes includes: Based on the minimum turnaround time, the number of trains running on the large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the large and small route operation diagram is drawn.

[0009] According to a method for drawing a large and small route operation diagram provided by the present invention, the method of drawing a large and small route operation diagram based on the minimum return time, the number of vehicle bottoms on the preset large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, includes: Step E: for each round of route planning of large and small routes, based on the minimum turnaround time of the turnaround station on the large route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the large route is planned; Step F: for each small route after the large route, based on the minimum turnaround time of the turnaround station on the small route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the small route is laid out; Step G: Determine whether the line layout of the current wheel large and small intersection meets the preset condition; the preset condition indicates whether the line layout of the current wheel large and small intersection is less than the number of vehicle bottoms on the preset small intersection; Step H: When the line drawing of the current round of large and small intersections meets the preset conditions, repeat steps EH until the line drawing of the current round of large and small intersections does not meet the preset conditions, and draw the large and small intersection operation diagram based on the running lines of the small intersections and the large intersections that have been completed.

[0010] According to a method for drawing a large and small route plan operation diagram provided by the present invention, when the number of running lines that have been drawn on the large route is less than the number of running lines that have been drawn on the small route, the method further includes: When the line laying of the current round of large and small routes does not meet the preset conditions, the running line of the large route is supplemented within the target time period based on the tracking interval of the large route.

[0011] The present invention also provides a device for drawing a large and small route plan operation diagram, comprising: A construction module is used to construct an objective function based on the total running time of the large and small routes; the total running time of the large and small routes is the sum of the down-running time, the up-running time and the turnaround time of the turnaround station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total running time of the large and small routes is the shortest; A determination module, used for determining the minimum turnaround time of the turnaround station on the large and small routes based on the objective function; The drawing module is used to draw the large and small intersection operation diagram based on the minimum return time and the number of vehicle bottoms on the preset large and small intersections.

[0012] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method for drawing a large and small route plan operation diagram as described in any one of the above-mentioned methods is implemented.

[0013] The present invention also provides a non-transitory computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the method for drawing a large and small route plan operation diagram as described in any one of the above is implemented.

[0014] The present invention also provides a computer program product, including a computer program, which, when executed by a processor, implements any of the above-mentioned methods for drawing large and small route plan operation diagrams.

[0015] The method and device for drawing the planned operation diagram of large and small routes provided by the present invention construct an objective function based on the total operation time of large and small routes; the total operation time of large and small routes is the sum of the down-running time, the up-running time and the reversing time of the reversing station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total operation time of the large and small routes is the shortest; based on the objective function, the minimum reversing time of the reversing station on the large and small routes is determined; based on the minimum reversing time and the preset number of car bottoms on the large and small routes, the large and small route operation diagram is compiled. Through the objective function, the minimum reversing time of the reversing station on the large and small routes is determined, and then based on the minimum reversing time and the preset number of car bottoms on the large and small routes, the large and small route operation diagram with uniform spacing and consistent reversing time that meets the operation requirements can be drawn, and the intersection conflict of trains on different routes can be avoided, thereby reducing the complexity of drawing the large and small route operation diagram and improving the drawing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0017] Figure 1 It is one of the flow charts of the method for drawing the large and small route plan operation diagram provided by the present invention.

[0018] Figure 2 It is a schematic diagram of the large and small intersection mode provided by the present invention.

[0019] Figure 3 This is the second flow chart of the method for drawing the large and small route plan operation diagram provided by the present invention.

[0020] Figure 4 It is one of the schematic diagrams of the large and small route operation diagram provided by the present invention.

[0021] Figure 5 It is a schematic diagram of the large and small route operation diagram for supplementing the operation line of the large route provided by the present invention.

[0022] Figure 6 This is the second schematic diagram of the large and small route operation diagram provided by the present invention.

[0023] Figure 7 It is a structural schematic diagram of a device for drawing a large and small route plan operation diagram provided by the present invention.

[0024] Figure 8 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0025] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings 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.

[0026] In order to facilitate a clearer understanding of the embodiments of the present application, the relevant knowledge is first introduced as follows.

[0027] 1. Existing technical solutions

[0028] Existing technical solution 1: Based on basic parameters, the transition period between flat and peak traffic is re-divided and the flat peak period is adjusted to draw the train operation diagram for each period; with the goal of reducing the number of train connection pairs in adjacent periods and evenly discharging trains into and out of sections, the operation line connection plan for different periods is compiled in sequence; for the operation lines that need to enter and exit sections, an entry and exit plan is compiled; the operation diagram conflicts are checked and a relief network is established to relieve the conflicts; and a train operation diagram that can be used in actual operations is obtained.

[0029] Existing technical solution 2: To maximize the balance of the operation diagram, a rail transit train operation diagram under the large and small route mode is constructed. To reduce the complexity of the problem, a corresponding algorithm is designed based on the idea of ​​hierarchical optimization, and three sub-algorithms are designed: initial train layout, undercarriage route planning, and conflict resolution algorithm. This method provides a method for compiling large and small route plan operation diagrams by establishing an attribute model and then solving the algorithm.

[0030] However, although the existing technology can realize the compilation of large and small route operation diagrams, these two methods will cause conflicts between the operation lines during the compilation process, and the operation lines need to be adjusted subsequently to resolve the conflicts. The operation diagram will have problems such as uneven intervals and inconsistent train return times, which is quite complicated.

[0031] Based on the above problems, the present invention provides a method for drawing large and small route planning operation diagrams. Through the objective function, the minimum turnaround time of the turnaround stations on the large and small routes is determined. Then, based on the minimum turnaround time, a large and small route operation diagram with uniform intervals and consistent turnaround times that meets the operational requirements can be drawn, and the handling of crossing conflicts of trains on different routes can be avoided, thereby reducing the complexity of drawing large and small route operation diagrams and improving the drawing efficiency.

[0032] Combine the following Figure 1-Figure 3 The present invention describes the method for drawing the operation diagram of large and small routes.

[0033] Figure 1 It is one of the flow charts of the method for drawing the large and small route plan operation diagram provided by the present invention, such as Figure 1 As shown, the method includes the following steps 101 to 103.

[0034] Step 101, construct an objective function based on the total running time of the large and small routes; the total running time of the large and small routes is the sum of the down-running time, the up-running time and the turnaround time of the turnaround station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total running time of the large and small routes is the shortest.

[0035] It should be noted that the method for drawing large and small route plan operation diagrams provided by the present invention can be applied to the scenario in which rail transit equipment draws operation diagrams in large and small route modes, and the executor of the method may be a device for drawing large and small route plan operation diagrams, such as an electronic device, or a control module in the device for drawing large and small route plan operation diagrams for executing the method for drawing large and small route plan operation diagrams.

[0036] Figure 2 It is a schematic diagram of the large and small cross-path mode provided by the present invention, such as Figure 2 As shown, S is the station set, S={S i |i=1,2,...,n}, at the starting and ending points of the line (S1-S n ) are used to operate large-scale trains that run through the entire line. S1 represents the starting station of the large-scale train, S n Indicates the terminal station of a large route; in the area with large passenger flow (S a -S b ) Run short-distance trains, S a Indicates the starting station of the short route, S b Indicates the terminal station of the small route. Generally, the large route runs the entire route, and the starting and ending points of the small route are generally stations with turning conditions in the middle, or one of them can be the starting station or terminal station of the large route. The up and down lines of the large and small routes are recorded as r=1,2,3 or 4 respectively, among which r=1 or 2 represents the down and up lines of the large route, and r=3 or 4 represents the down and up lines of the small route. The operating ratio of the large route and the small route is 1:N or N:1. For example, the large-small ratio is 1:2, that is, after a large-route train is dispatched from the platform of a small-route station, the two subsequent trains are small-route trains, and then a large-route train is dispatched, and this cycle repeats.

[0037] Running time t of uplink and downlink lines of large and small routes r It refers to the visual distance of the train running from the starting point to the end point of the up and down lines r of the large and small intersections, t r The calculation method is to accumulate the stop time t of the passing stations i,停 and the running time between two stations tj,k The sum of is expressed by formula (1).

[0038] (1) The total running time t of the large and small routes 大 and t 小 Refers to the time required for a large and small route to complete a complete operation. The total operation time of the large and small routes is the sum of the down-running time, up-running time and the return time of the return station on the large and small routes. Among them, the total operation time of the large route is t 大 Using formula (2), the total running time of the small route is t 小 It is expressed by formula (3).

[0039] (2) (3) Among them, t 1 represents the downlink running time of the large route, t 2 represents the uplink running time of the large route, x 1,折 represents the turnaround time of station 1 on the major route, x n,折 represents the turnaround time of the turnaround station n on the large-scale route, t 3 represents the downlink running time of the small route, t 4 represents the uplink running time of the small route, x a,折 represents the return time of the turnaround station a on the short-distance route, x b,折 Indicates the return time at the turnaround station b on the short route.

[0040] It should be noted that x 1,折 、x n,折 、x a,折 and x b,折 is a variable, which must be greater than the shortest return time t of the return station m,折 , that is, x m,折 ≥t m,折 , where m=1,n,a or b.

[0041] The objective function indicates that the number of vehicle bottoms required is the minimum when the total running time of the large and small routes is the shortest. The objective function is expressed by formula (4), where Z represents the number of vehicle bottoms.

[0042] (4) It should be noted that on the large and small routes, the downlink running time and the uplink running time are fixed, while x 1,折 、x n,折 、x a,折 and x b,折 is a variable, that is, x m,折 is a variable, when xm,折 When the minimum value is reached, the total running time of the large and small routes will be the shortest. According to the tracking time interval on the large and small routes, the number of car bottoms required on the large and small routes is the least at this time; among them, the number of car bottoms represents the number of trains running on the large and small routes.

[0043] Step 102: Based on the objective function, determine the minimum turnaround time of the turnaround station on the large and small routes.

[0044] Specifically, according to the constructed objective function, the objective function can be solved to determine the minimum turnaround time of the turnaround station on the large and small routes.

[0045] Step 103: based on the minimum turning time and the number of vehicle bottoms on the preset large and small intersections, draw a large and small intersection operation diagram.

[0046] Specifically, based on the minimum reversal time of the reversal station on the determined large and small routes and the preset number of car bottoms, the large and small route operation diagram can be drawn; wherein the preset number of car bottoms represents the minimum number of trains expected to run on the large and small routes.

[0047] The method for drawing the operation diagram of the large and small routes provided by the present invention constructs an objective function based on the total operation time of the large and small routes; the total operation time of the large and small routes is the sum of the down-running time, the up-running time and the reversing time of the reversing station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total operation time of the large and small routes is the shortest; based on the objective function, the minimum reversing time of the reversing station on the large and small routes is determined; based on the minimum reversing time and the preset number of car bottoms on the large and small routes, the large and small route operation diagram is compiled. Through the objective function, the minimum reversing time of the reversing station on the large and small routes is determined, and then based on the minimum reversing time, the large and small route operation diagram with uniform spacing and consistent reversing time that meets the operation requirements can be drawn, and the intersection conflict of trains on different routes can be avoided, thereby reducing the complexity of drawing the large and small route operation diagram and improving the drawing efficiency.

[0048] Optionally, a specific implementation of step 101 includes: Based on the total operating time of the large and small routes, the operating ratio of the large and small routes, and the tracking interval time on the small route, constraints are set; based on the constraints and the return time, the objective function is constructed.

[0049] Specifically, the constraint condition is that the total running time of the large route should be y times the running time of the small route or the total running time of the small route should be z times the interval time; the constraint condition is expressed by formula (5) or formula (6).

[0050] (5) (6) Among them, y is an integer variable, y≥1; z is an integer variable, z≥1, and 1:N represents the operating ratio of large and small routes.

[0051] The turnaround time x of the turnaround station based on the constraints and the large and small routes m,折 , the objective function can be constructed as shown in the above formula (4).

[0052] Optionally, a specific implementation of step 102 includes: Step A: Initialize the return time based on the objective function.

[0053] Specifically, based on the objective function, the return time x can be initialized m,折 , that is, let x m,折 =t m,折 , so that the minimum return time is minimized.

[0054] Step B: Determine whether the return time after initialization satisfies the constraint condition.

[0055] Specifically, the return time x after initialization m,折 Substitute the constraints expressed by the above formulas (5) and (6) to determine whether the constraints are met. If the return time after initialization meets the constraints, the values ​​of y and z can be calculated and the process ends.

[0056] Step C: When the return time after initialization does not satisfy the constraint condition, determine the first return time based on the preset step size and the return time after initialization, and determine the first return time as the return time after initialization, and repeat steps B-C until the return time after initialization satisfies the constraint condition.

[0057] Specifically, when the return time after initialization does not meet the constraint condition, based on the preset step size and the return time after initialization x m,折 For example, with 1 second as the preset step length, the initialization return time x m,折 +1 is determined as the first return time, and the first return time is determined as the return time after initialization, that is, x m,折 +1 is assigned to x m,折 , repeat step B-step C until the return time after initialization meets the constraint condition.

[0058] Step D: Determine the initialized turnaround time that meets the constraint conditions as the minimum turnaround time of the turnaround stations on the large and small routes.

[0059] Specifically, the initialized turnaround time that meets the constraint conditions is determined as the final turnaround time, and the final turnaround time is determined as the minimum turnaround time of the turnaround stations on the large and small routes.

[0060] Optionally, the specific implementation of step 103 includes: Based on the minimum turnaround time, the number of trains running on the large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the large and small route operation diagram is drawn.

[0061] Specifically, based on the minimum turnaround time of the turnaround station on the large and small routes, the operation ratio of the large and small routes (1:N), and the tracking interval time T on the small route, interval , Operation start time T s and operation end time T e , draw up operation diagrams for large and small routes.

[0062] Optionally, drawing the large and small route operation diagram based on the minimum turnaround time, the number of trains running on the large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time includes: Step E: For each round of route planning of large and small routes, the operating line of the large route is planned based on the minimum turnaround time of the turnaround station on the large route, the operating ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time.

[0063] Specifically, for each round of route planning for large and small routes, the minimum turnaround time (e.g., x 1,折 、x n,折 ), the operating ratio of large and small routes (1:N), the tracking interval time T on the small route interval , Operation start time T s and operation end time T e , and the running lines of major routes can be paved.

[0064] For example, define variable o=0, that is, when the first round of large and small routes are laid out, the departure time of the first large route is T s +o×(1+N)×T interval , that is, the departure time of the first major route is T s , the minimum return time at the return station on the large-scale transportation route is x 1,折 and x n,折 , then we can calculate the minimum return time (x) of the return station on the first major route according to the departure time of the first major route and the minimum return time (x) of the return station on the major route. 1,折 and x n,折), lay out the operation line of the first large loop until the end of the operation T e .

[0065] Step F: For each small loop after the large loop, based on the minimum turnaround time of the turnaround station on the small loop, the operation ratio of the large and small loops, the tracking interval time on the small loop, the operation start time, and the operation end time, lay out the operation line of the small loop.

[0066] Specifically, for each small loop after the large loop, based on the minimum turnaround time of the turnaround station on the small loop (e.g., x a,折 , x b,折 ), the operation ratio of the large and small loops (1:N), the tracking interval time T interval on the small loop, the operation start time T s , and the operation end time T e , the operation line of the small loop can be laid out.

[0067] For example, the departure time for each small loop after the large loop is T s + o×(1 + N)×T interval + p×T interval , where the value range of p is from 1 to N. When o = 0 and p = 1, the departure time of the first small loop is T s + T interval , the minimum turnaround time of the turnaround station on the small loop is x a,折 and x b,折 , then the operation line of the first small loop can be laid out according to the departure time of the first small loop and the minimum turnaround time of the turnaround station on the small loop (x a,折 and x b,折 ) until the end of the operation T e . For each small loop after the first small loop, the value of p is incremented by 1 in sequence. According to the layout process of the first small loop, the operation lines of each small loop after the first small loop can be laid out in sequence until the end of the operation T e .

[0068] Step G: Determine whether the layout of the lines of the large and small loops in the current round meets the preset conditions; the preset conditions indicate whether the layout of the lines of the large and small loops in the current round is less than the preset number of car bodies on the small loop.

[0069] Specifically, the preset conditions indicate whether the layout of the lines of the large and small loops in the current round is less than the preset number of car bodies on the small loop, and the preset conditions are expressed as o < z, where z represents the preset number of car bodies on the small loop. After each round of layout, assign o + 1 to o, and determine whether o satisfies o < z, that is, determine whether all the trains on the small loops have been laid out.

[0070] Step H: When the line layout of the current round of large and small loops meets the preset conditions, repeat steps E - H until the line layout of the current round of large and small loops does not meet the preset conditions. Based on the running lines of the small loop and the large loop that have been completed in layout, draw the operation diagram of the large and small loops.

[0071] Specifically, when the line layout of the current round of large and small loops meets the preset conditions, that is, when the train layout on all small loops is not completed, that is, o satisfies o < z, repeat steps E - H until the line layout of the current round of large and small loops does not meet the preset conditions, that is, o ≥ z. Then, based on the running lines of the small loop and the large loop that have been completed in layout, draw the operation diagram of the large and small loops.

[0072] Optionally, when the number of running lines that have been completed in layout on the large loop is less than the number of running lines that have been completed in layout on the small loop, the method further includes: When the line layout of the current round of large and small loops does not meet the preset conditions, supplement and draw the running lines of the large loop based on the large - loop tracking interval time within the target time period.

[0073] Specifically, when the line layout of the current round of large and small loops does not meet the preset conditions and the number of running lines that have been completed in layout on the large loop is less than the number of running lines that have been completed in layout on the small loop, it indicates that the train layout of all small loops is completed, but the line layout of the large loop is not completed within the target time period. The target time period is T s + z×(1 + N)×T interval to T s + t 大 , and the target time period is the time interval between the end time of a small loop running one lap and the start time of the next large loop running one lap. Then, the running lines of the large loop can be supplemented and drawn at intervals of the large - loop tracking interval time (1 + N)×T interval interval until the operation ends at T e .

[0074] Finally, after the running lines of the large and small loops are completed in layout, set the on - line car body and off - line train numbers for the running lines of the large and small loops, so that the operation diagram of the large and small loops is completed in layout.

[0075] Figure 3 is the second flow chart of the method for drawing the operation diagram of the large and small loop plan provided by the present invention. As Figure 3 shown, the method includes step 301 - step 312.

[0076] Step 301: Calculate the total running time of the large and small loops.

[0077] Step 302: Set constraint conditions. Set constraint conditions based on the total running time of the large and small routes, the operating ratio of the large and small routes, and the tracking interval time on the small routes.

[0078] Step 303: Construct an objective function. Construct an objective function based on the constraint conditions and the return time.

[0079] Step 304: Initialize the return time based on the objective function.

[0080] Step 305: Determine whether the return time after initialization meets the constraint condition. If the return time after initialization does not meet the constraint condition, go to step 306; if the return time after initialization meets the constraint condition, go to step 307.

[0081] Step 306: Determine a first return time based on the preset step size and the return time after initialization, and determine the first return time as the return time after initialization.

[0082] Step 307: Determine the initialized turnaround time that meets the constraint conditions as the minimum turnaround time of the turnaround stations on the large and small routes.

[0083] Step 308: for each round of route planning of large and small routes, the operation line of the large route is planned based on the minimum turnaround time of the turnaround station on the large route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time.

[0084] Step 309, for each small route after the large route, the operation line of the small route is laid out based on the minimum turnaround time of the turnaround station on the small route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time.

[0085] Step 310, determine whether the line layout of the current wheel large and small intersection meets the preset condition; the preset condition indicates whether the line layout of the current wheel large and small intersection is less than the number of vehicle bottoms on the preset small intersection. If the line layout of the current wheel large and small intersection meets the preset condition, go to step 308; if the line layout of the current wheel large and small intersection does not meet the preset condition, go to step 311.

[0086] Step 311, based on the running lines of the small and large routes that have been drawn, draw running diagrams of the small and large routes; Step 312, when the number of running lines that have been completed on the large route is less than the number of running lines that have been completed on the small route, additional running lines of the large route are laid out within the target time period based on the large route tracking interval.

[0087] The method provided by the present invention can, when the number of car bottoms on large and small routes meets the operating ratio of large routes and small routes, lay out large and small route operating diagrams with uniform spacing and consistent turning time based on the minimum turning time, which meet the operating requirements, and avoid dealing with crossing conflicts of trains on different routes, thereby reducing the complexity of laying out large and small route operating diagrams and improving the laying efficiency.

[0088] The present invention uses the data of a certain city's subway Line 1 for paving. Subway Line 1 starts from Station 1 and has a total of 30 stations. The line is in the upward direction from Station 1 to Station 30, and the train operation route is a large and small route. A small route is operated from Station 1 to Station 13, and a large route is operated from Station 1 to Station 30. The upward operation time of the large route is 64 minutes and 19 seconds, and the downward operation time is 64 minutes and 37 seconds. The upward operation time of the small route is 30 minutes and 26 seconds, and the downward operation time is 30 minutes and 28 seconds. The shortest return time at Station 1 is 120 seconds, the shortest return time at Station 13 is 180 seconds, and the shortest return time at Station 30 is 180s. It is planned to prepare an operation diagram with a large and small route ratio of 1:1, requiring a tracking interval of 4 minutes on the small route.

[0089] According to the method provided by the present invention, it is calculated that the return time of the large route at station 1 is 131 seconds, and the return time at station 30 is 180 seconds; the return time of the small route at station 1 is 160 seconds, and the return time at station 13 is 209 seconds. Figure 4 It is one of the schematic diagrams of the large and small route operation diagram provided by the present invention, such as Figure 4 As shown, the total running time of a large route is about 2 hours, and the running time of a small route is about 1 hour. Therefore, when a large route runs one circle, a small route runs two circles. The number of trains running on the small route is half of the number of trains running on the large route. However, since the ratio of large and small routes is 1:1, the number of trains running on the large route is not enough. Therefore, in the large and small route operation diagram, from 6:10 to 7:10, there is only the running line of the small route (i.e. the short line between Station 1 and Station 13), but no running line of the large route (i.e. the long line between Station 1 and Station 30). Figure 5 It is a schematic diagram of the large and small intersection operation diagram provided by the present invention for supplementing the operation line of the large intersection, such as Figure 5 As shown, it is for Figure 4 There are no running lines for major routes, so additional running lines for major routes are added (3 additional running lines for major routes are added). Figure 6 This is the second schematic diagram of the large and small route operation diagram provided by the present invention, such as Figure 6 As shown, at 4:51, the vehicle bottom line is arranged for the first large route (the first black solid line), and at 4:55, the vehicle bottom line is arranged for the small route after the first large route (the first black dotted line). The vehicle bottom line and the vehicle bottom line are arranged for each large route and small route in turn to complete the drawing of the large and small route operation diagrams.

[0090] The following is a description of the device for drawing large and small route plan operation diagrams provided by the present invention. The device for drawing large and small route plan operation diagrams described below and the method for drawing large and small route plan operation diagrams described above can be referenced to each other.

[0091] Figure 7 Schematic diagram of the structure of the device for drawing the large and small route plan operation diagram provided by the present invention, such as Figure 7 As shown, the large and small route plan operation diagram laying device 700 includes: a construction module 701, a determination module 702 and a laying module 703; wherein, A construction module 701 is used to construct an objective function based on the total running time of the large and small routes; the total running time of the large and small routes is the sum of the down-running time, the up-running time and the turnaround time of the turnaround station on the large and small routes; the objective function indicates that the number of vehicle bottoms required is the least when the total running time of the large and small routes is the shortest; A determination module 702, for determining the minimum turnaround time of the turnaround station on the large and small routes based on the objective function; The drawing module 703 is used to draw the large and small intersection operation diagram based on the minimum return time and the number of vehicle bottoms on the preset large and small intersections.

[0092] The device for drawing the planned operation diagram of large and small routes provided by the present invention constructs an objective function based on the total operation time of large and small routes; the total operation time of large and small routes is the sum of the down-running time, the up-running time and the reversing time of the reversing station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total operation time of the large and small routes is the shortest; based on the objective function, the minimum reversing time of the reversing station on the large and small routes is determined; based on the minimum reversing time and the preset number of car bottoms on the large and small routes, the large and small route operation diagram is drawn. The minimum reversing time of the reversing station on the large and small routes determined by the objective function and the preset number of car bottoms on the large and small routes can draw the large and small route operation diagram with uniform spacing and consistent reversing time that meets the operation requirements, and avoids handling the intersection conflict of trains on different routes, reduces the complexity of drawing the large and small route operation diagram, and improves the drawing efficiency.

[0093] Optionally, the construction module 701 is specifically used to: Setting constraints based on the total running time of the large and small routes, the operating ratio of the large and small routes, and the tracking interval time on the small routes; Based on the constraint conditions and the return time, the objective function is constructed.

[0094] Optionally, the determining module 702 is specifically configured to: Step A: Initializing the return time based on the objective function; Step B: Determine whether the return time after initialization meets the constraint condition; Step C: when the return time after the initialization does not meet the constraint condition, determine a first return time based on a preset step size and the return time after the initialization, and determine the first return time as the return time after the initialization, and repeat steps B to C until the return time after the initialization meets the constraint condition; Step D: Determine the initialized turnaround time that meets the constraint conditions as the minimum turnaround time of the turnaround station on the large and small routes.

[0095] Optionally, the painting module 703 is specifically used to: Based on the minimum turnaround time, the number of vehicle bottoms on the preset large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the large and small routes operation diagram is drawn.

[0096] Optionally, the painting module 703 is further used for: Step E: for each round of route planning of large and small routes, based on the minimum turnaround time of the turnaround station on the large route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the large route is planned; Step F: for each small route after the large route, based on the minimum turnaround time of the turnaround station on the small route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the small route is laid out; Step G: Determine whether the line layout of the current wheel large and small intersection meets the preset condition; the preset condition indicates whether the line layout of the current wheel large and small intersection is less than the number of vehicle bottoms on the preset small intersection; Step H: When the line drawing of the current round of large and small intersections meets the preset conditions, repeat steps EH until the line drawing of the current round of large and small intersections does not meet the preset conditions, and draw the large and small intersection operation diagram based on the running lines of the small intersections and the large intersections that have been completed.

[0097] Optionally, when the number of running lines that have been paved on the large route is less than the number of running lines that have been paved on the small route, the large and small route planned running diagram paving device 700 further includes: The supplementing module is used to supplement the running line of the large route based on the tracking interval time of the large route within the target time period when the line laying of the current round of large and small routes does not meet the preset conditions.

[0098] Figure 8 is a schematic diagram of the physical structure of an electronic device provided by the present invention, such as Figure 8 As shown, the electronic device 800 may include: a processor 810, a communication interface 820, a memory 830 and a communication bus 840, wherein the processor 810, the communication interface 820 and the memory 830 communicate with each other through the communication bus 840. The processor 810 may call the logic instructions in the memory 830 to execute the method for drawing the operation diagram of the large and small routes, the method comprising: constructing an objective function based on the total operation time of the large and small routes; the total operation time of the large and small routes is the sum of the down-running time, the up-running time and the turnaround time of the turnaround station on the large and small routes; the objective function indicates that the number of car bottoms required when the total operation time of the large and small routes is the shortest; based on the objective function, determining the minimum turnaround time of the turnaround station on the large and small routes; based on the minimum turnaround time and the preset number of car bottoms on the large and small routes, drawing the operation diagram of the large and small routes.

[0099] In addition, the logic instructions in the above-mentioned memory 830 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0100] On the other hand, the present invention also provides a computer program product, which includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the method for drawing a planned operation diagram of large and small routes provided by the above-mentioned methods, and the method includes: constructing an objective function based on the total running time of large and small routes; the total running time of large and small routes is the sum of the downlink running time, the uplink running time and the turning time of the turning station on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total running time of the large and small routes is the shortest; based on the objective function, the minimum turning time of the turning station on the large and small routes is determined; based on the minimum turning time, the large and small routes The operation diagram is drawn.

[0101] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the method for drawing a planned operation diagram of large and small routes provided by the above-mentioned methods, the method comprising: constructing an objective function based on the total operating time of the large and small routes; the total operating time of the large and small routes is the sum of the downlink operating time, the uplink operating time and the turning time of the turning stations on the large and small routes; the objective function indicates that the number of car bottoms required is the least when the total operating time of the large and small routes is the shortest; based on the objective function, the minimum turning time of the turning station on the large and small routes is determined; based on the minimum turning time, the large and small routes operation diagram is drawn.

[0102] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0103] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0104] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for drawing a large and small route plan operation diagram, characterized in that: include: Construct the objective function based on the total running time of large and small intersections; The total running time of the large and small routes is the sum of the down running time, up running time and the turnaround time of the turnaround station on the large and small routes; The objective function indicates that the number of vehicle bottoms required is the minimum when the total running time of the large and small routes is the shortest; Based on the objective function, determining the minimum turnaround time of the turnaround station on the large and small routes; Based on the minimum turning time and the number of vehicle bottoms on the preset large and small routes, a large and small route operation diagram is drawn.

2. The method for drawing a large and small route plan operation diagram according to claim 1, characterized in that: The objective function is constructed based on the total running time of the large and small intersections, including: Setting constraints based on the total running time of the large and small routes, the operating ratio of the large and small routes, and the tracking interval time on the small routes; Based on the constraint conditions and the return time, the objective function is constructed.

3. The method for drawing a large and small route plan operation diagram according to claim 2, characterized in that: Determining the minimum turnaround time of the turnaround station on the large and small routes based on the objective function includes: Step A: Initializing the return time based on the objective function; Step B: Determine whether the return time after initialization meets the constraint condition; Step C: when the return time after the initialization does not meet the constraint condition, determine a first return time based on a preset step size and the return time after the initialization, and determine the first return time as the return time after the initialization, and repeat steps B to C until the return time after the initialization meets the constraint condition; Step D: Determine the initialized turnaround time that meets the constraint conditions as the minimum turnaround time of the turnaround station on the large and small routes.

4. The method for drawing a large and small route plan operation diagram according to claim 2, characterized in that: The drawing of the large and small intersection operation diagram based on the minimum turnaround time and the number of vehicle bottoms on the preset large and small intersections includes: Based on the minimum turnaround time, the number of vehicle bottoms on the preset large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the large and small routes operation diagram is drawn.

5. The method for drawing a large and small route plan operation diagram according to claim 4, characterized in that: The drawing of the large and small route operation diagram based on the minimum return time, the number of vehicle bottoms on the preset large and small routes, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time includes: Step E: for each round of route planning of large and small routes, based on the minimum turnaround time of the turnaround station on the large route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the large route is planned; Step F: for each small route after the large route, based on the minimum turnaround time of the turnaround station on the small route, the operation ratio of the large and small routes, the tracking interval time on the small route, the operation start time and the operation end time, the operation line of the small route is laid out; Step G: Determine whether the line layout of the current wheel large and small intersection meets the preset condition; the preset condition indicates whether the line layout of the current wheel large and small intersection is less than the number of vehicle bottoms on the preset small intersection; Step H: When the line drawing of the current round of large and small intersections meets the preset conditions, repeat steps EH until the line drawing of the current round of large and small intersections does not meet the preset conditions, and draw the large and small intersection operation diagram based on the running lines of the small intersections and the large intersections that have been completed.

6. The method for drawing a large and small route plan operation diagram according to claim 5, characterized in that: In the case that the number of running lines that have been paved on the large road is less than the number of running lines that have been paved on the small road, the method further includes: When the line laying of the current round of large and small routes does not meet the preset conditions, the running line of the large route is supplemented within the target time period based on the tracking interval of the large route.

7. A device for drawing a large and small route plan operation diagram, characterized in that: include: A construction module is used to construct an objective function based on the total running time of large and small intersections; The total running time of the large and small routes is the sum of the down running time, up running time and the turnaround time of the turnaround station on the large and small routes; The objective function indicates that the number of vehicle bottoms required is the minimum when the total running time of the large and small routes is the shortest; A determination module, used for determining the minimum turnaround time of the turnaround station on the large and small routes based on the objective function; The drawing module is used to draw the large and small intersection operation diagram based on the minimum return time and the number of vehicle bottoms on the preset large and small intersections.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method for drawing a large and small route plan operation diagram as described in any one of claims 1 to 6 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for drawing a large and small route plan operation diagram as described in any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method for drawing a large and small route plan operation diagram as described in any one of claims 1 to 6 is implemented.

Images