Single-track railway train working diagram compilation method based on conflict defibering and related equipment

Abstract

The invention provides a single-track railway train working diagram compilation method based on conflict defibering and related equipment, and relates to the technical field of railway transportation. The method comprises the following steps: acquiring train distribution time, the total number of uplink and downlink passenger trains and the total number of uplink and downlink cargo trains; generating an initial train timetable according to the train distribution time, the total number of the uplink and downlink passenger trains and the total number of the uplink and downlink cargo trains; train running lines are drawn according to the initial train timetable, conflict defibering is carried out when each train running line is drawn, and the conflict defibering comprises interval time conflict defibering based on a running line dynamic generation method of conflict defibering and arrival-departure line conflict defibering based on an arrival-departure line insufficient identification and defibering method; the single-track railway train working diagram is generated after all train running lines are painted, conflict detection and defibering are carried out after the running line conflict detection range is updated, the running lines are dynamically painted, manual judgment and repeated operation on running line conflicts are reduced, and the train working diagram compiling efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of railway transportation, and in particular to a method for compiling a single-line railway train operation diagram based on conflict resolution and related equipment. Background Art

[0002] The train operation diagram of a single-track railway has the significant characteristics of high complexity of passenger and freight train intersections, strong flexibility of truck stop plans, and unfixed train operation order. At present, the train operation diagram of a single-track railway is still manually compiled by map makers. During the manual compilation process, complex conditions such as passenger trains, skylight settings, and the number of arrival and departure lines are considered at the same time. New freight train operation lines are added one by one, and the conflicts between trucks and trucks, passenger cars, skylights, and arrival and departure lines are judged and resolved in turn, and a truck stop plan is given. However, with the gradual increase in the complexity of the passenger train structure, the difficulty of resolving the conflict of the operation line continues to increase, and its compilation time is also extended, involving a large number of repetitive operations, consuming manpower and time costs, and reducing the compilation efficiency of the operation diagram. In the related art, a mixed integer programming model is solved to determine the flexible stop plan and train operation order of freight trains, but it first traverses all possible operation routes, and then deletes the conflicting routes, including the final operable routes. This operation diagram compilation method has low compilation efficiency and cannot meet the high-complexity passenger train structure. Summary of the invention

[0003] The present invention provides a single-track railway train operation diagram compilation method based on conflict resolution and related equipment, which are used to solve the defects of low compilation efficiency and inability to meet the needs of highly complex passenger train structures in traditional operation diagram compilation methods.

[0004] The present invention provides a method for compiling a single-track railway train operation diagram based on conflict resolution, comprising: Obtain train deployment time, total number of up and down passenger trains, and total number of up and down freight trains; Generate an initial train schedule according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; The train running lines are laid out according to the initial train timetable, and conflicts are resolved when laying out each train running line. The conflict resolution includes resolving interval conflicts based on a dynamic generation method of running lines for conflict resolution, and resolving arrival and departure line conflicts based on an arrival and departure line shortage identification and resolution method. After all train running lines are laid out, a single-track railway train operation diagram is generated.

[0005] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided. The method for dynamically generating an operation line based on conflict resolution performs interval time conflict resolution, comprising: Generate a plan for meeting up and down freight trains according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; Use the uplink and downlink freight train meeting plan to calculate the restricted section cycle time; Calculate the arrival and departure time of up and down trains at each station based on the total number of up and down passenger trains and the total number of up and down freight trains and the initial point-distribution departure time of up and down trains in the restricted interval cycle time, interval running time, additional start and stop time, stop plan and stop time; Use the arrival and departure times of up and down trains at each station to generate a station timetable and sort them by the time the trains arrive at the station; Use the dispersed continuous dispatching time interval insufficient conflict detection algorithm to perform the dispersed continuous dispatching time interval insufficient conflict detection; use the train cycle time interval insufficient conflict detection algorithm to perform the train cycle time interval insufficient conflict detection; The detected conflicts are written into the conflict record table, in which the order of conflict records of a specific type is modified and the conflict records of a specific type are merged; The conflict of the running line is resolved according to the conflict record table, wherein the conflict of the opposite train section is resolved by using the conflict resolution algorithm of the opposite train section; the conflict of the opposite train station is resolved by using the conflict resolution algorithm of the opposite train station; Determine whether the departure time of the two adjacent freight trains in the same direction meets the minimum departure interval. If not, use the minimum departure interval to update the departure time of the following train. Use the train movement algorithm based on the time window of the point to move the point time; The initial train schedule is updated according to the point distribution time shift result to obtain a conflict relief train schedule.

[0006] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the method uses a dispersed continuous train interval time insufficient conflict detection algorithm to perform dispersed continuous train interval time insufficient conflict detection, comprising: Traversing all freight trains in the initial train schedule; If the rear car The next stop is passed, which requires the dispersed continuous interval time to record the following vehicle The departure time at the previous stop is , the arrival time is , the front car The departure time at the next stop is , the arrival time is ; Use the interval running time of the opposite train to generate the interval time t of the dispersed continuous trains interval,if and , the interval time between dispersed trains is t interval is the sum of the existing interval time, the interval time of different arrivals, and the interval time of meeting vehicles. If and , the interval between dispersed bursts is then two intervals between passing vehicles; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient interval time for dispersed and continuous dispatch of downlink or uplink same-direction freight trains, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

[0007] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the method uses a train cycle interval insufficient conflict detection algorithm to perform train cycle interval insufficient conflict detection, comprising: Traverse all freight trains in the initial train schedule and define the downgoing freight trains in the same direction and ,train For the rear car is the preceding train; traverses all stations, the stations that the two trains pass through at the same time and ,station For the next stop For the previous stop; record the following car The departure time at the previous stop is , the arrival time at the next stop is , the front car The departure time at the previous stop is , the arrival time at the next stop is ; Traverse all stations. If it is the station before the train's departure station and final destination station, the train cycle interval is t interval is the interval time between trains. At other stations, if the departure time difference between the two trains is not greater than the restricted interval cycle time, the train cycle interval time is t interval is the interval between trains, otherwise the train cycle interval is t interval is the limit interval cycle time; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generating a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, recording at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, and putting it into a conflict record table; if , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

[0008] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the algorithm for resolving conflict between opposite train stations comprises: Read the conflict record table. If the conflict type is an oncoming train station intersection conflict, read the conflict object A as the train , conflict object B is a train , the conflict location is the station ; According to the staggered stop principle, the meeting plan is generated, and the conflict object A is determined to be a train. , conflict object B is a train , the stop preferences at the conflicting stations are recorded as stop preference A and stop preference B respectively; according to the known prohibited stop stations and required stop stations, the conflicting object A is determined to be train , conflict object B is a train , the stop plans at the conflicting stations are recorded as stop plan A and stop plan B respectively; Use the stop preference to select a conflict resolution solution. If stop preference A is to stop and stop preference B is to pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is pass and stop preference B is stop, the conflicting train B is selected. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is stop and stop preference B is stop, use the operation diagram drawing round number to select the conflict resolution plan; Alternatively, use the stop plan to select a conflict resolution solution. If stop plan A is a flexible stop and stop plan B is a pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop plan A is through and stop plan B is flexible stop, select conflicting train B. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; Alternatively, if both stop plan A and stop plan B are passed, update the conflict resolution position. For conflict object A, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position A; for conflict object B, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position B; compare the conflict resolution position and the number of stations between conflict resolution positions A and B, and select the nearest station as the new conflict resolution position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , the conflict location is the station , the train movement time is the meeting interval time; if the conflict resolution position B is selected, the conflict object B train is selected , the conflict location is the station , the train movement time is the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, the conflict resolution scheme is selected using the number of rounds of the operation diagram; The method of using the oncoming train station intersection conflict resolution algorithm to resolve the oncoming train station intersection conflict comprises: Determine the conflict object, conflict location and train movement time based on the selected conflict resolution plan; Traverse all stations from the conflict location to the train departure point, excluding the conflict location station, and find the first non-stopping station as the conflict resolution location; If the location of conflict resolution is the train departure station, then increase the train departure time by one train movement time, traverse all stations from the conflict resolution location to the train terminal, and initialize the stop plans and stop times of all trains; If the location of conflict resolution is not the train departure station, determine whether there is a stop at the location of conflict resolution. If there is a stop, increase the stop time by one train movement time. Otherwise, increase the stop time by one train movement time. Determine whether the train stop time is less than the minimum stop time. If so, increase it to the minimum stop time. Otherwise, do not change the stop time and output the updated train timetable.

