Train operation diagram compilation method, device, equipment and storage medium

Abstract

The embodiments of the present disclosure provide a method, apparatus, device, and storage medium for compiling a train timetable. Applied to the field of rail transit technology, the method includes generating off-peak period operating lines and peak period operating lines based on off-peak period departure intervals and peak period departure intervals, respectively; for the transition period between off-peak and peak periods, using a preset line drawing algorithm to periodically draw lines from the preset lines in the direction of transition from peak period to off-peak period, and adjusting the lines within each line drawing cycle at equal intervals to obtain the lines for the transition period between off-peak and peak periods, wherein the preset lines are generated according to the peak period departure intervals; and based on the lines for each period throughout the day, the vehicle bottoms are allocated to generate a full-day planned timetable. In this way, the automatic compilation of the train timetable and the balanced transition between off-peak and peak periods of the train can be achieved.

Description

Technical Field

[0001] The present disclosure relates to the field of rail transit technology, and in particular to a method, apparatus, device, and storage medium for compiling a train operation diagram. Background Art

[0002] With the acceleration of urbanization, rail transit, as a vital component of urban transportation, is experiencing rapid development. Efficient rail transit operation is crucial for alleviating urban traffic pressure and improving travel efficiency for citizens. The timetable is the plan and instructions for train operations within the rail transit system, determining departure times, operating speeds, stops, and intervals between trains. The transition between peak and off-peak hours in the timetable is a crucial step in its development. The transition period between peak and off-peak hours refers to the period between morning and evening peak hours, when passenger flow experiences significant fluctuations. During this transition period, passenger experience must be considered, preventing abrupt reductions in service frequency. Furthermore, train arrival and departure times must be appropriately selected based on the depot's capacity for receiving trains and the line's turnaround conditions. The development and optimization of timetables for the transition period between peak and off-peak hours has always been a major pain point and challenge in the process. Summary of the Invention

[0003] The present disclosure provides a train operation diagram compilation method, apparatus, device and storage medium.

[0004] According to a first aspect of the present disclosure, a method for compiling a train diagram is provided. The method comprises:

[0005] Generate off-peak period operation lines and peak period operation lines based on off-peak period departure intervals and peak period departure intervals respectively;

[0006] During the transition period between peak and flat periods, a preset line extraction algorithm is used to periodically extract lines from the preset operating lines in the direction of transition from peak period to flat period, and the operating lines within each line extraction cycle are adjusted at equal intervals to obtain the operating lines for the transition period between peak and flat periods. The preset operating lines are generated according to the departure intervals during the peak period.

[0007] Carriage bases are allocated based on the operating lines at various times of the day to generate a full-day planned operation diagram.

[0008] According to the above aspects and any possible implementation, a further implementation is provided, wherein during the flat-peak transition period, a preset line extraction algorithm is used to periodically extract the preset operating line in the transition direction from the peak period to the flat-peak period, including:

[0009] Determine the total number of lines required for the transition period between peak and off-peak periods based on the full turnaround time, off-peak intervals, and peak intervals;

[0010] For the transition period from peak period to flat period, the preset line drawing algorithm is used to draw lines in the direction from peak period to flat period.

[0011] For the flat-peak transition period from the flat-peak period to the peak period, a preset line drawing algorithm is used to draw lines in the reverse direction from the peak period to the flat-peak period.

[0012] According to the above aspects and any possible implementation, a further implementation is provided, wherein the operating line in each line extraction cycle is adjusted at equal intervals to obtain the operating line during the flat-peak transition period, including:

[0013] According to the transition direction from peak period to flat period, the remaining running lines after line extraction in each line extraction cycle are adjusted at equal intervals;

[0014] For the last running line with the smallest interval with the running line during the off-peak period in the last line extraction cycle, if the minimum interval between the last running line and the running line during the off-peak period is less than 1 / 2 of the departure interval during the off-peak period, the last running line will be deleted.

[0015] According to the above aspects and any possible implementation, a further implementation is provided, which determines the total number of lines required for the transition period between off-peak and peak periods based on the full turnaround time, the off-peak period departure interval, and the peak period departure interval, including:

[0016] When the vehicle runs on a single route, the total number of lanes G required during the transition period between peak and off-peak hours is calculated according to the following formula:

[0017] G=T / h1-T / h2

[0018] Where T is the total turnaround time of a vehicle operating on a single route, h1 is the departure interval during peak hours, and h2 is the departure interval during off-peak hours;

[0019] When there are large and small intersections in vehicle operation, the total number of line extractions G required during the transition period between peak and flat seasons is calculated according to the following formula:

[0020] G=T 大 / h 1大 +T 小 / h 1小 -T 大 / h 2大 -T 小 / h 2小 ,