[0009] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the method uses an algorithm for resolving conflict between opposing train sections to resolve conflict between opposing train sections, and comprises: Read the conflict record table. If the conflict type is a cross-section conflict between opposite trains, the conflict object A is a train. , conflict object B is a train , conflict location A is the station , conflict location B is the station ; According to the meeting plan generated based on the staggered stop principle, the conflicting train A is determined The stop preference at the conflicting location A is denoted as stop preference A1, and the conflicting object A train The stop preference at the conflicting location B is recorded as stop preference A2, and the conflicting object B train The stop preference at the conflicting location B is denoted as stop preference B1, and the conflicting train B The stop preference at the conflicting position A is recorded as stop preference B2; Determine the conflicting train A based on the known prohibited and required stops. The stop plan at the conflicting location A is recorded as stop plan A1, and the conflicting train A The stop plan at the conflicting location B is recorded as stop plan A2, and the conflicting train B The stop plan at the conflicting location B is recorded as stop plan B1, and the conflicting train B The stop plan at the conflicting position A is recorded as stop plan B2; If the stop plans A1, A2, B1 and B2 are all passed, update the conflict relief position. For the conflict object A, traverse all the stations from the conflict position A to the train departure point, and find the first non-stopping station as the conflict relief position A; for the conflict object B, traverse all the stations from the conflict position B to the train departure point, and find the first non-stopping station as the conflict relief position B. Compare the existing conflict relief position and the number of stations between the conflict relief positions A and B, and select the nearest station as the new conflict relief position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , conflict location A is the station The train moving time is the train moving time B plus the train interval time. If the conflict resolution position B is selected, the conflict object B train is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, use the train movement time to select the conflict resolution plan, compare the train waiting time, and if the train waiting time B is less than A, select the conflict object A train , conflict location A is the station The train moving time is the train moving time B plus the train interval time; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the train waiting time B is equal to A, use the number of rounds of the operation diagram to select the conflict resolution plan; If only A1 and B1 are approved in the stop plan, use the stop plan to select the conflict resolution plan. Based on the known prohibited and required stops, if stop plan B2 is approved and stop plan A2 is not approved, select the conflict object A train. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals; if the stop plan A2 is passing and the stop plan B2 is not passing, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time B is less than A, select the conflict object A train , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station The train moving time is the train moving time B plus the time between different arrivals; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If the train waiting time B is equal to A, use the stop preference to select the conflict resolution plan. If the stop preference A2 is stop and the stop preference B2 is pass, the conflict object A train is selected. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the time between different arrivals; if the stop preference A2 is pass, and the stop preference B2 is stop, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If stop preference A2 and stop preference B2 are both stop or pass, use the number of running line drawing rounds to select the conflict resolution plan; Use the stop plan to select a conflict resolution plan. Based on the known prohibited and required stops, if stop plan A1 is a non-pass and stop plan B1 is a pass, select the conflict object A train. , conflict location A is the station The train moving time is the train moving time A plus the meeting interval time; if the stop plan A1 is passing and the stop plan B1 is not passing, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time A is less than B, select the conflict object A train , conflict location A is the station The train moving time is the train moving time A plus the meeting time; if the train waiting time A is greater than B, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If the train waiting time A is equal to B, use the stop preference to select the conflict resolution plan. If the stop preference A1 is stop and the stop preference B1 is pass, select the conflict object A train. , conflict location A is the station , the train moving time is the train moving time A plus the meeting interval time; if the stop preference A1 is passing and the stop preference B1 is stopping, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If stop preference A1 and stop preference B1 are both stop or pass, use the operation diagram drawing round number to select the conflict resolution plan; After conflict resolution, update the output train timetable.

[0010] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the method uses a train movement algorithm based on a point arrangement time window to perform point arrangement time movement, comprising: Reading a freight train departure timetable, and generating a freight train current point schedule according to the freight train departure timetable; Traverse the existing freight train deployment schedule and locate the location number and the corresponding current departure times of freight trains ; Traverse the initial distribution schedule of freight trains and find the location number The corresponding freight train's original left boundary value ; Traverse the initial distribution schedule of freight trains, the current left boundary value of freight trains , locate its position number ; If the original left boundary value of the freight train Equal to the current left boundary value , continue to compare the next freight train, ; If the original left boundary value of the freight train Greater than the current left boundary value , traverse the existing freight train distribution schedule, no greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the freight train; If the original left boundary value of the freight train Less than the current left boundary value , traverse the initial freight train timetable and delete the position number to Between time points, and add a new points, the interval between new points is the restricted interval period; Traverse the existing freight train distribution schedule, greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the downlink freight train; Output freight train departure times.

[0011] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the conflict resolution of arrival and departure lines is performed based on the insufficient arrival and departure line identification and resolution method, comprising: Read train schedules and station schedules, set minimum train movement time, and determine the number of arrival and departure lines at each station; Traverse all stations and all trains passing through each station to locate the train At the station The train arrival time is taken as the time tangent point ; Traverse the stations All trains, find stations At the time cut point For all trains occupying the arrival and departure tracks, a candidate set of trains to be moved is generated, and the number of trains occupying the arrival and departure tracks is counted; If the number of arrival and departure tracks occupied by the train is greater than the number of arrival and departure tracks at the station, the number of passenger trains, freight trains, downgoing freight trains, and upgoing freight trains in the candidate set of trains to be moved are counted; If the number of freight trains is 0, output the train departure time and the number of rounds of running line drawing; If the number of freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of a train, and the number of running line laying rounds remains unchanged. If the number of freight trains is 2, of which the number of downgoing freight trains is 1 and the number of upgoing freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of one train, and the number of running line laying rounds remains unchanged; If the number of downgoing freight trains is not less than the number of upgoing trains, the downgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; otherwise, the upgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; Move the freight train to be moved back by the minimum moving time of one train, locate the number of rounds of running line drawing when the train to be moved is added, roll back the timetable of all trains to the drawing result of round-1 before the train to be moved is added, initialize the stop plan and stop time of all trains, and update the number of rounds of running line drawing to round-1; Output the train departure time and the number of rounds of running line drawing.

[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 program, the method for compiling a single-track railway train operation diagram based on conflict resolution as described in any one of the above items is implemented.

[0013] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the method for compiling a single-track railway train operation diagram based on conflict resolution as described in any one of the above items is implemented.

[0014] The conflict resolution-based single-track railway train operation diagram compilation method and related equipment provided by the present invention obtain the train deployment time, the total number of up and down passenger trains and the total number of up and down freight trains; generate an initial train timetable according to the train deployment time, the total number of up and down passenger trains and the total number of up and down freight trains; lay out the train lines according to the initial train timetable, and perform conflict resolution when laying out each train line, wherein the conflict resolution includes performing interval time conflict resolution based on a dynamic generation method of lines for conflict resolution, and performing arrival and departure line conflict resolution based on a method for identifying and resolving insufficient arrival and departure lines; after all train lines are laid out, a single-track railway train operation diagram is generated, and the running line conflicts are detected and resolved when each running line is laid out, so as to realize dynamic laying of the running lines, reduce manual judgment and repeated operations of running line conflicts by map makers, and improve the efficiency of train operation diagram compilation. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] 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.

[0016] Figure 1 It is one of the flow diagrams of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 2 This is a second flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 3 This is a third flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 4 This is a fourth flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 5 This is a fifth flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 6 This is a sixth flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 7 This is the seventh flow chart of the method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Figure 8 This is a flowchart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention; Fig. 9 It is a functional structure diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0017] 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.

[0018] Figure 1 A flow chart of a method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention, such as Figure 1 As shown, the method for compiling a single-track railway train operation diagram based on conflict resolution provided by an embodiment of the present invention includes: Step 101, obtaining the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; Step 102, generating an initial train schedule according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; Step 103: Plotting train running lines according to the initial train timetable, and performing conflict resolution when plotting each train running line, wherein the conflict resolution includes resolving interval conflicts based on a running line dynamic generation method for conflict resolution, and resolving arrival and departure line conflicts based on an arrival and departure line shortage identification and resolution method; Step 104: After all train lines are mapped, a single-track railway train diagram is generated.

[0019] In the embodiment of the present invention, after inputting the train deployment time, it is also necessary to set the number of times the conflict resolution is expected to be performed; determine whether to perform a running line paving cycle, if the number of rounds of running line paving is currently If it is not greater than the number of freight trains to be laid out nh-1, then enter the running line laying cycle and go to 1), otherwise go to 8); 1) Determine whether to perform a second cycle of running line conflict resolution. If the number of current conflicts is If it is not 0, enter the second cycle of conflict resolution of running lines and go to 2), otherwise go to 5); 2) Clear the existing train timetable, station timetable and conflict record table; use the dynamic running line generation algorithm based on conflict resolution to lay out the running line and update the train timetable; 3) Determine whether to proceed to identification and resolution of insufficient dispatch lines. If the number of current conflicts is If it is not 0, it means that it is necessary to continue the cycle of running line conflict relief, and go to 4), otherwise go to 5); 4) Determine the current number of conflict resolutions Is it equal to the expected number of conflict resolutions? If yes, go to step 8), otherwise go to step 2); 5) Record the results of the current round of train schedules, use the insufficient arrival and departure track identification and relief algorithm to identify whether the number of arrival and departure tracks at each station is sufficient, and carry out train movement relief; 6) Clear the existing train timetable, station timetable and conflict record table, use the dynamic generation algorithm of running lines based on conflict resolution, draw running lines and update the train timetable; 7) Determine the current number of conflict resolutions Is it equal to the expected number of conflict resolutions? If yes, go to step 8); 8) Output train timetable.

[0020] The traditional train operation diagram compilation method solves a mixed integer programming model to determine the flexible stop plan and train operation sequence of freight trains. However, it first traverses all possible operation routes and then deletes the conflicting routes, including the final operable routes. This operation diagram compilation method has low compilation efficiency and cannot meet the needs of highly complex passenger train structures.

[0021] The method for compiling a single-track railway train operation diagram based on conflict resolution provided in an embodiment of the present invention obtains the train deployment time, the total number of up and down passenger trains and the total number of up and down freight trains; generates an initial train timetable according to the train deployment time, the total number of up and down passenger trains and the total number of up and down freight trains; lays out train lines according to the initial train timetable, and performs conflict resolution when laying out each train line, wherein the conflict resolution includes performing interval time conflict resolution based on a dynamic generation method of lines for conflict resolution, and performing arrival and departure line conflict resolution based on a method for identifying and resolving insufficient arrival and departure lines; generates a single-track railway train operation diagram after all train lines are laid out, detects and resolves line conflicts when laying out each line, realizes dynamic laying of lines, reduces manual judgment and repeated operations of line conflicts by map makers, and improves the efficiency of train operation diagram compilation.

[0022] Based on any of the above embodiments, the method for dynamically generating a running line based on conflict resolution performs time interval conflict resolution, including: Generate a plan for meeting up and down freight trains according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; Use the uplink and downlink freight train meeting plan to calculate the restricted section cycle time; Calculate the arrival and departure time of up and down trains at each station based on the total number of up and down passenger trains and the total number of up and down freight trains and the initial point-distribution departure time of up and down trains in the restricted interval cycle time, interval running time, additional start and stop time, stop plan and stop time; Use the arrival and departure times of up and down trains at each station to generate a station timetable and sort them by the time the trains arrive at the station; Use the dispersed continuous dispatching time interval insufficient conflict detection algorithm to perform the dispersed continuous dispatching time interval insufficient conflict detection; use the train cycle time interval insufficient conflict detection algorithm to perform the train cycle time interval insufficient conflict detection; The detected conflicts are written into the conflict record table, in which the order of conflict records of a specific type is modified and the conflict records of a specific type are merged; The conflict of the running line is resolved according to the conflict record table, wherein the conflict of the opposite train section is resolved by using the conflict resolution algorithm of the opposite train section; the conflict of the opposite train station is resolved by using the conflict resolution algorithm of the opposite train station; Determine whether the departure time of the two adjacent freight trains in the same direction meets the minimum departure interval. If not, use the minimum departure interval to update the departure time of the following train. Use the train movement algorithm based on the time window of the point to move the point time; The initial train schedule is updated according to the point distribution time shift result to obtain a conflict relief train schedule.

[0023] In the embodiment of the present invention, Figure 2 As shown in the figure, the dynamic generation algorithm of the running line based on conflict resolution includes: 1) Input the number of passenger and freight trains; 2) Using the initial departure time of up and down trains, section running time, additional time for starting and stopping, stop plan and stop time, the line is pushed to calculate the arrival and departure time of up and down trains at each station; 3) Update the attributes of the virtual freight train, update the attributes of the freight trains included in the conflict resolution consideration to 1, and update the attributes of the virtual freight trains to be laid out to 0; 4) Update the fixed attributes of freight trains, update the fixed freight train attributes to 1, and update the non-fixed freight train attributes to 0; 5) Generate a station timetable using the arrival and departure times of up and down trains at each station, and sort them by the time the trains arrive at the station; 6) Conduct running line conflict detection, using a dispersed continuous interval time insufficient conflict detection algorithm to conduct dispersed continuous interval time insufficient conflict detection; using a train cycle interval time insufficient conflict detection algorithm to conduct train cycle interval time insufficient conflict detection; write the detected conflicts into the conflict record table and sort them according to the time when the conflicts occurred; 7) In the conflict record table, modify the order of conflict records of a specific type; 8) In the conflict record table, merge conflict records of a specific type; 9) Resolve running line conflicts according to the conflict record table, using the oncoming train section intersection conflict resolution algorithm to resolve oncoming train section intersection conflicts; using the oncoming train station intersection conflict resolution algorithm to resolve oncoming train station intersection conflicts; 10) Restore the fixed attributes of the freight train to the initial state; 11) Determine whether the departure time of the two adjacent freight trains in the same direction meets the minimum departure interval. If not, use the minimum departure interval to update the departure time of the following train; 12) Use the train movement algorithm based on the time window of the point to move the point time; 13) Update and record the number of rounds of the current running line drawing , the number of times conflict resolution is currently being performed , the number of conflicts currently existing ; 14) Output the number of rounds of the current running line drawing , the number of times conflict resolution is currently being performed , the number of conflicts currently existing .

[0024] In the implementation of the present invention, the train running line is dynamically generated by updating train attributes, performing conflict detection and resolution.

[0025] Based on any of the above embodiments, the use of the dispersed burst interval insufficient conflict detection algorithm to perform dispersed burst interval insufficient conflict detection includes: Traversing all freight trains in the initial train schedule; If the rear car The next stop is passed, which requires the dispersed continuous interval time to record the following vehicle The departure time at the previous stop is , the arrival time is , the front car The departure time at the next stop is , the arrival time is ; Use the interval running time of the opposite train to generate the interval time t of the dispersed continuous trains interval ,if and , the interval time between dispersed trains is t interval is the sum of the existing interval time, the interval time of different arrivals, and the interval time of meeting vehicles. If and , the interval between dispersed bursts is then two intervals between passing vehicles; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient interval time for dispersed and continuous dispatch of downlink or uplink same-direction freight trains, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

[0026] In the embodiment of the present invention, Figure 3 As shown, the distributed burst interval insufficient conflict detection algorithm includes the following steps: 1) Input train timetable; 2) Traverse all freight trains and locate the freight train going down the same direction and ,train For the rear car is the front train; traverse all stations and locate the stations that the two trains pass through at the same time and ,station For the next stop For the previous station, the same applies to the upward movement; 3) If the car behind If the stop status of the next station is passed, the dispersed continuous interval time must be met, go to 4), otherwise go to 8); 4) Record the following vehicle The departure time at the previous stop is , the arrival time is , the front car The departure time at the next stop is , the arrival time is ; 5) Use the interval running time of the opposite train to generate the interval time t of the dispersed continuous trains interval ,if and , disperse the continuous interval time and add a non-simultaneous arrival interval time and a meeting interval time. If and , add two more meeting intervals to the interval between dispersed bursts; 6) If and t interval , indicating that the rear car is behind the front car but the interval between them is insufficient, so the rear car needs to move backward. The current interval is calculated as , calculate the backward moving time as t interval , go to 7), otherwise go to 8); 7) Generate a conflict of insufficient interval between the dispersed and continuous dispatch of freight trains in the same direction down the line, record the conflict type as 71 (the interval between the dispersed and continuous dispatch of down the line freight trains in the section is insufficient), and the conflict object A is the train , conflict object B is a train , the conflict location is the station , the conflict time is , the train movement time is t interval , put the above records into the conflict record table; similarly, generate the conflict of insufficient interval time for the dispersed and continuous dispatch of the upward same-direction freight trains, record the conflict type as 72 (the interval time for the dispersed and continuous dispatch of the upward freight trains and the upward freight trains in the section is insufficient), go to 8); 8) Output the conflict record table.