[0021] Among them, T 大 T is the total turnover time of the vehicle running along the main route, 小 is the total turnover time of the vehicle operating on the small route, h 1大 is the average departure interval of vehicles running on large routes during peak hours, h1小 is the average departure interval of vehicles running on small routes during peak hours, h 2大 is the average departure interval of vehicles running on large routes during off-peak period, h 2小 , is the average departure interval of vehicles running on small routes during off-peak period;

[0022] The method also includes:

[0023] When there are large and small intersections in vehicle operation, each running line corresponding to the small intersection is shortened according to the preset ratio of the running lines of the large intersection and the small intersection.

[0024] According to the above aspects and any possible implementation, a further implementation is provided, which allocates vehicles based on the operation lines in various periods throughout the day to generate a full-day planned operation diagram, including:

[0025] The objective functions of vehicle-undercarriage linkage are determined for the outbound and return periods and the transition period between peak and flat seasons, and an integer programming model is constructed. The outbound and return periods are the periods when trains on the morning peak season line leave the depot and return to the section after operation.

[0026] The integer programming model is solved to obtain a full-day planned operation diagram with balanced transition between peak and flat times from the start to the end of train operation.

[0027] In accordance with the above aspects and any possible implementation, a further implementation is provided, wherein objective functions for vehicle-under-carriage linkage are determined for the outbound and return periods, and the peak-offset transition period, respectively, and an integer programming model is constructed, including:

[0028] For the outbound and return periods, the objective function is determined with the goal of minimizing the idle time of the vehicle during outbound or return periods.

[0029] For the transition period between flat and peak hours, a dual objective function is determined with the goal of minimizing the total connection time and minimizing the operating line deviation.

[0030] As described above, in terms of aspects and any possible implementation methods, an implementation method is further provided, wherein the constraints of the objective function include vehicle bottom uniqueness constraint, return time constraint, vehicle bottom usage mode constraint, operating line translation constraint, and vehicle storage quantity constraint in the yard.

[0031] According to a second aspect of the present disclosure, a train diagram compilation device is provided. The device comprises:

[0032] An operation line generation module is used to generate an off-peak operation line and a peak operation line based on the off-peak departure interval and the peak departure interval respectively;

[0033] The operating line adjustment module is used to periodically extract the preset operating lines according to the transition direction from peak period to flat period using a preset line extraction algorithm during the flat-peak period, and to adjust the operating lines within each line extraction cycle at equal intervals to obtain the operating lines for the flat-peak period. The preset operating lines are generated according to the departure intervals during the peak period.

[0034] The operation diagram generation module is used to allocate vehicles based on the operation lines in various periods of the day and generate a full-day planned operation diagram.

[0035] According to a third aspect of the present disclosure, an electronic device is provided, comprising: a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the above method when executing the program.

[0036] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the program is executed by a processor, the method according to the first aspect of the present disclosure is implemented.

[0037] The present invention realizes automatic laying of operating lines during the transition period from peak period to off-peak period by periodically drawing lines and adjusting each drawing line cycle at equal intervals according to the transition direction from peak period to off-peak period, and obtains the train's full-day planned operation diagram based on the vehicle bottom distribution based on the operating lines throughout the day. It can realize automatic compilation of train operation and achieve balanced transition between off-peak and off-peak periods of the train.

[0038] It should be understood that the contents described in the Summary of the Invention section are not intended to limit the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. The accompanying drawings are provided for a better understanding of the present disclosure and do not constitute a limitation of the present disclosure. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, among which:

[0040] Figure 1 A flow chart of a method for compiling a train diagram according to an embodiment of the present disclosure is shown;

[0041] Figure 2 A schematic diagram of a forward line drawing during the transition from a peak period to a flat period according to an embodiment of the present disclosure is shown;

[0042] Figure 3 A schematic diagram of reverse line extraction from a flat-peak period to a peak period according to an embodiment of the present disclosure is shown;

[0043] Figure 4A schematic diagram of a running line layout of a vehicle running on a large and small intersection according to an embodiment of the present disclosure is shown;

[0044] Figure 5 A block diagram of a train diagram compiling apparatus according to an embodiment of the present disclosure is shown;

[0045] Figure 6 A block diagram of an exemplary electronic device capable of implementing embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0046] To make the purpose, technical solutions, and advantages of the embodiments of the present disclosure more clear, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without making any creative efforts are within the scope of protection of the present disclosure.

[0047] In this document, the term "and / or" simply describes a relationship between related objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " in this document generally indicates that the related objects are in an "or" relationship.