[0027] Based on any of the above embodiments, the use of the train cycle interval time insufficient conflict detection algorithm to perform train cycle interval time insufficient conflict detection includes: Traverse all freight trains in the initial train schedule and define the downgoing freight trains in the same direction and ,train For the rear car is the preceding train; traverses all stations, the stations that the two trains pass through at the same time and ,station For the next stop For the previous stop; record the following car The departure time at the previous stop is , the arrival time at the next stop is , the front car The departure time at the previous stop is , the arrival time at the next stop is ; Traverse all stations. If it is the station before the train's departure station and final destination station, the train cycle interval is t interval is the interval time between trains. At other stations, if the departure time difference between the two trains is not greater than the restricted interval cycle time, the train cycle interval time is tinterval is the interval between trains, otherwise the train cycle interval is t interval is the limit interval cycle time; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generating a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, recording at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, and putting it into a conflict record table; if , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

[0028] In the embodiment of the present invention, Figure 4 As shown, the train cycle interval insufficient conflict detection algorithm includes the following steps: 1) Input train timetable; 2) Traverse all freight trains and locate the freight train going down the same direction and ,train For the rear car is the front train; traverse all stations and locate the stations that the two trains pass through at the same time and ,station For the next stop For the previous stop; record the following car The departure time at the previous stop is , the arrival time at the next stop is , the front car The departure time at the previous stop is , the arrival time at the next stop is , the same applies to the upper line; 3) Traverse all stations. If it is the station before the train’s departure station and final destination station, the train cycle interval is t interval is the interval time between trains. At other stations, if the departure time difference between the two trains is not greater than the restricted interval cycle time, the train cycle interval time is t interval is the interval between trains, otherwise the train cycle interval is t intervalis the limit interval cycle time; 4) If and t interval , indicating that the rear car is behind the front car but the interval between them is insufficient, so the rear car needs to move backward. The current interval is calculated as , calculate the backward moving time as t interval , go to 5), otherwise go to 6); 5) Generate a conflict of insufficient interval time between train cycles of downgoing freight trains in the same direction, record the conflict type as 81 (the interval time between train cycles of downgoing freight trains and downgoing freight trains in the section is insufficient (the rear train is behind)), and the conflict object A is the train , conflict object B is a train , the conflict location is the station , the conflict time is , the train movement time is t interval , put the above records into the conflict record table; similarly, generate the conflict of insufficient interval time between freight trains in the same direction and going up, record the conflict type as 83 (insufficient interval time between the train cycles of the up freight train and the up freight train in the section (the following train is behind)), go to 8); 6) If , indicating that the rear car is in front and needs to move back. The current interval time is calculated as , calculate the backward moving time as t interval , go to 7), otherwise go to 8); 7) Generate a conflict of insufficient interval time between train cycles of downgoing freight trains in the same direction, record the conflict type as 82 (the interval time between train cycles of downgoing freight trains and downgoing freight trains in the section is insufficient (the rear train is in front)), and the conflict object A is the train , conflict object B is a train , the conflict location is the station , the conflict time is , the train movement time is t interval , put the above records into the conflict record table; similarly, generate the conflict of insufficient interval time between the upgoing freight trains in the same direction, record the conflict type as 84 (the interval time between the upgoing freight trains and the upgoing freight trains in the section is insufficient (the rear train is in front)), go to 8); 8) Output the conflict record table.

[0029] The embodiments of the present invention can realize conflict detection of different contents and reduce the occurrence of conflicts in train operation diagrams.

[0030] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the algorithm for resolving conflict between opposite train stations comprises: Read the conflict record table. If the conflict type is an oncoming train station intersection conflict, read the conflict object A as the train , conflict object B is a train , the conflict location is the station ; According to the staggered stop principle, the meeting plan is generated, and the conflict object A is determined to be a train. , conflict object B is a train , the stop preferences at the conflicting stations are recorded as stop preference A and stop preference B respectively; according to the known prohibited stop stations and required stop stations, the conflicting object A is determined to be train , conflict object B is a train , the stop plans at the conflicting stations are recorded as stop plan A and stop plan B respectively; Use the stop preference to select a conflict resolution solution. If stop preference A is to stop and stop preference B is to pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is pass and stop preference B is stop, the conflicting train B is selected. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is stop and stop preference B is stop, use the operation diagram drawing round number to select the conflict resolution plan; Alternatively, use the stop plan to select a conflict resolution solution. If stop plan A is a flexible stop and stop plan B is a pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop plan A is through and stop plan B is flexible stop, select conflicting train B. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; Alternatively, if both stop plan A and stop plan B are passed, update the conflict resolution position. For conflict object A, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position A; for conflict object B, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position B; compare the conflict resolution position and the number of stations between conflict resolution positions A and B, and select the nearest station as the new conflict resolution position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , the conflict location is the station , the train movement time is the meeting interval time; if the conflict resolution position B is selected, the conflict object B train is selected , the conflict location is the station , the train movement time is the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, the conflict resolution scheme is selected using the number of rounds of the operation diagram; The method of using the oncoming train station intersection conflict resolution algorithm to resolve the oncoming train station intersection conflict comprises: Determine the conflict object, conflict location and train movement time based on the selected conflict resolution plan; Traverse all stations from the conflict location to the train departure point, excluding the conflict location station, and find the first non-stopping station as the conflict resolution location; If the location of conflict resolution is the train departure station, then increase the train departure time by one train movement time, traverse all stations from the conflict resolution location to the train terminal, and initialize the stop plans and stop times of all trains; If the location of conflict resolution is not the train departure station, determine whether there is a stop at the location of conflict resolution. If there is a stop, increase the stop time by one train movement time. Otherwise, increase the stop time by one train movement time. Determine whether the train stop time is less than the minimum stop time. If so, increase it to the minimum stop time. Otherwise, do not change the stop time and output the updated train timetable.

[0031] Based on any of the above embodiments, the method of using the oncoming train section intersection conflict resolution algorithm to resolve the oncoming train section intersection conflict includes: Read the conflict record table. If the conflict type is a cross-section conflict between opposite trains, the conflict object A is a train. , conflict object B is a train , conflict location A is the station , conflict location B is the station ; According to the meeting plan generated based on the staggered stop principle, the conflicting train A is determined The stop preference at the conflicting location A is denoted as stop preference A1, and the conflicting object A train The stop preference at the conflicting location B is recorded as stop preference A2, and the conflicting object B train The stop preference at the conflicting location B is denoted as stop preference B1, and the conflicting train B The stop preference at the conflicting position A is recorded as stop preference B2; Determine the conflicting train A based on the known prohibited and required stops. The stop plan at the conflicting location A is recorded as stop plan A1, and the conflicting train A The stop plan at the conflicting location B is recorded as stop plan A2, and the conflicting train B The stop plan at the conflicting location B is recorded as stop plan B1, and the conflicting train B The stop plan at the conflicting position A is recorded as stop plan B2; If the stop plans A1, A2, B1 and B2 are all passed, update the conflict relief position. For the conflict object A, traverse all the stations from the conflict position A to the train departure point, and find the first non-stopping station as the conflict relief position A; for the conflict object B, traverse all the stations from the conflict position B to the train departure point, and find the first non-stopping station as the conflict relief position B. Compare the existing conflict relief position and the number of stations between the conflict relief positions A and B, and select the nearest station as the new conflict relief position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , conflict location A is the station The train moving time is the train moving time B plus the train interval time. If the conflict resolution position B is selected, the conflict object B train is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, use the train movement time to select the conflict resolution plan, compare the train waiting time, and if the train waiting time B is less than A, select the conflict object A train , conflict location A is the station The train moving time is the train moving time B plus the train interval time; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the train waiting time B is equal to A, use the number of rounds of the operation diagram to select the conflict resolution plan; If only A1 and B1 are approved in the stop plan, use the stop plan to select the conflict resolution plan. Based on the known prohibited and required stops, if stop plan B2 is approved and stop plan A2 is not approved, select the conflict object A train. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals; if the stop plan A2 is passing and the stop plan B2 is not passing, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time B is less than A, select the conflict object A train , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station The train moving time is the train moving time B plus the time between different arrivals; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If the train waiting time B is equal to A, use the stop preference to select the conflict resolution plan. If the stop preference A2 is stop and the stop preference B2 is pass, the conflict object A train is selected. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the time between different arrivals; if the stop preference A2 is pass, and the stop preference B2 is stop, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If stop preference A2 and stop preference B2 are both stop or pass, use the number of running line drawing rounds to select the conflict resolution plan; Use the stop plan to select a conflict resolution plan. Based on the known prohibited and required stops, if stop plan A1 is a non-pass and stop plan B1 is a pass, select the conflict object A train. , conflict location A is the station The train moving time is the train moving time A plus the meeting interval time; if the stop plan A1 is passing and the stop plan B1 is not passing, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time A is less than B, select the conflict object A train , conflict location A is the station The train moving time is the train moving time A plus the meeting time; if the train waiting time A is greater than B, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If the train waiting time A is equal to B, use the stop preference to select the conflict resolution plan. If the stop preference A1 is stop and the stop preference B1 is pass, select the conflict object A train. , conflict location A is the station , the train moving time is the train moving time A plus the meeting interval time; if the stop preference A1 is passing and the stop preference B1 is stopping, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If stop preference A1 and stop preference B1 are both stop or pass, use the operation diagram drawing round number to select the conflict resolution plan; After conflict resolution, update the output train timetable.

[0032] In the embodiment of the present invention, Figure 5 As shown in the figure, four conflict resolution schemes are designed. Among them, conflict resolution scheme 1 selects the conflict object A train , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time interval between different arrivals. Conflict resolution plan 2, select the conflict object B train , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time interval between different arrivals. Conflict resolution plan 3, select the conflict object A train , the conflict location is the station , the train moving time is the time between trains. Conflict resolution plan 4, select the conflict object B train , the conflict location is the station , the train movement time is the meeting interval time.

[0033] 1) According to the meeting plan generated based on the staggered stop principle, the conflict object A is determined to be train , conflict object B is a train The stop preferences at the conflicting station are recorded as stop preference A and stop preference B. There are two types of stop preferences, namely, passing is recorded as 0 and stopping is recorded as 2.

[0034] According to the known prohibited and required stops, it is determined that the conflicting object A is the train , conflict object B is a train The stop plans at the conflicting station are recorded as stop plan A and stop plan B. There are three types of stop plans, namely, passing is recorded as 0, flexible stopping is recorded as 1, and stopping is recorded as 2. Passing means prohibited stopping, stopping means mandatory stopping, and flexible stopping means non-prohibited stopping and mandatory stopping.

[0035] 2) Use the stop preference to select a conflict resolution plan. If stop preference A is Stop and stop preference B is Pass, it means that the down train is preferred to give way to the up train. Select conflict resolution plan 1 and go to 4). If stop preference A is Pass and stop preference B is Stop, it means that the up train is preferred to give way to the down train. Select conflict resolution plan 2 and go to 4). If stop preference A is Stop and stop preference B is Stop, it means that there is no preference. Go to 3).

[0036] 3) Use the number of rounds of the operation diagram to select a conflict resolution plan. If the number of rounds of the current operation line is an even number, select conflict resolution plan 1 and go to 4). Otherwise, select conflict resolution plan 2 and go to 4).

[0037] 4) Use the stop plan to select a conflict resolution plan. If stop plan A is a flexible stop and stop plan B is approved, select conflict resolution plan 1 to overwrite the previous resolution plan and go to 8). If stop plan A is approved and stop plan B is a flexible stop, select conflict resolution plan 2 to overwrite the previous resolution plan and go to 8). If stop plans A and B are both approved, go to 5).

[0038] 5) Update the conflict resolution position. For conflict object A, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position A. For conflict object B, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position B. Compare the number of stations between the existing conflict resolution position and conflict resolution positions A and B, and select the nearest station as the new conflict resolution position.

[0039] 6) Use the location distance to select a conflict resolution plan. If conflict resolution location A is selected, select conflict resolution plan 3 to overwrite the previous resolution plan and go to 8). If conflict resolution location B is selected, select conflict resolution plan 4 to overwrite the previous resolution plan and go to 8). If the number of stations between the existing conflict resolution location and conflict resolution locations A and B is the same, go to 7).

[0040] 7) Use the number of rounds of the operation diagram to select a conflict resolution plan. If the number of rounds of the current operation line is an even number, select conflict resolution plan 3, overwrite the previous resolution plan, and go to 8). Otherwise, select conflict resolution plan 4 and go to 8).

[0041] In the embodiment of the present invention, Figure 6 As shown in the figure, six conflict resolution schemes are designed, among which conflict resolution scheme 1 selects the conflict object A train , conflict location A is the station , the train moving time is the train moving time A plus the meeting interval time; conflict resolution plan 2, select the conflict object B train , conflict location B is the station The train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; conflict resolution plan 3, select the conflict object A train , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the time between different arrivals; conflict resolution plan 4, select the conflict object B train , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the time between different arrivals; conflict resolution plan 5, select the conflict object A train , conflict location A is the station , the train moving time is the train moving time B plus the train interval time; conflict resolution plan 6, select the conflict object B train , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; 1) According to the meeting plan generated based on the staggered stop principle, determine the conflicting train A The stop preference at the conflicting location A is denoted as stop preference A1, and the conflicting object A train The stop preference at the conflicting location B is recorded as stop preference A2, and the conflicting object B train The stop preference at the conflicting location B is denoted as stop preference B1, and the conflicting train B The stop preference at the conflicting position A is recorded as stop preference B2; 2) Determine the conflicting train A based on the known prohibited and required stops The stop plan at the conflicting location A is recorded as stop plan A1, and the conflicting train A The stop plan at the conflicting location B is recorded as stop plan A2, and the conflicting train B The stop plan at the conflicting location B is recorded as stop plan B1, and the conflicting train B The stop plan at the conflicting position A is recorded as stop plan B2; 3) If stop plans A1, A2, B1 and B2 are all approved, proceed to conflict resolution plan 5 or 6 and go to 4). Otherwise, go to 8); 4) Update the conflict resolution position. For conflict object A, traverse all stations from conflict position A to the train departure point, and find the first non-stopping station as conflict resolution position A; for conflict object B, traverse all stations from conflict position B to the train departure point, and find the first non-stopping station as conflict resolution position B. Compare the number of stations between the existing conflict resolution position and conflict resolution positions A and B, and select the nearest station as the new conflict resolution position. 5) Use the location distance to select a conflict resolution plan. If conflict resolution location A is selected, select conflict resolution plan 5 and go to 18. If conflict resolution location B is selected, select conflict resolution plan 4) and go to 18. If the number of stations between the existing conflict resolution location and conflict resolution locations A and B is the same, go to 6); 6) Use the train moving time to select a conflict resolution plan, compare the train waiting time, if the train waiting time B is less than A, select conflict resolution plan 5 and go to 16); if the train waiting time B is greater than A, select conflict resolution plan 6 and go to 16); if the train waiting time B is equal to A, go to 7); 7) Use the number of rounds of the operation diagram to select a conflict resolution plan. If the number of rounds of the current operation line is an even number, select conflict resolution plan 5 and go to 16); otherwise, select conflict resolution plan 6 and go to 16); 8) If stop plans A1 and B1 are approved, proceed to conflict resolution plan 3 or 4 and go to 9); otherwise proceed to conflict resolution plan 1 or 2 and go to 13); 9) Use the stop plan to select a conflict resolution plan. According to the known prohibited stops and required stops, if the stop plan B2 is approved and the stop plan A2 is not approved, select conflict resolution plan 3 and go to 16); if the stop plan A2 is approved and the stop plan B2 is not approved, select conflict resolution plan 4 and go to 16); in other cases, go to 10); 10) Use the train moving time to select a conflict resolution plan, compare the train waiting time, if the train waiting time B is less than A, select conflict resolution plan 3 and go to 16); if the train waiting time B is greater than A, select conflict resolution plan 4 and go to 16); if the train waiting time B is equal to A, go to 11); 11) Use the stop preference to select a conflict resolution plan. If stop preference A2 is stop and stop preference B2 is pass, select conflict resolution plan 3, overwrite the previous resolution plan, and go to 16); if stop preference A2 is pass and stop preference B2 is stop, select conflict resolution plan 4, overwrite the previous resolution plan, and go to 16); if stop preference A2 and stop preference B2 are both stop or pass, go to 12); 12) Use the number of running line paving rounds to select a conflict resolution plan. If the current number of running line paving rounds is an even number, select conflict resolution plan 3, overwrite the previous resolution plan, and go to 16). Otherwise, select a conflict resolution plan, overwrite the previous resolution plan, and go to 16); 13) Use the stop plan to select a conflict resolution plan. According to the known prohibited and required stops, if stop plan A1 is not passed and stop plan B1 is passed, select conflict resolution plan 1, overwrite the previous resolution plan, and go to 17); if stop plan A1 is passed and stop plan B1 is not passed, select conflict resolution plan 2, overwrite the previous resolution plan, and go to 17); in other cases, go to 14); 14) Use the train moving time to select a conflict resolution plan, compare the train waiting time, if the train waiting time A is less than B, select conflict resolution plan 1, overwrite the previous resolution plan, and go to 17); if the train waiting time A is greater than B, select conflict resolution plan 2, overwrite the previous resolution plan, and go to 17); if the train waiting time A is equal to B, go to 15); 15) Use the stop preference to select a conflict resolution plan. If stop preference A1 is stop and stop preference B1 is pass, select conflict resolution plan 1, overwrite the previous resolution plan, and go to 17); if stop preference A1 is pass and stop preference B1 is stop, select conflict resolution plan 2, overwrite the previous resolution plan, and go to 17); if stop preference A1 and stop preference B1 are both stop or pass, go to 16); 16) Use the number of rounds of the operation diagram to select a conflict resolution plan. If the number of rounds of the current operation line is an even number, select conflict resolution plan 1, overwrite the previous resolution plan, and go to 17). Otherwise, select conflict resolution plan 2, overwrite the previous resolution plan, and go to 17); 17) Use conflict resolution solutions to resolve conflicts; 18) Output train timetable.