[0048] In this disclosure, by periodically drawing lines according to the transition direction from peak to off-peak periods and adjusting the intervals between each drawing cycle, automatic layout of running lines during the off-peak to off-peak transition period is achieved. Car bottom allocation is performed based on the running lines throughout the day, resulting in a daily planned train operation diagram. This enables automatic compilation of train operations and achieves a balanced transition between off-peak and off-peak periods.

[0049] Figure 1 A flow chart of a train diagram compilation method 100 according to an embodiment of the present disclosure is shown.

[0050] The method 100 comprises the following steps:

[0051] Step S110, generating an off-peak period operation line and a peak period operation line based on the off-peak period departure interval and the peak period departure interval respectively;

[0052] Step S120: During the transition period from peak to flat-peak traffic, a preset route extraction algorithm is used to periodically extract routes from the preset operating routes in the direction of the transition from peak to flat-peak traffic. The operating routes within each extraction cycle are adjusted at equal intervals to obtain the operating routes for the transition period from peak to flat-peak traffic. The preset operating routes are generated based on the peak-hour departure intervals.

[0053] Step S130 , performing vehicle allocation based on the operation lines of each period throughout the day, and generating a full-day planned operation diagram.

[0054] In some embodiments, in step S120, for the flat-peak transition period, a preset line extraction algorithm is used to periodically extract the preset running line according to the transition direction from the peak period to the flat-peak period, including:

[0055] Determine the total number of lines required for the transition period between peak and off-peak periods based on the full turnaround time, off-peak intervals, and peak intervals;

[0056] For the transition period from peak period to flat period, the preset line drawing algorithm is used to draw lines in the direction from peak period to flat period.

[0057] For the flat-peak transition period from the flat-peak period to the peak period, a preset line drawing algorithm is used to draw lines in the reverse direction from the peak period to the flat-peak period.

[0058] The setting of the preset line extraction algorithm needs to consider multiple factors to ensure that the rail transit system transitions smoothly between peak and off-peak periods.

[0059] Optionally, the preset thread extraction algorithm may determine the thread extraction cycle and the number of running threads that need to be reduced in each thread extraction cycle according to the number of threads extracted and the duration of the transition period.

[0060] Optionally, the preset line extraction algorithm includes:

[0061] Construct the line extraction ratio matrix A, where the elements in the Mth row and Nth column of the line extraction ratio matrix A are M and N are both positive integers;

[0062] like And N=1, then according to the transition direction from peak period to flat peak period, the target element Corresponding wire extraction ratio M a :N a Periodically draw lines from the preset running lines, where h1 is the departure interval during peak hours, h2 is the departure interval during off-peak hours, and the line drawing ratio M is a :N a Indicates that in each line extraction cycle, a Delete N from the running lines a running lines;

[0063] like If N>1, then according to the transition direction from peak period to flat period, the first target element Corresponding wire extraction ratio M b :N b and the second target element Corresponding wire extraction ratio (Mb -1):(N b -1), periodically draw the line from the preset running line;

[0064] like Then As the objective function, Solve the constraints and follow the transition direction from peak period to flat period to solve the third target element in the result. Corresponding wire extraction ratio M c :N c Perform x1 cycles of line extraction to solve the fourth target element in the result Corresponding wire extraction ratio M d :N d Perform x2 cycles of line extraction, where G represents the total number of line extractions required during the flat-peak transition period, and N represents the total number of line extractions required during the flat-peak transition period. * represents a positive integer, t Depot Indicates the time required for a vehicle to return to the depot after the operation ends.

[0065] According to an embodiment of the present disclosure, a specific line-drawing method for reducing the number of operating lines is provided. By presetting a line-drawing algorithm, the number of operating lines can be reduced as evenly as possible in each line-drawing cycle to maintain the continuity and stability of train services.

[0066] In some embodiments, in step S120, the operating line in each line extraction cycle is adjusted at equal intervals to obtain the operating line in the flat-peak transition period, including:

[0067] According to the transition direction from peak period to flat period, the remaining running lines after line extraction in each line extraction cycle are adjusted at equal intervals;

[0068] For the last running line with the smallest interval with the running line during the off-peak period in the last line extraction cycle, if the minimum interval between the last running line and the running line during the off-peak period is less than 1 / 2 of the departure interval during the off-peak period, the last running line will be deleted.

[0069] For example, in any M:N cycle, after deleting N running lines, the remaining (MN-1) trains need to be adjusted at equal intervals.

[0070] From peak period to flat period, small scale should be laid out first, then large scale. Starting from the peak end time t0, select the number of small scale line drawing beats After x1 and x2 are completed, the last train will enter the flat-peak period according to h2, completing the transition from high to flat peak.

[0071] The transition from flat peak to peak is the reverse process from peak to flat peak. It is necessary to lay out the running line from the peak period in reverse order. After completing the transition of x1 and x2, if the interval between the current train and the next flat peak period preset train is less than The last train of the last proportional interval will not be retained. Otherwise, both trains will be retained. At this point, the layout of the single-route operation line for the entire day can be completed starting from the first train.

[0072] According to an embodiment of the present disclosure, a method for adjusting the running line at equal intervals after line drawing is provided, which can provide passengers with more efficient, stable and reliable services. Equal interval scheduling simplifies the scheduling of vehicles and personnel, optimizes resource utilization and reduces operating costs.

[0073] In some embodiments, the total number of line extractions required during the off-peak to peak transition period is determined based on the full turnaround time, the off-peak departure interval, and the peak departure interval, including:

[0074] When the vehicle runs on a single route, the total number of lanes G required during the transition period between peak and off-peak hours is calculated according to the following formula:

[0075] G=T / h1-T / h2

[0076] Where T is the total turnaround time of a vehicle operating on a single route, h1 is the departure interval during peak hours, and h2 is the departure interval during off-peak hours;

[0077] When there are large and small intersections in vehicle operation, the total number of line extractions G required during the transition period between peak and flat seasons is calculated according to the following formula:

[0078] G=T 大 / h 1大 +T 小 / h 1小 -T 大 / h 2大 -T 小 / h 2小 ,

[0079] Among them, T 大 T is the total turnover time of the vehicle running along the main route, 小 is the total turnover time of the vehicle operating on the small route, h 1大 is the average departure interval of vehicles running on large routes during peak hours, h 1小 is the average departure interval of vehicles running on small routes during peak hours, h 2大 is the average departure interval of vehicles running on large routes during off-peak period, h 2小 , is the average departure interval of vehicles running on small routes during off-peak period;

[0080] The method also includes:

[0081] When there are large and small intersections in vehicle operation, each running line corresponding to the small intersection is shortened according to the preset ratio of the running lines of the large intersection and the small intersection.

[0082] According to the embodiments of the present disclosure, a method for calculating the number of lines drawn corresponding to the two situations of vehicle operation according to a single route and the existence of large and small routes is provided, as well as a method for laying out the operating lines when large and small routes exist, which can enable the compilation of train operation diagrams to adapt to various actual needs.

[0083] In some embodiments, step S130, based on the operation lines of each period throughout the day, the vehicle bottom allocation is performed to generate a full-day planned operation diagram, including:

[0084] The objective functions of vehicle-undercarriage linkage are determined for the outbound and return periods and the transition period between peak and flat seasons, and an integer programming model is constructed. The outbound and return periods are the periods when trains on the morning peak season line leave the depot and return to the section after operation.

[0085] The integer programming model is solved to obtain a full-day planned operation diagram with balanced transition between peak and flat times from the start to the end of train operation.

[0086] According to the embodiments of the present disclosure, vehicle allocation is achieved by linking the outbound and return periods and the flat-peak transition periods, and the scheduling and allocation of vehicles are closely linked to operational needs to ensure effective utilization of vehicles and operational efficiency.

[0087] In some embodiments, the objective function of vehicle-under-carriage connection is determined for the outbound and return periods, and the flat-peak transition period, respectively, and an integer programming model is constructed, including:

[0088] For the outbound and return periods, the objective function is determined with the goal of minimizing the idle time of the vehicle during outbound or return periods.

[0089] For the transition period between flat and peak hours, a dual objective function is determined with the goal of minimizing the total connection time and minimizing the operating line deviation.

[0090] Alternatively, for the outbound and return periods, the objective is to minimize the idle time of the vehicle during outbound or return periods, and the objective function is determined as follows:

[0091]

[0092] Where D represents the parking lot set, d i represents any section in the parking lot set, F represents the set of up and down train departure times, n i Represents any train number, K={k1,k2,k i ,…}, K represents the vehicle bottom sequence, k i Indicates any vehicle bottom, Indicates the segment d i The train number n that departs and arrives at the first station s1 i of idle time.

[0093] Minimizing vehicle idle time means reducing the time the vehicle is running in a non-operating state, which helps save fuel, reduce vehicle wear and tear and lower operating costs, improve vehicle utilization efficiency, and ensure that the vehicle serves passengers as much as possible during operating hours.

[0094] Optionally, for the flat-peak transition period, with the goal of minimizing the total connection time and minimizing the operating line offset, the dual objective function is determined as follows:

[0095]

[0096] Among them, NU represents the set of upbound trains, FU represents the set of upbound trains, and FU represents the set of upbound trains. Indicates train number n i It is the preset offset of the vehicle bottom connection, N represents the set of upper and lower running vehicles, Indicates that the k-car bottom is at train number n i and train number n j Continuation time.