[0042] The embodiments of the present invention can resolve conflicts between different contents and improve the efficiency of train operation diagram compilation.

[0043] Based on any of the above embodiments, the use of a train movement algorithm based on a point arrangement time window to perform point arrangement time movement includes: Reading a freight train departure timetable, and generating a freight train current point schedule according to the freight train departure timetable; Traverse the existing freight train deployment schedule and locate the location number and the corresponding current departure times of freight trains ; Traverse the initial distribution schedule of freight trains and find the location number The corresponding freight train's original left boundary value ; Traverse the initial distribution schedule of freight trains, the current left boundary value of freight trains , locate its position number ; If the original left boundary value of the freight train Equal to the current left boundary value , continue to compare the next freight train, ; If the original left boundary value of the freight train Greater than the current left boundary value , traverse the existing freight train distribution schedule, no greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the freight train; If the original left boundary value of the freight train Less than the current left boundary value , traverse the initial freight train timetable and delete the position number to Between time points, and add a new points, the interval between new points is the restricted interval period; Traverse the existing freight train distribution schedule, greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the downlink freight train; Output freight train departure times.

[0044] In the embodiment of the present invention, Figure 7 As shown in FIG. 1 , the train movement algorithm based on the time window of the point distribution includes the following steps: 1) Enter the departure time of the freight train; 2) Use the down-bound freight train departure timetable to generate the current down-bound freight train distribution timetable; 3) Traverse the existing timetable of down-going freight trains and locate the position number and the corresponding current departure times of downbound freight trains ; 4) Traverse the initial layout timetable of the downlink freight train and find the position number The corresponding left boundary value of the downgoing freight train ; 5) Traverse the initial layout timetable of the down-going freight train, and the current left boundary value of the down-going freight train , locate its position number ; 6) If the original left boundary value of the downgoing freight train Equal to the current left boundary value , continue to compare the next freight train, , go to 3), otherwise go to 7); 7) If the original left boundary value of the downgoing freight train Greater than the current left boundary value , traverse the existing layout timetable of down-going freight trains, no greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial layout timetable of the downlink freight train, and go to 10), otherwise go to 8); 8) If the original left boundary value of the downgoing freight train Less than the current left boundary value , traverse the initial layout timetable of down-going freight trains and delete the position number to Between time points, and add a new points, the interval between new points is the restricted interval period; 9) Traverse the existing layout timetable of downgoing freight trains, which is greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial layout timetable of the downlink freight train; 10) Use the updated down-bound freight train existing timetable to update the down-bound freight train departure timetable, and the same applies to the up-bound trains; 11) Output freight train departure time.

[0045] The embodiment of the present invention updates the departure time of freight trains and improves the accuracy of the train operation diagram by moving the train departure time within the layout time window and replacing the train at the layout time point.

[0046] According to the present invention, a method for compiling a single-track railway train operation diagram based on conflict resolution is provided, wherein the conflict resolution of arrival and departure lines is performed based on the insufficient arrival and departure line identification and resolution method, comprising: Read train schedules and station schedules, set minimum train movement time, and determine the number of arrival and departure lines at each station; Traverse all stations and all trains passing through each station to locate the train At the station The train arrival time is taken as the time tangent point ; Traverse the stations All trains, find stations At the time cut point For all trains occupying the arrival and departure tracks, a candidate set of trains to be moved is generated, and the number of trains occupying the arrival and departure tracks is counted; If the number of arrival and departure tracks occupied by the train is greater than the number of arrival and departure tracks at the station, the number of passenger trains, freight trains, downgoing freight trains, and upgoing freight trains in the candidate set of trains to be moved are counted; If the number of freight trains is 0, output the train departure time and the number of rounds of running line drawing; If the number of freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of a train, and the number of running line laying rounds remains unchanged. If the number of freight trains is 2, of which the number of downgoing freight trains is 1 and the number of upgoing freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of one train, and the number of running line laying rounds remains unchanged; If the number of downgoing freight trains is not less than the number of upgoing trains, the downgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; otherwise, the upgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; Move the freight train to be moved back by the minimum moving time of one train, locate the number of rounds of running line drawing when the train to be moved is added, roll back the timetable of all trains to the drawing result of round-1 before the train to be moved is added, initialize the stop plan and stop time of all trains, and update the number of rounds of running line drawing to round-1; Output the train departure time and the number of rounds of running line drawing.

[0047] In the embodiment of the present invention, Figure 8 As shown in the figure, the insufficient arrival and departure line identification and relief algorithm includes the following steps: 1) Input train schedule and station schedule; 2) Set the minimum train movement time; 3) Determine the number of arrival and departure tracks at each station; 4) Traverse all stations and all trains passing through each station to locate the train At the station The train arrival time is taken as the time tangent point ; 5) Traverse the stations along the way All trains, find stations At the time cut point For all trains occupying the arrival and departure tracks, a candidate set of trains to be moved is generated, and the number of trains occupying the arrival and departure tracks is counted; 6) Determine whether the number of arrival and departure tracks occupied by the train is greater than the number of arrival and departure tracks at the station. If so, go to 7), otherwise go to 4); 7) Count the number of passenger trains, freight trains, downgoing freight trains and upgoing freight trains in the candidate set of trains to be moved; 8) If the number of freight trains is 0, it means that the shortage of arrival and departure lines is caused by passenger trains, and there are no freight trains to be moved, go to 13); if the number of freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train ii to be moved, go to 10); if the number of freight trains is 2, of which the number of downgoing freight trains is 1 and the number of upgoing freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train ii to be moved, go to 10); for other cases, go to 9); 9) If the number of downgoing freight trains is not less than the number of upgoing trains, then the downgoing freight train with the shortest arrival time at station k in the alternative concentration is selected as freight train ii to be moved, and go to 12); otherwise, the upgoing freight train with the shortest arrival time at station k in the alternative concentration is selected as freight train ii to be moved, and go to 12); 10) Determine whether the freight train to be moved is the last train being laid out, if yes, go to 11), otherwise go to 12); 11) Wait for the freight train to move back one minimum moving time of the train, the number of rounds of running line laying remains unchanged, go to 13); 12) The freight train to be moved is moved back by the minimum moving time of one train, the number of rounds of running line drawing when the train to be moved is located, the timetable of all trains is rolled back to the drawing result of round-1 before the train to be moved is added, the stop plan and stop time of all trains are initialized, and the number of rounds of running line drawing is updated to round-1; 13) Output the train departure time and the number of rounds of running line drawing.

[0048] The embodiment of the present invention counts the number of arrival and departure track occupancy based on the train arrival time tangent point, thereby realizing identification of insufficient arrival and departure track quantity. Based on the number of up and down trains occupying the arrival and departure track, a train is selected to be moved back, thereby realizing relief of insufficient arrival and departure track quantity.

[0049] The train operation diagram of a single-track railway has the significant characteristics of high complexity of passenger and freight train intersections, strong flexibility of freight train stop plans, and non-fixed train operation order. The existing train operation diagram of a single-track railway is still manually compiled by map makers. During the manual compilation process, complex conditions such as passenger trains, skylight settings, and the number of arrival and departure lines are considered at the same time. New freight train lines are added one by one, and conflicts between freight cars, passenger cars, skylights, and arrival and departure lines are judged and resolved in turn, and a truck stop plan is given. However, with the gradual increase in the complexity of the passenger train structure, the difficulty of resolving running line conflicts continues to increase, and its compilation time is also extended, involving a large number of repetitive operations, which consumes manpower and time costs and reduces the efficiency of the operation diagram compilation.