[0097] Minimizing the total connection time can reduce passengers' waiting time when transferring and improve their travel experience; minimizing the operating line deviation means that the vehicle's operating route changes less during peak and non-peak hours, which helps maintain operational stability and predictability.

[0098] According to the embodiments of the present disclosure, the car bottom connections during the outbound and return periods and the flat-peak transition period each correspond to different objective functions, which can consider the needs of train operation in different time periods. The setting of these objectives can achieve optimal allocation of resources in different operating periods, improve operational efficiency, reduce costs, and ensure that passengers receive high-quality services.

[0099] In some embodiments, the constraints of the objective function include vehicle bottom uniqueness constraint, turnaround time constraint, vehicle bottom usage constraint, operating line translation constraint, and vehicle storage quantity constraint in the yard.

[0100] Optionally, the vehicle bottom uniqueness constraint is:

[0101] Optionally, the return time constraint is: in, Indicates that at site s i Minimum return time from uplink to downlink;

[0102] Optionally, when the vehicle operates along a single route, the vehicle bottom utilization mode is constrained as follows:

[0103]

[0104] in, Indicates train number n j The arrival time at the first station s1, Indicates train number n i At the last site n The departure time, Indicates train number n j The preset offset for the underbody hook, Indicates train number n i The first station s1 and train number n j The last site n It's the same site. Indicates train number n j The first station s1 and train number n i The last site n It’s the same site;

[0105] Optionally, when there are large and small intersections in vehicle operation, the vehicle bottom operation mode is constrained as follows:

[0106] Optionally, the running line translation constraint is:

[0107]

[0108] Among them, ND represents the downlink train number set;

[0109] Optionally, the parking quantity constraint in the yard is: in, Indicates that in d i The number of vehicles in the yard.

[0110] According to the embodiments of the present disclosure, constraints to be satisfied by the objective function of undercarriage connection are provided. The undercarriage uniqueness constraint ensures that each vehicle can only perform one task at any given time to avoid scheduling conflicts; the turnaround time constraint ensures that the vehicle has enough time to perform necessary turnaround operations after completing a trip, such as passengers getting on and off, cleaning, inspection, etc.; the purpose of the provided undercarriage utilization constraint formula is to ensure that vehicles can be effectively connected and reasonably scheduled when operating on a single route and on different routes to adapt to different operational needs; the operating line translation constraint can control the conversion between operating lines to reduce passenger inconvenience and operational complexity; the yard parking quantity constraint ensures that there is enough space in the garage or yard to store vehicles to avoid vehicles having nowhere to park or being overcrowded.

[0111] The method 100 of the embodiment of the present disclosure is described below with reference to a specific implementation case:

[0112] The timetable compilation process primarily considers two key aspects: the layout of the operating lines and the connection of trains beneath them. The challenge during the line layout phase lies in ensuring a balanced layout from peak to off-peak periods. To minimize passenger wait times caused by sudden changes in operating intervals, operators will, in practice, re-route trains at a regular interval during operation, thereby lengthening the running intervals.

[0113] In the embodiment of the present disclosure, taking the transition from peak period to off-peak period as an example, according to the departure interval ratio of off-peak period, if the lines are drawn in an M:n manner, N running lines will be deleted from the M running lines. After the N running lines are deleted, MN running lines will be evenly adjusted in the time interval corresponding to the M running lines to achieve an overall transition from peak interval to off-peak interval. Figure 2 FIG. 1 is a schematic diagram of a forward line drawing process from a peak period to a flat peak period according to an embodiment of the present disclosure, as shown in FIG. Figure 2 As shown in the figure, the L1 line is the first line to enter the off-peak period after the peak. Following the L1 line, lines are drawn and evenly adjusted in a 4:1 and 3:1 ratio, achieving a transition from peak-peak, short-interval operation before the L1 line to off-peak, short-route operation after the green line. The ratio and rhythm of line drawing can be preset based on experience.

[0114] Optionally, in this embodiment, an optimization model is constructed by the following steps to achieve balanced vehicle withdrawal:

[0115] Step 1: Determine the number of vehicles that need to be added or reduced: Based on the full turnover time T and the departure interval, the number of vehicles G that need to be taken offline when the peak traffic turns into the off-peak traffic can be calculated.

[0116] Taking the transition from peak to off-peak as an example, when the operation plan includes a single route, the number of vehicle bottoms that need to be reduced (the number of lines drawn) is calculated according to the following formula:

[0117]

[0118] Among them, T is the full turnaround time, h1 is the departure interval during peak hours, and h2 is the departure interval during off-peak hours;

[0119] When the operation plan involves large and small routes, the number of vehicle bottoms that need to be reduced (the number of lines drawn) is calculated according to the following formula:

[0120]

[0121] Among them, T 大 、T 小is the total turnover time of the large and small routes, h 1大 、h 2小 are the average intervals between peak and off-peak routes.

[0122] Step 2: Construct the line extraction ratio matrix: A ratio matrix A = M*N can be constructed, where N is the number of lines to be extracted and M is the line extraction cycle. Considering the transition time, A can be constructed as a 6*6 matrix. The element α in the matrix A is (M，N) The ratio of the change in departure interval after the line is drawn compared with the departure interval during peak hours is calculated as follows:

[0123]

[0124] Step 3: Determine a reasonable wire drawing ratio for wire drawing:

[0125] 1) If h2 / h1=α (M，N) ∈A, then the line extraction ratio is M:N;

[0126] If N=1, the line is drawn according to M:N;

[0127] If N>1, then according to α′ (M-1，N-1) With α (M，N) The transition is performed in the proportion of α. (M′，N′) The number of times the line is drawn, x2 is the number of times α is drawn (M，N) The number of times the line is drawn;

[0128] 2) If Considering the feasibility of actual operation, it is necessary to select two reasonable sets of extraction ratios in matrix A, namely α (M，N) With α (M′，N′) ,Through the constructed transition period function, a reasonable combination of drawing line ratio is determined to achieve the transition;

[0129]

[0130] stx1*N+x2*N′=G

[0131] h1*(x1*(M-1)+x2*(M′-1))≤G*t Depot

[0132] x1,x2∈N *

[0133] α (M，N) ,α′ (M′，N′) ∈A

[0134] Among them, x1 is the (M，N) The number of times the line is drawn, x2 is the number of times α is drawn (M′，N′) The number of times the line is drawn, t DepotIt represents the time required for the vehicle to return to the depot after the operation ends, N * Represents a positive integer.

[0135] Step 4: After the line is drawn, the interval between trains is adjusted and the train connection is completed: In any M:N cycle, after deleting N running lines, the remaining MN-1 trains need to be adjusted to equal intervals. From peak to flat peak, the small scale should be drawn first, and then the large scale should be drawn. Starting from the peak end time t0, the number of small scale line drawing beats is selected. After x1 and x2 are completed, the next train will enter the off-peak period according to the h2 interval, completing the transition from high to flat peak. Figure 3 This is a reverse line drawing diagram for the transition from flat peak period to peak period according to an embodiment of the present disclosure. The transition from flat peak to peak period is the reverse process from peak to flat peak, and it is necessary to draw lines from the peak period (L2) in reverse order. Figure 3 After completing the transition of x1 and x2, if the interval between the current train and the next off-peak preset train is less than The last train of the last proportional interval will not be retained. Conversely, two trains (L3 and L4) will be retained. At this point, starting from the first train, the layout of the single route operation line for the entire day can be completed.

[0136] Step 5: Draw the running lines of large and small intersections: Figure 4 The following is a schematic diagram of the running lines of vehicles running on large and small intersections according to an embodiment of the present disclosure. Figure 4 As shown, when the operation plan involves large and small routes, the operating line is first laid out in a single route mode according to the number of trains leaving the line. After the laying is completed, the small route is shortened according to the large and small route ratio requirements.

[0137] Step 6, Undercarriage Connection: After the running line is mapped, undercarriage connection is required. This connection can be divided into two phases: during the morning rush hour, when trains leave the depot and return to the depot after the end of operation, and during the transition period between peak and off-peak hours. To better describe the undercarriage connection problem, the parameters are defined as shown in Table 1.

[0138] Table 1:

[0139]

[0140]

[0141] During the connection process, the connection status and source of the vehicle bottom are considered and the following two decision variables are constructed:

[0142]

[0143] 1) Objective function

[0144] During the morning peak period, when trains leave the depot and return to the depot after operation, the main goal is to reduce the travel time of empty trains. The objective function is as follows:

[0145]

[0146] During the transition period between peak and flat seasons, it is necessary to maximize turnover efficiency and reduce total connection time; at the same time, on the basis of ensuring connection efficiency, the offset of the running line should be minimized to ensure balanced running intervals. Therefore, the dual objective function is constructed as follows:

[0147]

[0148] 2) Constraints

[0149] During the connection process, constraints such as vehicle bottom uniqueness and return time need to be considered. The specific constraints are as follows:

[0150] ① Each running line can only have one vehicle bottom in charge (vehicle bottom uniqueness):

[0151]

[0152] ②Return time constraint:

[0153]

[0154] ③ Restrictions on vehicle bottom usage

[0155] i. The same vehicle bottom uses the same intersection and ii. Using different routes for the same vehicle bottom

[0156]

[0157] ④ The amount of translation that each running line can have:

[0158]