[0050] The method for compiling a single-track railway train operation diagram based on conflict resolution provided in an embodiment of the present invention realizes rapid identification and automatic resolution of various types of conflicts through cycles of line drawing, train attribute update and restoration, train line conflict detection and resolution, identification and resolution of insufficient arrival and departure lines, and train movement based on time windows of point layout, thereby reducing manual judgment and repeated operations of conflicts by map compilers, and improving compilation efficiency by cycles of drawing opposite trains one by one on the single-track railway and secondary cycles of resolving conflicts one by one.

[0051] Fig. 9 An example of a physical structure diagram of an electronic device is shown in FIG. Fig. 9 As shown, the server may include: a processor (processor) 910, a communication interface (Communications Interface) 920, a memory (memory) 930 and a communication bus 940, wherein the processor 910, the communication interface 920, and the memory 930 communicate with each other through the communication bus 940. The memory 930 includes a computer program, an operating system, and the acquired graph structure data. The processor 910 can call the logic instructions in the memory 930 to execute a single-track railway train diagram compilation method based on conflict resolution, the method comprising: obtaining the train layout time, the total number of up and down passenger trains, and the total number of up and down freight trains; generating an initial train timetable according to the train layout time, the total number of up and down passenger trains, and the total number of up and down freight trains; laying out train lines according to the initial train timetable, and performing conflict resolution when laying out each train line, the conflict resolution comprising performing interval time conflict resolution based on a dynamic generation method of running lines for conflict resolution, and performing arrival and departure line conflict resolution based on an arrival and departure line shortage identification and resolution method; generating a single-track railway train diagram after all train running lines are laid out.

[0052] In addition, the logic instructions in the above-mentioned memory 930 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, in essence, or the part that contributes to the relevant technology 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.

[0053] 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 single-track railway train diagram compilation method based on conflict resolution provided by the above-mentioned methods, the method comprising: obtaining the train layout time, the total number of up and down passenger trains and the total number of up and down freight trains; generating an initial train timetable according to the train layout time, the total number of up and down passenger trains and the total number of up and down freight trains; laying out train lines according to the initial train timetable, and performing conflict resolution when laying out each train line, the conflict resolution comprising performing interval time conflict resolution based on a dynamic generation method of lines for conflict resolution, and performing arrival and departure line conflict resolution based on a method for identifying and resolving insufficient arrival and departure lines; generating a single-track railway train diagram after all train lines have been laid out.

[0054] 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 relevant technology 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 embodiment.

[0055] 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 compiling a single-track railway train operation diagram based on conflict resolution, characterized in that: include: Obtain train deployment time, total number of up and down passenger trains, and total number of up and down freight trains; Generate an initial train schedule according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; The train running lines are laid out according to the initial train timetable, and conflicts are resolved when laying out each train running line. The conflict resolution includes resolving interval conflicts based on a dynamic generation method of running lines for conflict resolution, and resolving arrival and departure line conflicts based on an arrival and departure line shortage identification and resolution method. After all train running lines are laid out, a single-track railway train operation diagram is generated.

2. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 1, characterized in that: The method for dynamically generating running lines based on conflict resolution performs time interval conflict resolution, including: Generate a plan for meeting up and down freight trains according to the train deployment time, the total number of up and down passenger trains, and the total number of up and down freight trains; Use the uplink and downlink freight train meeting plan to calculate the restricted section cycle time; Calculate the arrival and departure time of up and down trains at each station based on the total number of up and down passenger trains and the total number of up and down freight trains and the initial point-distribution departure time of up and down trains in the restricted interval cycle time, interval running time, additional start and stop time, stop plan and stop time; Use the arrival and departure times of up and down trains at each station to generate a station timetable and sort them by the time the trains arrive at the station; Use the dispersed continuous dispatching time interval insufficient conflict detection algorithm to perform the dispersed continuous dispatching time interval insufficient conflict detection; use the train cycle time interval insufficient conflict detection algorithm to perform the train cycle time interval insufficient conflict detection; The detected conflicts are written into the conflict record table, in which the order of conflict records of a specific type is modified and the conflict records of a specific type are merged; The conflict of the running line is resolved according to the conflict record table, wherein the conflict of the opposite train section is resolved by using the conflict resolution algorithm of the opposite train section; the conflict of the opposite train station is resolved by using the conflict resolution algorithm of the opposite train station; Determine whether the departure time of the two adjacent freight trains in the same direction meets the minimum departure interval. If not, use the minimum departure interval to update the departure time of the following train. Use the train movement algorithm based on the time window of the point to move the point time; The initial train schedule is updated according to the point distribution time movement result.

3. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 2, characterized in that: The method of using the insufficient scattered burst interval time conflict detection algorithm to perform the insufficient scattered burst interval time conflict detection includes: Traversing all freight trains in the initial train schedule; If the rear car The next stop is passed, which requires the dispersed continuous interval time to record the following vehicle The departure time at the previous stop is , the arrival time is , the front car The departure time at the next stop is , the arrival time is ; Use the interval running time of the opposite train to generate the interval time t of the dispersed continuous trains interval ,if and , the interval time between dispersed trains is t interval is the sum of the existing interval time, the interval time of different arrivals, and the interval time of meeting vehicles. If and , the interval between dispersed bursts is then two intervals between passing vehicles; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient interval time for dispersed and continuous dispatch of downlink or uplink same-direction freight trains, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

4. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 2, characterized in that: The method of using a train cycle interval insufficient conflict detection algorithm to perform train cycle interval insufficient conflict detection includes: Traverse all freight trains in the initial train schedule and define the downgoing freight trains in the same direction and ,train For the rear car is the preceding train; traverses all stations, the stations that the two trains pass through at the same time and ,station For the next stop For the previous stop; record the following car The departure time at the previous stop is , the arrival time at the next stop is , the front car The departure time at the previous stop is , the arrival time at the next stop is ; Traverse all stations. If it is the station before the train's departure station and final destination station, the train cycle interval is t interval is the interval time between trains. At other stations, if the departure time difference between the two trains is not greater than the restricted interval cycle time, the train cycle interval time is t interval is the interval between trains, otherwise the train cycle interval is t interval is the limit interval cycle time; if and t interval , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generating a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, recording at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, and putting it into a conflict record table; if , the rear vehicle moves backward, and the current interval time is calculated as , calculate the backward moving time as t interval , generate a conflict of insufficient train period interval time for downlink or uplink freight trains in the same direction, record at least one of the conflict type, conflict object, conflict position, conflict time, and train movement time, put them into a conflict record table, and output the conflict record table.

5. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 4, characterized in that: The algorithm for resolving the conflict between opposite train stations includes: Read the conflict record table. If the conflict type is an oncoming train station intersection conflict, read the conflict object A as the train , conflict object B is a train , the conflict location is the station ; According to the staggered stop principle, the meeting plan is generated, and the conflict object A is determined to be a train. , conflict object B is a train , the stop preferences at the conflicting stations are recorded as stop preference A and stop preference B respectively; according to the known prohibited stop stations and required stop stations, the conflicting object A is determined to be train , conflict object B is a train , the stop plans at the conflicting stations are recorded as stop plan A and stop plan B respectively; Use the stop preference to select a conflict resolution solution. If stop preference A is to stop and stop preference B is to pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is pass and stop preference B is stop, the conflicting train B is selected. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop preference A is stop and stop preference B is stop, use the operation diagram drawing round number to select the conflict resolution plan; Alternatively, use the stop plan to select a conflict resolution solution. If stop plan A is a flexible stop and stop plan B is a pass, select the conflict object A train. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , the conflict location is the station , the train movement time is the time between different arrivals; If stop plan A is through and stop plan B is flexible stop, select conflicting train B. , the conflict location is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , the conflict location is the station , the train movement time is the time between different arrivals; Alternatively, if both stop plan A and stop plan B are passed, update the conflict resolution position. For conflict object A, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position A; for conflict object B, traverse all stations from the conflict position to the train departure point, and find the first non-stopping station as the conflict resolution position B; compare the conflict resolution position and the number of stations between conflict resolution positions A and B, and select the nearest station as the new conflict resolution position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , the conflict location is the station , the train movement time is the meeting interval time; if the conflict resolution position B is selected, the conflict object B train is selected , the conflict location is the station , the train movement time is the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, the conflict resolution scheme is selected using the number of rounds of the operation diagram; The method of using the oncoming train station intersection conflict resolution algorithm to resolve the oncoming train station intersection conflict comprises: Determine the conflict object, conflict location and train movement time based on the selected conflict resolution plan; Traverse all stations from the conflict location to the train departure point, excluding the conflict location station, and find the first non-stopping station as the conflict resolution location; If the location of conflict resolution is the train departure station, then increase the train departure time by one train movement time, traverse all stations from the conflict resolution location to the train terminal, and initialize the stop plans and stop times of all trains; If the location of conflict resolution is not the train departure station, determine whether there is a stop at the location of conflict resolution. If there is a stop, increase the stop time by one train movement time. Otherwise, increase the stop time by one train movement time. Determine whether the train stop time is less than the minimum stop time. If so, increase it to the minimum stop time. Otherwise, do not change the stop time and output the updated train timetable.

6. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 4, characterized in that: The method of using the oncoming train section intersection conflict resolution algorithm to resolve the oncoming train section intersection conflict includes: Read the conflict record table. If the conflict type is a cross-section conflict between opposite trains, the conflict object A is a train. , conflict object B is a train , conflict location A is the station , conflict location B is the station ; According to the meeting plan generated based on the staggered stop principle, the conflicting train A is determined The stop preference at the conflicting location A is denoted as stop preference A1, and the conflicting object A train The stop preference at the conflicting location B is recorded as stop preference A2, and the conflicting object B train The stop preference at the conflicting location B is denoted as stop preference B1, and the conflicting train B The stop preference at the conflicting position A is recorded as stop preference B2; Determine the conflicting train A based on the known prohibited and required stops. The stop plan at the conflicting location A is recorded as stop plan A1, and the conflicting train A The stop plan at the conflicting location B is recorded as stop plan A2, and the conflicting train B The stop plan at the conflicting location B is recorded as stop plan B1, and the conflicting train B The stop plan at the conflicting position A is recorded as stop plan B2; If the stop plans A1, A2, B1 and B2 are all passed, update the conflict relief position. For the conflict object A, traverse all the stations from the conflict position A to the train departure point, and find the first non-stopping station as the conflict relief position A; for the conflict object B, traverse all the stations from the conflict position B to the train departure point, and find the first non-stopping station as the conflict relief position B. Compare the existing conflict relief position and the number of stations between the conflict relief positions A and B, and select the nearest station as the new conflict relief position; Use the location distance to select a conflict resolution solution. If conflict resolution location A is selected, select conflict object A train. , conflict location A is the station The train moving time is the train moving time B plus the train interval time. If the conflict resolution position B is selected, the conflict object B train is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the number of stations between the existing conflict resolution position and conflict resolution positions A and B is the same, use the train movement time to select the conflict resolution plan, compare the train waiting time, and if the train waiting time B is less than A, select the conflict object A train , conflict location A is the station The train moving time is the train moving time B plus the train interval time; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time A plus the meeting interval time; If the train waiting time B is equal to A, use the number of rounds of the operation diagram to select the conflict resolution plan; If only A1 and B1 are approved in the stop plan, use the stop plan to select the conflict resolution plan. Based on the known prohibited and required stops, if stop plan B2 is approved and stop plan A2 is not approved, select the conflict object A train. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals; if the stop plan A2 is passing and the stop plan B2 is not passing, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time B is less than A, select the conflict object A train , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station The train moving time is the train moving time B plus the time between different arrivals; if the train waiting time B is greater than A, the conflicting train B is selected. , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If the train waiting time B is equal to A, use the stop preference to select the conflict resolution plan. If the stop preference A2 is stop and the stop preference B2 is pass, the conflict object A train is selected. , conflict location B is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the time between different arrivals; if the stop preference A2 is pass, and the stop preference B2 is stop, the conflict object B train is selected , conflict location A is the station The train movement time is the time between different arrivals plus the time between trains meeting each other. At the same time, the conflicting train A is selected. , conflict location A is the station , the train moving time is the train moving time A plus the interval time of different arrivals; If stop preference A2 and stop preference B2 are both stop or pass, use the number of running line drawing rounds to select the conflict resolution plan; Use the stop plan to select a conflict resolution plan. Based on the known prohibited and required stops, if stop plan A1 is a non-pass and stop plan B1 is a pass, select the conflict object A train. , conflict location A is the station The train moving time is the train moving time A plus the meeting interval time; if the stop plan A1 is passing and the stop plan B1 is not passing, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; Use the train moving time to select the conflict resolution plan, compare the train waiting time, if the train waiting time A is less than B, select the conflict object A train , conflict location A is the station The train moving time is the train moving time A plus the meeting time; if the train waiting time A is greater than B, the conflicting train B is selected. , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If the train waiting time A is equal to B, use the stop preference to select the conflict resolution plan. If the stop preference A1 is stop and the stop preference B1 is pass, select the conflict object A train. , conflict location A is the station , the train moving time is the train moving time A plus the meeting interval time; if the stop preference A1 is passing and the stop preference B1 is stopping, the conflict object B train is selected , conflict location B is the station , the train moving time is the train moving time B plus the interval time of different arrivals and the interval time of meeting trains; If stop preference A1 and stop preference B1 are both stop or pass, use the operation diagram drawing round number to select the conflict resolution plan; After conflict resolution, update the output train timetable.

7. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 2, characterized in that: The train movement algorithm based on the time window for the point arrangement is used to move the point arrangement time, including: Reading a freight train departure timetable, and generating a freight train current point schedule according to the freight train departure timetable; Traverse the existing freight train deployment schedule and locate the location number and the corresponding current departure times of freight trains ; Traverse the initial distribution schedule of freight trains and find the location number The corresponding freight train's original left boundary value ; Traverse the initial distribution schedule of freight trains, the current left boundary value of freight trains , locate its position number ; If the original left boundary value of the freight train Equal to the current left boundary value , continue to compare the next freight train, ; If the original left boundary value of the freight train Greater than the current left boundary value , traverse the existing freight train distribution schedule, no greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the freight train; If the original left boundary value of the freight train Less than the current left boundary value , traverse the initial freight train timetable and delete the position number to Between time points, and add a new points, the interval between new points is the restricted interval period; Traverse the existing freight train distribution schedule, greater than the position number The time points remain unchanged, and the other time points are updated to the corresponding position times in the initial distribution timetable of the freight train. The updated existing distribution timetable of the freight train is used to update the departure timetable of the downlink freight train; Output freight train departure times.

8. The method for compiling a single-track railway train operation diagram based on conflict resolution according to claim 1, characterized in that: The method for identifying and resolving the arrival and departure line shortage is used to resolve the arrival and departure line conflict, including: Read train schedules and station schedules, set minimum train movement time, and determine the number of arrival and departure lines at each station; Traverse all stations and all trains passing through each station to locate the train At the station The train arrival time is taken as the time tangent point ; Traverse the stations All trains, find stations At the time cut point For all trains occupying the arrival and departure tracks, a candidate set of trains to be moved is generated, and the number of trains occupying the arrival and departure tracks is counted; If the number of arrival and departure tracks occupied by the train is greater than the number of arrival and departure tracks at the station, the number of passenger trains, freight trains, downgoing freight trains, and upgoing freight trains in the candidate set of trains to be moved are counted; If the number of freight trains is 0, output the train departure time and the number of rounds of running line drawing; If the number of freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of a train, and the number of running line laying rounds remains unchanged. If the number of freight trains is 2, of which the number of downgoing freight trains is 1 and the number of upgoing freight trains is 1, the freight train with the largest arrival time at station k is selected as the freight train to be moved. If the freight train to be moved is the last train being laid out, the freight train to be moved is moved back by the minimum moving time of one train, and the number of running line laying rounds remains unchanged; If the number of downgoing freight trains is not less than the number of upgoing trains, the downgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; otherwise, the upgoing freight train with the shortest arrival time at station k in the candidate concentration is selected as the freight train to be moved; Move the freight train to be moved back by the minimum moving time of one train, locate the number of rounds of running line drawing when the train to be moved is added, roll back the timetable of all trains to the drawing result of round-1 before the train to be moved is added, initialize the stop plan and stop time of all trains, and update the number of rounds of running line drawing to round-1; Output the train departure time and the number of rounds of running line drawing.

9. 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 program, the method for compiling a single-track railway train operation diagram based on conflict resolution as described in any one of claims 1 to 8 is implemented.

10. A non-transitory readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it implements the method for compiling a single-track railway train operation diagram based on conflict resolution as described in any one of claims 1 to 8.

Images