[0159] ⑤The number of vehicles under the vehicle deck is not greater than the number of vehicles stored in the yard:

[0160]

[0161] During the vehicle-undercarriage connection process, common heuristic algorithms, such as genetic algorithms and simulated annealing algorithms, can be used to solve the problem. Once the solution is completed, a full-day planned operation diagram can be obtained from the start to the end of the operation.

[0162] The disclosed embodiment simulates the map compilation process of map compilers, constructs an optimization model, and adopts a balanced vehicle withdrawal strategy to achieve balanced transition between peak and flat periods and vehicle bottom connection within a given time range, thereby improving the efficiency of map compilation; at the same time, it is also possible to explore the optimal transition strategy by adjusting the transition duration.

[0163] It should be noted that for the aforementioned method embodiments, for simplicity of description, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present disclosure is not limited by the order of the actions described, because according to the present disclosure, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present disclosure.

[0164] The above is an introduction to the method embodiment. The following is a further explanation of the solution disclosed in the present disclosure through an apparatus embodiment.

[0165] Figure 5 FIG. 1 shows a block diagram of a train operation diagram compilation device according to an embodiment of the present disclosure. Figure 5 As shown, the apparatus 500 includes:

[0166] The operation line generation module 510 is used to generate an off-peak operation line and a peak operation line based on the off-peak departure interval and the peak departure interval respectively;

[0167] The operating line adjustment module 520 is configured to periodically extract lines from the preset operating lines according to the transition direction from peak period to flat period using a preset line extraction algorithm during the flat-peak transition period, and to adjust the operating lines within each line extraction cycle at equal intervals to obtain operating lines for the flat-peak transition period. The preset operating lines are generated according to the departure intervals during the peak period.

[0168] The operation diagram generation module 530 is used to allocate vehicles based on the operation lines of each period throughout the day and generate a full-day planned operation diagram.

[0169] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the described module can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0170] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium, and a computer program product.

[0171] Figure 6A block diagram of an exemplary electronic device 600 capable of implementing embodiments of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are provided as examples only and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0172] The electronic device 600 includes a computing unit 601, which can perform various appropriate actions and processes according to a computer program stored in a ROM 602 or a computer program loaded from a storage unit 608 into a RAM 603. The RAM 603 may also store various programs and data required for the operation of the electronic device 600. The computing unit 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An I / O interface 605 is also connected to the bus 604.

[0173] Multiple components in the electronic device 600 are connected to the I / O interface 605, including an input unit 606, such as a keyboard, a mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a magnetic disk, an optical disk, etc.; and a communication unit 609, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 609 allows the electronic device 600 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0174] The computing unit 601 can be a variety of general-purpose and / or specialized processing components with processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units that run machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The computing unit 601 performs the various methods and processes described above, such as method 100. For example, in some embodiments, method 100 can be implemented as a computer software program that is tangibly contained in a machine-readable medium, such as a storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed on the electronic device 600 via ROM 602 and / or communication unit 609. When the computer program is loaded into RAM 603 and executed by the computing unit 601, one or more steps of the method 100 described above can be performed. Alternatively, in other embodiments, the computing unit 601 can be configured to perform method 100 in any other appropriate manner (e.g., by means of firmware).

[0175] Various embodiments of the systems and techniques described herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that are executable and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0176] The program code for implementing the method of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device so that when the program code is executed by the processor or controller, the functions / operations specified in the flow chart and / or block diagram are implemented. The program code can be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0177] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by or in conjunction with an instruction execution system, device or equipment. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0178] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0179] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.

[0180] A computer system may include a client and a server. The client and server are generally remote from each other and typically interact through a communication network. The client-server relationship arises through computer programs running on the respective computers and having a client-server relationship with each other. The server may be a cloud server, a server in a distributed system, or a server integrated with a blockchain.

[0181] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in this disclosure can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved. This is not limited herein.

[0182] The above specific embodiments do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure shall be included within the scope of protection of this disclosure.

Claims

1. A method for compiling a train diagram, characterized in that: include: Generate off-peak period operation lines and peak period operation lines based on off-peak period departure intervals and peak period departure intervals respectively; Based on the full turnaround time, the departure interval during the off-peak period and the departure interval during the peak period, the total number of lines required for the transition period between the off-peak period and the peak period is determined; When the vehicle runs on a single route, the total number of lanes required during the transition period between peak and off-peak hours is calculated according to the following formula: G=T / h1-T / h2 Where T is the total turnaround time of a vehicle operating on a single route, h1 is the departure interval during peak hours, and h2 is the departure interval during off-peak hours; When there are large and small intersections in vehicle operation, the total number of line extractions G required during the transition period between peak and flat seasons is calculated according to the following formula: G=T big / h1 big+T small / h1 small-T big / h2 big-T small / h2 small, Among them, T 大 T is the total turnover time of the vehicle running along the main route, 小 is the full turnover time of vehicles operating on small routes, h1 is the average departure interval of vehicles operating on large routes during peak hours, h1 is the average departure interval of vehicles operating on small routes during peak hours, h2 is the average departure interval of vehicles operating on large routes during off-peak hours, and h2 is the average departure interval of vehicles operating on small routes during off-peak hours; For the transition period from peak period to flat period, the preset line drawing algorithm is used to draw lines in the direction from peak period to flat period. For the flat-peak transition period from the flat-peak period to the peak period, the preset line drawing algorithm is used to draw the line in the reverse direction from the peak period to the flat-peak period; The operating line in each extraction cycle is adjusted at equal intervals to obtain the operating line during the transition period between flat and peak periods; Carriage bases are allocated based on the operating lines at various times of the day to generate a full-day planned operation diagram.

2. The method according to claim 1, characterized in that The operation line in each line extraction cycle is adjusted at equal intervals to obtain the operation line during the flat-peak transition period, including: According to the transition direction from peak period to flat period, the remaining running lines after line extraction in each line extraction cycle are adjusted at equal intervals; For the last running line with the smallest interval with the running line during the off-peak period in the last line extraction cycle, if the minimum interval between the last running line and the running line during the off-peak period is less than the departure interval during the off-peak period, Then delete the last running line.

3. The method according to claim 1, characterized in that The method further comprises: When there are large and small intersections in vehicle operation, each running line corresponding to the small intersection is shortened according to the preset ratio of the running lines of the large intersection and the small intersection.

4. The method according to claim 1, wherein The vehicle bottom allocation is performed based on the operation lines of each period throughout the day to generate a full-day planned operation diagram, including: Determine the objective function of vehicle bottom connection for the departure and return period and the flat-peak transition period, and construct an integer programming model. The departure and return period refers to the period when trains leave the depot and return to the segment after the end of operation on the morning peak line. The integer programming model is solved to obtain a full-day planned operation diagram with balanced transition between peak and flat times from the start of train operation to the end of operation.

5. The method according to claim 4, characterized in that The objective functions of vehicle bottom connection are determined for the outbound and return periods and the peak-offset transition period, respectively, and an integer programming model is constructed, including: For the outbound and return periods, the objective function is determined with the goal of minimizing the idle time of the vehicle during outbound or return periods. For the transition period between flat and peak hours, a dual objective function is determined with the goal of minimizing the total connection time and minimizing the operating line deviation.

6. The method according to claim 5, characterized in that The constraints of the objective function include vehicle bottom uniqueness constraint, turnaround time constraint, vehicle bottom usage mode constraint, running line translation constraint and vehicle storage quantity constraint.

7. A train diagram compilation device, characterized in that: include: An operation line generation module is used to generate an off-peak operation line and a peak operation line based on the off-peak departure interval and the peak departure interval respectively; The operating line adjustment module is used to determine the total number of lines required for the transition period between peak and off-peak periods based on the full turnaround time, the off-peak period departure interval, and the peak period departure interval; When the vehicle runs on a single route, the total number of lanes G required during the transition period between peak and off-peak hours is calculated according to the following formula: G=T / h1-T / h2 Where T is the total turnaround time of a vehicle operating on a single route, h1 is the departure interval during peak hours, and h2 is the departure interval during off-peak hours; When there are large and small intersections in vehicle operation, the total number of line extractions G required during the transition period between peak and flat seasons is calculated according to the following formula: G=T big / h1 big+T small / h1 small-t big / h2 big-T small / h2 small, Among them, T 大 T is the total turnover time of the vehicle running along the main route, 小 is the total turnover time of vehicles running on small routes, h1 is the average departure interval of vehicles running on large routes during peak hours, h1 is the average departure interval of vehicles running on small routes during peak hours, h2 is the average departure interval of vehicles running on large routes during off-peak hours, and h 2小 The average departure interval of vehicles running on small routes during off-peak period; For the transition period from peak period to flat period, the preset line drawing algorithm is used to draw lines in the direction from peak period to flat period. For the flat-peak transition period from the flat-peak period to the peak period, the preset line drawing algorithm is used to draw the line in the reverse direction from the peak period to the flat-peak period; The operating line in each extraction cycle is adjusted at equal intervals to obtain the operating line during the transition period between flat and peak periods; The operation diagram generation module is used to allocate vehicles based on the operation lines in various periods of the day and generate a full-day planned operation diagram.

8. An electronic device comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 6.

9. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are configured to cause the computer to execute the method according to any one of claims 1 to 6.

Images