Marshalling station resource application plan compiling method, device, equipment, medium and product

Abstract

The invention provides a marshalling station resource application plan compiling method and device, equipment, a medium and a product, and the method comprises the steps: determining a plurality of processing modules needing to be called according to the type of a to-be-processed train, and adding the to-be-processed train into a to-be-processed queue of the first processing module; each processing module determines resources occupied by the train or the train set, the start occupation time and the end occupation time; when the train or the train set starts to occupy resources, the train or the train set is moved from the to-be-processed queue to the in-processing set, and the current resource occupation state, the occupation starting time and the previous resource occupation ending time are updated. And after the processing is completed, judging whether the train or the train group has a next processing module, if so, adding the next module to-be-processed queue, and otherwise, ending the processing. According to the method, resource allocation is optimized through queue management, occupied resources, occupied starting time and occupied ending time of each train are determined, marshalling station resource occupation conflicts in a plan are effectively avoided, and the utilization rate of marshalling station resources is increased.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of marshalling station management, and in particular to a marshalling station resource utilization plan compilation method, device, equipment, medium and product. BACKGROUND

[0002] As a railway freight hub, the marshalling station undertakes the key functions of train flow distribution and train disassembly, and the compilation of its resource utilization plan directly affects the transportation efficiency of the entire railway network. The current marshalling station resource utilization plan compilation mainly adopts the manual experience compilation method, that is, the traditional marshalling station resource utilization plan is mainly compiled by relying on the working experience of dispatchers and historical data. Dispatchers arrange the use of tracks, machine operation and allocation of inspection teams according to train arrival forecasts, train flow forecasts and station equipment conditions, and rely on years of accumulated operation experience. Although this method can meet the daily operation needs to a certain extent, it has obvious limitations.

[0003] Current researches use optimization methods based on mathematical programming to solve the marshalling station resource allocation problem. These methods establish objective functions and constraints to seek the optimal solution of resource allocation. However, due to the complexity and randomness of the marshalling station operation process, these methods often need to make a large number of simplifying assumptions, and the actual application effect is limited. In addition, some researches use discrete event simulation technology to simulate the marshalling station operation process, and evaluate the effect of different resource allocation schemes through simulation experiments. Although the simulation method can better reflect the complexity of the operation process, it is mainly used for scheme evaluation rather than direct plan compilation, and the calculation time is longer, which is difficult to meet the requirements of real-time plan compilation.

[0004] The existing technology has many technical defects. First, the existing method lacks effective conflict detection and avoidance mechanisms when dealing with the coordinated allocation of multiple resources (tracks, machines, and inspection teams), and manual compilation is prone to resource occupation conflicts, leading to difficulties in plan execution. Although the mathematical programming method can consider the constraints, it is not adaptable to the dynamic changes of the operation environment. At the same time, the decision-making process of the manual experience compilation method is highly subjective, difficult to quantify and reproduce, and the existing automatic method can give the plan result, but its decision-making logic and intermediate process are not transparent enough, making it difficult to effectively adjust and optimize.

[0005] In summary, the existing marshalling station resource utilization plan compilation lacks effective conflict detection and avoidance mechanisms, and cannot realize the reasonable compilation of marshalling station resources, resulting in low utilization rate of marshalling station resources. SUMMARY

[0006] The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources.

[0007] The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources. The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources. The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources. The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources. The application provides a marshalling station resource utilization plan compiling method, device, equipment, medium and product, which solves the problem of low utilization of marshalling station resources in the prior art, and realizes reasonable compilation of marshalling station resources and improves the utilization of marshalling station resources. determining whether the second train or the third train has a next processing module; the third train is a train obtained by the second train group assembling; if the second train or the third train has a next processing module, the second train or the third train is added to a to-be-processed queue of the next processing module, a time for the second train or the third train to join the to-be-processed queue of the next processing module is determined as a departure time of the second train or the third train from the processing of the current processing module, and an end occupation time of the second train or the third train to the resource set is determined as a processing-joining time of the second train or the third train to the next processing module; if the second train or the third train does not have a next processing module, the processing of the second train or the third train is ended, and the end occupation time of the second train or the third train to the resource set is the departure time of the second train or the third train from the processing of the current processing module.

[0008] According to the marshalling station resource utilization plan compiling method provided by the application, the processing module is an arrival module. According to the to-be-processed queue of the processing module, the processing-joining of the processing module, the maximum resource amount of the resource set corresponding to the processing module and the resource occupation situation, the resource, the start occupation time and the end occupation time of the first train to the resource set corresponding to the processing module are determined, including: If the number of trains in the processing-joining of the current arrival module is less than the maximum number of arrival yard tracks, the start occupation time of the first train to the arrival yard track set is set as the time for the first train to join the to-be-processed queue of the arrival module; If the number of trains in the processing-joining of the current arrival module is equal to the maximum number of arrival yard tracks, the first train waits until the second train leaves the arrival yard track, and the start occupation time of the first train to the arrival yard track set is set as the sum of the end occupation time of the second train to the arrival yard track set and the train interval time; The arrival yard track occupied by the first train is determined as any unoccupied track in the arrival yard track set; If the type of the first train is an arrival disassembly train, a technical inspection module is called, the first train is added to a to-be-processed queue of the technical inspection module, a time for the first train to be added to the to-be-processed queue of the technical inspection module is a start occupation time of the first train occupying an arrival yard track set, the occupation of the technical inspection team, the start occupation time and the end occupation time of the first train are determined according to the to-be-processed queue of the technical inspection module, a processing-in-process set of the technical inspection module and a maximum number of the technical inspection team set, a time for the first train to be added to a to-be-processed queue of a disassembly module is an end occupation time of the first train occupying the technical inspection team set, and an end occupation time of the first train occupying the arrival yard track set is a processing-in-process set time of the first train to the disassembly module.

[0009] According to the grouping station resource utilization plan compilation method provided in the application, the processing module is a departure module; According to the to-be-processed queue of the processing module, the processing-in-process set of the processing module, the maximum resource quantity of the resource set corresponding to the processing module and the resource occupation situation, the resource, the start occupation time and the end occupation time of the first train occupying the resource set corresponding to the processing module are determined, including: If the number of trains in the processing-in-process set of the current departure module is less than the maximum number of departure yard tracks, the start occupation time of the first train occupying the departure yard track set is set as the time for the first train to be added to the to-be-processed queue of the departure module; If the number of trains in the processing-in-process set of the current departure module is equal to the maximum number of departure yard tracks, the first train waits until the second train leaves the departure yard track, the start occupation time of the first train occupying the departure yard track set is set as the sum of the end occupation time of the second train occupying the departure yard track set and the train interval time; The departure yard track occupied by the first train is determined as any unoccupied track in the departure yard track set; If the type of the first train is no-transfer, self-compiled departure or partial re-assembly, a technical inspection module is called, the first train is added to a to-be-processed queue of the technical inspection module, a time for the first train to be added to the to-be-processed queue of the technical inspection module is a start occupation time of the first train occupying the departure yard track set, the occupation of the technical inspection team, the start occupation time and the end occupation time of the first train are determined according to the to-be-processed queue of the technical inspection module, a processing-in-process set of the technical inspection module and a maximum number of the technical inspection team set; According to the type and direction of the first train, the waiting departure time length of the first train is determined, and if the first train is partial re-assembly, the unloading and loading operation time length of the first train is determined according to the direction of the first train; If the type of the first train is no-transfer or self-compiled departure, the end occupation time of the first train occupying the departure yard track set is set as the sum of the end occupation time of the first train occupying the technical inspection team set and the waiting departure time length. If the type of the first train is partial marshalling, the end occupation time of the first train occupying the departure yard track set is set as the sum of the end occupation time of the first train occupying the inspection team set, the coupling and uncoupling operation time of the first train and the waiting departure time.

[0010] According to the application, a marshalling station resource utilization plan compiling method is provided, which determines the occupied inspection team, the start occupation time and the end occupation time of the first train according to the to-be-processed queue of the inspection module, the processing set of the inspection module, the maximum number of the inspection team set and the occupation of the inspection team set, and comprises the following steps: If the number of trains in the processing set of the current inspection module is less than the maximum number of the inspection team set, the start occupation time of the first train occupying the inspection team set is set as the time when the first train joins the to-be-processed queue of the inspection module; If the number of trains in the processing set of the current inspection module is equal to the maximum number of the inspection team set, the first train waits until the second train completes the inspection operation, and the start occupation time of the first train occupying the inspection team set is set as the sum of the end occupation time of the second train occupying the inspection team set and the train interval time; The occupied inspection team of the first train is determined as any unoccupied inspection team in the inspection team set; The inspection operation time of the first train is determined according to the type of the first train; The end occupation time of the first train occupying the inspection team set is set as the sum of the start occupation time of the first train occupying the inspection team set and the inspection operation time of the first train.

[0011] According to the application, a marshalling station resource utilization plan compiling method is provided, wherein the processing module is a disassembly module; According to the to-be-processed queue of the processing module, the processing set of the processing module, the maximum resource amount of the resource set corresponding to the processing module and the occupation of the resource set, the resource, the start occupation time and the end occupation time of the first train occupying the resource set corresponding to the processing module are determined, and the method comprises the following steps: If the current planned departure train set is empty, the first train is regarded as a to-be-disassembled train; If the current planned departure train set is not empty, according to the order of the planned departure time, whether the number of vehicles currently assembled in each marshalling direction corresponding to each planned departure train in the planned departure train set meets the planned train marshalling requirement is judged in sequence, and if yes, the first train is regarded as a to-be-disassembled train; If not, the first train in the set of currently assembled vehicles in the set of planned departure trains that does not meet the marshalling requirements is regarded as the target train; in order of time in the queue of the train joining the disassembly module, whether the marshalling direction of the train in the queue exists the marshalling direction of the target train is judged in turn, if it exists, the first train in the queue that exists the marshalling direction of the target train is regarded as the train to be disassembled; if it does not exist, the first train is regarded as the train to be disassembled; If the number of trains in the set of the current disassembly module is less than the number of hump locomotives, the start occupation time of the set of hump locomotives occupied by the train to be disassembled is set as the time when the train to be disassembled joins the queue of the disassembly module; If the number of trains in the set of the current disassembly module is equal to the number of hump locomotives, the train to be disassembled waits until the second train completes the disassembly work, and the start occupation time of the set of hump locomotives occupied by the train to be disassembled is set as the sum of the end occupation time of the set of hump locomotives occupied by the second train and the train interval time; The hump locomotive occupied by the train to be disassembled is determined as any hump locomotive in the set of hump locomotives that is not occupied; The disassembly work duration of the train to be disassembled is determined according to the type and direction of the train to be disassembled; The end occupation time of the set of hump locomotives occupied by the train to be disassembled is the sum of the start occupation time and the disassembly work duration.

[0012] According to the marshalling station resource utilization planning method provided by the application, the processing module is the assembling module; According to the queue of the processing module, the set of the processing module, the maximum resource amount and the resource occupation condition of the corresponding resource set of the processing module, the resource, the start occupation time and the end occupation time of the first vehicle group occupying the corresponding resource set of the processing module are determined, the first vehicle group is the vehicle group that enters the queue of the processing module earliest, which comprises: The start occupation time of the first vehicle group occupying the corresponding marshalling yard track set of the assembling module is set as the time when the first vehicle group joins the queue of the assembling module; The marshalling yard track occupied by the first vehicle group is determined as any track in the set of marshalling yard tracks, which can park the vehicle in the direction of the first vehicle group, and the sum of the current number of parked vehicles and the number of vehicles of the first vehicle group does not exceed the maximum number of parked vehicles of the track; Whether the current set of planned departure trains is empty is judged; If the current set of planned departure trains is not empty, whether the number of vehicles currently assembled in each marshalling direction corresponding to each planned departure train in the set of planned departure trains meets the marshalling requirements of the planned train is judged in order of planned departure time; if not, the assembling module is called again; If yes, the scheduled departure train is regarded as a target train; for any marshalling train set of the target train in any marshalling direction, the first train set leaving the processing set of the marshalling module is the maximum value of the first train set joining the processing set and the marshalling operation time; wherein the marshalling time of the first train set is determined according to the type and direction of the target train.

[0013] According to the application, a marshalling station resource utilization plan compiling method is provided, wherein the processing module is a marshalling module; According to the to-be-processed queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupation of the corresponding resource set of the processing module, the resource occupied by the first train, the starting occupation time and the ending occupation time of the corresponding resource set of the processing module are determined, comprising: If the number of trains in the processing set of the current marshalling module is less than the number of peak and tail locomotives, the starting occupation time of the peak and tail locomotive set occupied by the first train is set as the time when the first train joins the to-be-processed queue of the marshalling module; If the number of trains in the processing set of the current marshalling module is equal to the number of peak and tail locomotives, the first train waits until the second train completes the marshalling operation, and the starting occupation time of the peak and tail locomotive set occupied by the first train is set as the sum of the ending occupation time of the peak and tail locomotive set occupied by the second train and the train interval time; The peak and tail locomotive occupied by the first train is determined as any unoccupied peak and tail locomotive in the peak and tail locomotive set; According to the type and direction of the first train, the marshalling operation time of the first train is determined; The ending occupation time of the peak and tail locomotive set occupied by the first train is set as the sum of the starting occupation time of the peak and tail locomotive set occupied by the first train and the marshalling operation time of the first train.

[0014] According to the application, a marshalling station resource utilization plan compiling method is provided, wherein according to the type of the to-be-processed train, the multiple processing modules required for the plan compilation processing of the to-be-processed train are determined, comprising: If the type of the to-be-processed train is no transfer, the multiple processing modules are in turn an arrival module and a departure module; If the type of the to-be-processed train is partial re-marshalling, the multiple processing modules are in turn an arrival module and a departure module; If the type of the to-be-processed train is arrival disassembly, the multiple processing modules are in turn an arrival module and a disassembly module; If the type of the to-be-processed train is self-marshalling departure, the multiple processing modules are in turn a marshalling module, a marshalling module and a departure module.

[0015] The application further provides a marshalling station resource utilization plan compiling device, which comprises a calling module and a plurality of processing modules; the plurality of processing modules comprise an arrival module, a disassembly module, an assembling module, a marshalling module, a departure module and a technical inspection module; The calling module is used for obtaining a train to be processed, determining a plurality of processing modules that need to be called for plan compiling processing of the train to be processed according to the type of the train to be processed, and adding the train to be processed into a to-be-processed queue of a first processing module, wherein the train to be processed is added into the to-be-processed queue of the first processing module at a train plan arrival time; the processing modules comprise the arrival module, the disassembly module, the assembling module, the marshalling module and the departure module; The processing module is used for determining resources, a start occupation time and an end occupation time of a first train or a first train set occupying a resource set corresponding to the processing module according to a to-be-processed queue of the processing module, a processing-in-process set of the processing module, a maximum resource quantity and a resource occupation condition of the resource set corresponding to the processing module, wherein the first train is a train that enters the to-be-processed queue earliest, and the first train set is a train set that enters the to-be-processed queue earliest; The processing module is further used for removing the first train or the first train set from the to-be-processed queue of the processing module and adding the first train or the first train set into the processing-in-process set of the processing module when the start occupation time of the first train or the first train set occupying the resource set corresponding to the processing module arrives; and the leaving time of the first train from the processing-in-process set is updated to the sum of the time when the first train or the first train set is added into the processing-in-process set and the working time; The processing module is further used for removing a second train or a second train set from the processing-in-process set of the processing module when the leaving time of the second train or the second train set from the processing-in-process set arrives, wherein the second train is a train that ends occupying the resource set corresponding to the processing module earliest, and the second train set is a train set that ends occupying the resource set corresponding to the processing module earliest; The processing module is further configured to determine whether the second train or the third train has a next processing module; the third train is a train obtained by the second train group assembling; if the second train or the third train has a next processing module, the second train or the third train is added to a processing queue of the next processing module, a processing queue time of the second train or the third train to the next processing module is determined as a departure time of the second train or the third train from the current processing module, and an end occupation time of the second train or the third train to the resource set is determined as a processing assembly time of the second train or the third train to the next processing module; if the second train or the third train does not have a next processing module, the processing of the second train or the third train is ended, and the end occupation time of the second train or the third train to the resource set is the departure time of the second train or the third train from the current processing module.

[0016] The application further provides an electronic device, including a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the marshalling station resource utilization plan compiling method according to any one of the above when executing the computer program.

[0017] The application further provides a non-transitory computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the marshalling station resource utilization plan compiling method according to any one of the above.

[0018] The application further provides a computer program product, which includes a computer program, and the computer program is executed by a processor to implement the marshalling station resource utilization plan compiling method according to any one of the above.

[0019] The marshalling station resource utilization plan compiling method, device, equipment, medium and product provided by the application determine a plurality of processing modules that need to be called according to the type of a train to be processed, and add the train to be processed to a processing queue of a first processing module; each processing module determines the resources occupied by a train or a train group, a start occupation time and an end occupation time; when the train or the train group starts to occupy the resources, the train or the train group is moved from the processing queue to a processing assembly, and the current resource occupation state and the start occupation time, and the last resource end occupation time are updated. After the processing is completed, it is determined whether the train or the train group has a next processing module, and if yes, the train or the train group is added to a processing queue of the next module, otherwise the processing is ended. The scheme of the application optimizes resource allocation through queue management, determines the occupied resources, the start occupation time and the end occupation time of each train, effectively avoids resource occupation conflicts in the plan, and thus realizes reasonable compilation of marshalling station resources and improves the utilization rate of the marshalling station resources. BRIEF DESCRIPTION OF DRAWINGS

[0020] In order to more clearly illustrate the technical solutions of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or prior art description. Obviously, the drawings in the following description are some embodiments of the present application, and other drawings can also be obtained by those skilled in the art without creative labor.

[0021] Figure 1 is a flowchart of the marshalling station resource utilization plan preparation method provided by the present application; Figure 2 is a train resource occupation example diagram provided by the present application; Figure 3 is a flowchart of the arrival module provided by the present application; Figure 4 is a flowchart of the departure module provided by the present application; Figure 5 is a flowchart of the technical inspection module provided by the present application; Figure 6 is a flowchart of the disassembly module provided by the present application; Figure 7 is a flowchart of the gathering module provided by the present application; Figure 8 is a flowchart of the marshalling module provided by the present application; Figure 9 is a structural diagram of the electronic device provided by the present application. DETAILED DESCRIPTION

[0022] In order to make the purpose, technical solutions and advantages of the present application more clear, the following will combine the drawings in the present application to clearly and completely describe the technical solutions in the present application. Obviously, the described embodiments are some embodiments of the present application, not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the protection scope of the present application.

[0023] The technical solutions of the present application and how the present application solves the above technical problems will be described in detail in the following specific embodiments. The following several specific embodiments can be combined with each other, and the same or similar concepts or processes can not be described again in some embodiments. The following will combine Figures 1-8 The marshalling station resource utilization plan preparation method of the present application is described.

[0024] Figure 1 is a flowchart of the marshalling station resource utilization plan preparation method provided by the present application, as Figure 1 shown, the method comprises the following: Step 101, obtaining a train to be processed, determining a plurality of processing modules to be called for planning and processing of the train to be processed according to a type of the train to be processed, and adding the train to be processed into a to-be-processed queue of a first processing module, a time for the train to be processed to be added into the to-be-processed queue of the first processing module being a train plan arrival time.

[0025] The processing module includes an arrival module, a disassembly module, an assembly module, a marshalling module, a departure module and a technical inspection module.

[0026] Step 102, determining, by the processing module, a resource of a resource set corresponding to the processing module, a start occupation time and an end occupation time occupied by a first train or a first train set according to a to-be-processed queue of the processing module, a processing-in-process set of the processing module, a maximum resource amount of the resource set corresponding to the processing module and a resource occupation situation, the first train being a train entering the to-be-processed queue earliest and the first train set being a train set entering the to-be-processed queue earliest; Step 103, removing the first train or the first train set from the to-be-processed queue of the processing module and adding the first train or the first train set into the processing-in-process set of the processing module when the start occupation time of the resource set corresponding to the processing module occupied by the first train or the first train set comes, and updating a leaving time of the first train or the first train set from the processing-in-process set as a sum of a time for the first train or the first train set to be added into the processing-in-process set and a work time; Step 104, removing a second train or a second train set from the processing-in-process set of the processing module when a leaving time of the second train or the second train set from the processing-in-process set comes, the second train being a train leaving the processing-in-process set of the processing module earliest and the second train set being a train set leaving the processing-in-process set of the processing module earliest; Step 105, judging whether a next processing module exists for the second train or a third train.

[0027] The third train is a train obtained by the second train set being assembled.

[0028] Step 106, if the next processing module exists for the second train or the third train, adding the second train or the third train into a to-be-processed queue of the next processing module, determining a time for the second train or the third train to be added into the to-be-processed queue of the next processing module as a leaving time of the second train or the third train from the processing-in-process set of the current processing module, and determining an end occupation time of the resource set occupied by the second train or the third train as a time for the second train or the third train to be added into the processing-in-process set of the next processing module; Step 107, if the next processing module does not exist for the second train or the third train, ending the processing of the second train or the third train, and the end occupation time of the resource set by the second train or the third train being the leaving time of the second train or the third train from the processing-in-process set of the current processing module.

[0029] In practical applications, the types of trains include four types of no adjustment transfer, partial reorganization, arrival disassembly and self-organization departure. The operation of the train at the marshalling station is divided into arrival, disassembly, gathering, marshalling, departure, and requires resources such as tracks, technical inspection teams, hump locomotives and tail-end locomotives. Based on this, the service node is defined as the arrival yard track (the track that can perform arrival operation) set, the marshalling yard track (the track that can perform disassembly / gathering / marshalling operation) set, the departure yard track (the track that can perform departure operation) set, the technical inspection team set, the hump locomotive set and the tail-end locomotive set. The above service nodes all have maximum service capacity constraints, that is, the maximum resource quantity. And the resource utilization plan is compiled in modules for each operation (arrival, disassembly, gathering, marshalling and departure) of the marshalling station.

[0030] In combination Figure 2 The processing flow and resource occupation of trains of different types are described. Figure 2 is a train resource occupation example provided by the application.

[0031] Among them, is the arrival yard a track set that can be connected to the train direction d𝑖𝑟, C is the technical inspection team set, is the hump track set, is the hump locomotive set, the hump track and the locomotive are the same in number and are used in pairs, is the marshalling yard m The track set that can stay in the car group direction d𝑖𝑟, is the tail-end locomotive set, is the departure yard The track set that can stop the train direction . is a kind of k direction dir train technical inspection operation time, is the waiting time for entering the departure yard, is the waiting disassembly time, is a kind of k direction dir train disassembly operation time, gathering operation time, is the waiting marshalling time, is a kind of k direction dir train marshalling operation time, is a kind of k direction dir train waiting departure time, pick-up and drop-off operation time.

[0032] As Figure 2As shown, when the type of the train to be processed is no transfer, the train to be processed needs to be sequentially subjected to arrival operation and departure operation, is mapped to a resource queue, and sequentially subjected to the following occupation: occupation of arrival yard track set, occupation time is waiting for access to departure yard time; simultaneously occupation of departure yard track set and technical inspection team set, occupation time is technical operation time; occupation of departure yard track set, occupation time is waiting for departure time.

[0033] In combination Figure 2 , when the type of the train to be processed is partial reorganization, the train to be processed needs to be sequentially subjected to arrival, coupling and uncoupling, and departure operation, is mapped to a resource queue, and sequentially subjected to the following occupation: occupation of arrival yard track set, occupation time is waiting for access to departure yard time; simultaneously occupation of departure yard track set and technical inspection team set, occupation time is technical operation time; occupation of departure yard track set, occupation time is the sum of uncoupling operation time and waiting for departure time.

[0034] In combination Figure 2 , when the type of the train to be processed is arrival disassembly, the train to be processed needs to be sequentially subjected to arrival and disassembly operation, is mapped to a resource queue, and sequentially subjected to the following occupation: simultaneously starting occupation of arrival yard track set and technical inspection team set, occupation time is technical inspection operation time; occupation of arrival yard track set, occupation time is waiting for disassembly time; simultaneously occupation of hump yard track set and hump shunting machine set, occupation time is disassembly operation time.

[0035] In combination Figure 2 , when the type of the train to be processed is self-compiled departure, the train to be processed needs to be sequentially subjected to gathering, grouping and departure operation, is mapped to a resource queue, and sequentially subjected to the following occupation: occupation of grouping yard track set, occupation time is the sum of gathering operation time and waiting for grouping time; occupation of grouping yard track set and tailing shunting machine set, occupation time is grouping operation time; occupation of grouping yard track set, occupation time is waiting for access to departure yard time; simultaneously occupation of departure yard track set and technical inspection team set, occupation time is technical operation time; occupation of departure yard track set, occupation time is waiting for departure time.

[0036] In actual application, after obtaining the train to be processed, according to the type of the train to be processed (no transfer, partial reorganization, arrival disassembly, self-compiled departure, etc.), the processing procedure that the train to be processed needs to go through and the multiple processing modules that need to be called are determined, and the train to be processed is added to the to-be-processed queue of the first processing module, so as to ensure that the train to be processed is planned to meet the operation requirements.

[0037] Optionally, in a possible implementation, the multiple processing modules that need to be called for planning and preparation processing of the train to be processed according to the type of the train to be processed in the step 101 include: If the type of the train to be processed is no adjustment transfer, the plurality of processing modules are in turn arrival module and departure module; If the type of the train to be processed is partial reorganization, the plurality of processing modules are in turn arrival module and departure module; If the type of the train to be processed is arrival disassembly, the plurality of processing modules are in turn arrival module and disassembly module; If the type of the train to be processed is self-compiled departure, the plurality of processing modules are in turn gathering module, grouping module and departure module.

[0038] Further, the processing module determines the occupied resources of the first train or the first train set that enters the queue earliest, and the start and end occupation time of the occupied resources according to the to-be-processed queue, the processing set and the maximum resource amount and resource occupation of the corresponding resource set. By considering the maximum carrying capacity of the resource, the occupation time of the resource is determined, which avoids resource overload and resource utilization conflict, and ensures that the prepared resource utilization plan is feasible.

[0039] Further, when the start occupation time of the first train or the first train set arrives, it is removed from the to-be-processed queue, added to the processing set, and the time of leaving the processing set is updated. This step realizes the dynamic update of the job state, and ensures that the processing progress of each train or train set can be tracked. By updating the occupation time of the processing set, accurate time information is provided for subsequent scheduling decisions, which helps to optimize the job flow of the whole marshalling station.

[0040] Further, when the leaving time of the second train or the second train set arrives, it is removed from the processing set. The second train is the train that leaves the processing set of the processing module earliest, and the second train set is the train set that leaves the processing set of the processing module earliest. In practice, after the train or train set completes the job in the processing module, resources are vacated for subsequent trains or train sets. By updating the processing set in time, it ensures that the resources can be used efficiently and avoids idle waiting.

[0041] Further, it is judged whether the second train or the third train obtained by the second train set gathering exists a next processing module. If there is a next processing module, it means that the job flow of the train or train set has not been completed, and the next step needs to be continued; if not, it means that the job flow of the train or train set is completed.

[0042] Specifically, if the second train or the third train exists a next processing module, it is added to the to-be-processed queue of the next module, and the joining time and the end time of the occupied resources are determined. This step realizes the orderly transfer of trains between different processing modules, and ensures that each train can complete all necessary jobs according to the predetermined flow. Through accurate time arrangement, the utilization efficiency of resources is further optimized, and unnecessary waiting and conflict are avoided.

[0043] In contrast, if the second train or the third train does not exist the next processing module, the processing of the train or the train set is ended, and the end time of the resource occupation of the train or the train set is determined as the time of leaving the current processing module. This step marks the end of the operation process of the train or the train set in the marshalling station, and the resource is released for use by other trains or train sets. This helps to improve the resource turnover efficiency of the whole marshalling station and ensures the continuous and efficient operation of the marshalling station.

[0044] In the present application, based on the idea of queuing theory, the key resources such as the tracks, the technical inspection teams and the shunting locomotives of the marshalling station are taken as service nodes, each service node has a maximum service capacity limit and a service time standard, and the trains or train sets are taken as service objects flowing through these nodes, and the service objects determine which service nodes to flow through and the flow order according to their respective attributes. The core of the model is to obtain the service capacity and time standard of each service node, to determine the service node capacity occupation by determining the queue time of each train set or train entering and leaving the service node, and to further judge whether the next service object is allowed to enter the service node and the entering time, so as to effectively avoid the resource occupation conflict of the planned marshalling station, and to realize the reasonable compilation of the station stage plan. This method simplifies the complex operation of the marshalling station into a series of resource occupation and release processes through the queuing theory, establishes a resource queue mapping mechanism, provides a structured method to deal with the resource allocation problem of the marshalling station, accurately calculates the resource occupation time, and compared with the existing manual plan compiled by experience, the plan compilation process is more transparent and controllable, improves the station resource utilization rate, improves the applicability of the plan, lays a theoretical foundation for automatic compilation of the station operation plan, and has strong practical value and innovation.

[0045] It can be understood that the reasonable compilation of the marshalling station resources is realized through the above steps, the resource utilization rate is improved, the operation process is optimized, the resource conflict is reduced, and strong support is provided for the efficient operation of railway transportation.

[0046] In combination with the above description, the plurality of processing modules include an arrival module, a disassembly module, an assembly module, a marshalling module, a departure module and a technical inspection module. The working principles of each processing module are described in detail as follows.

[0047] Specifically, in one possible implementation, the processing module is the arrival module; and the determination of the resource, the start occupation time and the end occupation time of the first train occupying the resource set corresponding to the processing module in the step 102 according to the to-be-processed queue of the processing module, the processing set of the processing module, the maximum resource amount of the resource set corresponding to the processing module and the resource occupation situation, includes: If the number of trains in the processing set of the current arrival module is less than the maximum number of arrival yard tracks, the start occupation time of the first train to the arrival yard track set is set as the time when the first train joins the to-be-processed queue of the arrival module; If the number of trains in the processing set of the current arrival module is equal to the maximum number of arrival yard tracks, the first train waits until the second train leaves the arrival yard track, and the start occupation time of the first train to the arrival yard track set is set as the sum of the end occupation time of the second train to the arrival yard track set and the train interval time; The arrival yard track occupied by the first train is determined as any unoccupied track in the arrival yard track set; If the type of the first train is an arrival disassembly train, the inspection module is called, the first train joins the to-be-processed queue of the inspection module, the time when the first train joins the to-be-processed queue of the inspection module is the start occupation time of the first train to the arrival yard track set, the occupation of the inspection team set, the start occupation time and the end occupation time of the first train are determined according to the to-be-processed queue of the inspection module, the processing set of the inspection module and the maximum number of inspection teams, the time when the first train joins the to-be-processed queue of the disassembly module is the end occupation time of the first train to the inspection team set, and the end occupation time of the first train to the arrival yard track set is the time when the first train joins the processing set of the disassembly module.

[0048] The working principle of the arrival module will be described in detail below. Figure 3 The working principle of the arrival module will be described in detail below. Figure 3 The flowchart of the arrival module provided by the application is shown in the figure.

[0049] As shown in the figure, the time when the train enters the to-be-accessed arrival yard train set is the planned arrival time, i.e. Figure 3 The arrival yard track capacity is determined, and if the number of trains stopped in the arrival direction of the arrival yard is less than the number of tracks for trains in the arrival direction, i.e. The earliest train entering the to-be-accessed arrival yard train set is accessed to the arrival yard, and the arrival time of the train is updated to , otherwise the train waits to be accessed until a train in the train set leaves, and the state of the train is updated to train arrival and the arrival time is updated to , wherein ​​​​​​​​​​​​​This refers to the train interval. The track occupancy status is updated for any arrival station. docking Tracks of trains heading in the direction And the direction of the train stopping on the track. With the direction of the train Same, that is No train occupied the track, that is So the train Arrival at the occupied track ,make Update the list of trains waiting to arrive at the terminal. Arrival at the train station Update: Trains awaiting technical inspection are assembling. and trains Joining the set time .

[0050] Furthermore, the technical inspection team module is invoked to determine the technical inspection team occupied by the train, the start time of occupation, and the end time of occupation.

[0051] Determine if the train has arrived at its destination; if it has, then the train... f The final destination With this station sta Consistent The processing of the train has ended, and the track occupancy status has been updated. Update the arrival station train collection Otherwise, if the train is a non-depressurized transfer train or a partially modified train, that is... Alternatively, add it to the set of departure stations to be connected. The joining time is the end time of the technical inspection, that is... If the train is a dismantled train, that is... The train was added to the dismantling assembly. The joining time is the end time of the technical inspection, that is... .

[0052] Specifically, in one possible implementation, the processing module is a departure module; in step 102 above, based on the processing module's pending queue, the processing set of the processing module, the maximum resource amount and resource occupancy status of the resource set corresponding to the processing module, the determination of the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation, includes: If the number of trains in the current departure module's processing set is less than the maximum number of departure yard tracks, then the start time of the first train occupying the departure yard track set is set to the time when the first train joins the departure module's processing queue. If the number of trains in the current departure module's processing set is equal to the maximum number of departure yard tracks, then the first train waits until the second train leaves the departure yard tracks, and the start time of the first train occupying the departure yard track set is set to the sum of the end time of the second train occupying the departure yard track set and the train interval time. The occupied departure track of the first train is determined to be any unoccupied track in the set of departure tracks; If the first train is a non-adjusted transfer, a self-arranged origin, or a partially modified train, the technical inspection module is invoked to add the first train to the waiting queue of the technical inspection module. The time when the first train is added to the waiting queue of the technical inspection module is the start time of the first train occupying the departure yard track set. Based on the waiting queue of the technical inspection module, the processing set of the technical inspection module, and the maximum number of technical inspection team sets, the first train's occupying technical inspection team, start time of occupation, and end time of occupation are determined. The waiting time for the first train is determined based on its type and direction. If the first train is partially modified, the coupling and uncoupling operation time is determined based on its direction. If the type of the first train is a transfer without adjustment or a self-arranged origin, then the end time of the first train occupying the departure yard track set is set as the sum of the end time of the first train occupying the technical inspection team set and the waiting time for departure. If the type of the first train is a partial modification, then the end time of the first train occupying the departure yard track set is set as the sum of the end time of the first train occupying the technical inspection team set, the coupling and uncoupling operation time of the first train, and the waiting departure time.

[0053] The following is combined with Figure 4 The working principle of the departure module is explained in detail. Figure 4 This is a flowchart illustrating the starting module provided by the present invention.

[0054] like Figure 4 As shown, the starting track capacity is determined. If the starting track... Dock departure direction The number of trains is less than the number of trains departing from the station. docking The number of tracks for trains traveling in a particular direction, i.e. Then the train Upon arrival at the departure yard, the earliest trains to arrive at the departure yard will be assembled. train Access to the departure yard and update the trains Access time Otherwise the train Waiting to connect until the trains assemble Train Departure, train update The state is that the train accesses the departure yard, and the access time is , wherein is the train interval time.

[0055] The resource state corresponding to the last module is updated, and if the train is a self-compiled departure train, i.e. , the marshalling yard resource occupied by each train set constituting the train is released, i.e. , the marshalling train set is updated to ; if the train is a no-transfer or partially recompiled train, i.e. or 2, the arrival yard resource is released , the arrival yard train set is updated . The train set to be accessed to the departure yard is updated .

[0056] The track occupation state is updated, and for any departure yard , the track occupied by the train in the direction is , and the direction of the train is the same as the direction of the train, i.e. , any train does not occupy the track, i.e. , the train occupies the track , and is updated. The departure yard train set is updated . The waiting inspection train set is updated , and the time when the train joins the set.

[0057] The inspection module is called to determine the occupied inspection team of the train, the start occupation time and the end occupation time.

[0058] The type of the train is determined, and if the train is a no-transfer or self-compiled departure train, i.e. or , the train departure time is updated; if the train is a partially recompiled train, i.e. , the unloading and loading operation is performed, and the train departure time is updated. The track occupation state is updated . The train set is updated .

[0059] Based on the above description, both the arrival module and the departure module need to call the technical inspection module. Optionally, in one possible implementation, the determination of the technical inspection team, start time, and end time of the first train's occupied technical inspection team, based on the technical inspection module's pending queue, the technical inspection module's processing set, the maximum number of technical inspection teams, and the technical inspection team occupancy, includes: If the number of trains in the current technical inspection module's processing set is less than the maximum number of technical inspection team sets, then the start time of the first train occupying the technical inspection team set is set to the time when the first train is added to the processing queue of the technical inspection module. If the number of trains in the current technical inspection module's processing set is equal to the maximum number of technical inspection team sets, then the first train waits until the second train completes its technical inspection work. The start time of the first train occupying the technical inspection team set is set to the sum of the end time of the second train occupying the technical inspection team set and the train interval time. The occupying technical inspection team for the first train is determined to be any unoccupied technical inspection team in the set of technical inspection teams; Determine the technical inspection duration of the first train based on its type; The end time of the first train occupying the technical inspection team set is set as the sum of the start time of the first train occupying the technical inspection team set and the technical inspection operation time of the first train.

[0060] The following is combined with Figure 5 The working principle of the technical inspection module is explained in detail. Figure 5 This is a flowchart illustrating the technical inspection module provided by the present invention.

[0061] Combination Figure 5 To assess the current capacity of the technical inspection teams, if the number of trains undergoing technical inspection is less than the number of technical inspection teams, then... They will be the first to enter the waiting area for the technical inspection train. train Technical inspection work begins. If there are no available technical inspection teams at present, then the train Waiting for technical inspection work to proceed. The first train in China to complete technical inspection After leaving, the train Conduct technical inspections and update trains Technical inspection start time Update the status of technical inspection teams. For any technical inspection team, no train is occupying that team. So the train This shift was occupied for technical inspection work, Update: Trains awaiting technical inspection are assembling. Technical inspection trains assembled .

[0062] train complete the technical inspection, update the technical inspection operation completion time , update the technical inspection team state , update the technical inspection train set .

[0063] Specifically, in one possible implementation, the processing module is a disassembly module; and the step 102 of determining the resources of the first train occupied by the processing module, the start time of the occupation and the end time of the occupation according to the to-be-processed queue of the processing module, the processing-in-process set of the processing module and the maximum resource quantity of the resource set corresponding to the processing module comprises: determining whether the current set of trains to be dispatched is empty, if yes, taking the first train as a train to be disassembled; if not, judging in order of the planned departure time whether the number of vehicles currently assembled in each marshalling direction corresponding to each train to be dispatched in the set of trains to be dispatched meets the marshalling requirement; if yes, taking the first train as the train to be disassembled; if not, taking the first train in the set of trains to be dispatched whose number of currently assembled vehicles does not meet the marshalling requirement as a target train; judging in order of the time when the train joins the to-be-processed queue of the disassembly module whether the marshalling direction of the train in the to-be-processed queue exists in the marshalling direction of the target train, if yes, taking the first train in the to-be-processed queue whose marshalling direction exists in the marshalling direction of the target train as the train to be disassembled; if not, taking the first train as the train to be disassembled; if the number of trains in the processing-in-process set of the current disassembly module is less than the number of hump shunting locomotives, setting the start time of the occupation of the set of hump shunting locomotives by the train to be disassembled as the time when the train to be disassembled joins the to-be-processed queue of the disassembly module; if the number of trains in the processing-in-process set of the current disassembly module is equal to the number of hump shunting locomotives, the train to be disassembled waits until the second train completes the disassembly operation, and the start time of the occupation of the set of hump shunting locomotives by the train to be disassembled is set as the sum of the end time of the occupation of the set of hump shunting locomotives by the second train and the train interval time; determining the hump shunting locomotive occupied by the train to be disassembled as any unoccupied hump shunting locomotive in the set of hump shunting locomotives; determining the disassembly operation time of the train to be disassembled according to the type and direction of the train to be disassembled; the end time of the occupation of the set of hump shunting locomotives by the train to be disassembled is the sum of the start time of the occupation and the disassembly operation time.

[0064] The working principle of the disassembly module will be described in detail below. Figure 6 The working principle of the disassembly module will be described in detail below. Figure 6 is a flowchart of the disassembly module provided by the present application.

[0065] Combining Figure 6 , For the planned departure train set, For this module over set, no practical significance, .

[0066] Judgment planned departure train set, planned departure train set The earliest train , for any marshalling direction , each marshalling yard track , its can stop by the vehicle direction and the same marshalling direction, namely , the sum of the number of vehicles Whether the train The number of vehicles required by the marshalling direction , if satisfied, from the train set Remove train , repeat the above judgment until the train set Empty, meaning that the planned departure train has been set up, at this time the first train into the set of disassembled trains As the disassembled train; if not satisfied, the train As the target disassembly train , the first train into the set of disassembled trains, and its car direction Belongs to the marshalling direction of the target train, namely , As the disassembled train.

[0067] Judgment whether there is available hump locomotive, if the number of trains being disassembled is less than the number of hump locomotives, namely , then there is an idle locomotive, update the train disassembly start time to ; otherwise, the train Wait for disassembly until the train Complete disassembly after the completion of the disassembly work, the train can start disassembly work, update the start disassembly time .

[0068] Update the resource state corresponding to the last module, arrival yard track state , arrival yard train set , waiting for disassembly train set .

[0069] Update the locomotive occupation state, for any hump locomotive , disassembly train does not occupy the locomotive , then . Update the disassembly train set state .

[0070] Train disassembly is completed, and the disassembly completion time is updated , the switcher occupation state is updated . The train set state is updated .

[0071] Further, it is judged whether the train set in the train set is terminal, if yes, the processing of the train set is ended; otherwise, the train set is added to the waiting set queue, g , the train set state is updated . g In detail, in a possible implementation, the processing module is the marshalling module; the first train set occupies the resources of the resource set corresponding to the marshalling module, the start occupation time and the end occupation time are determined according to the train set queue to be processed of the processing module, the processing-in set of the processing module, the maximum resource amount of the resource set corresponding to the processing module and the resource occupation state, the first train set being the train set entering the train set queue to be processed earliest, comprising: the start occupation time of the first train set occupying the marshalling yard track set corresponding to the marshalling module is set as the time when the first train set is added to the train set queue to be processed of the marshalling module; the marshalling yard track occupied by the first train set is determined as any track in the marshalling yard track set, which contains the direction of the first train set and the sum of the current number of vehicles parked and the number of vehicles of the first train set does not exceed the maximum number of vehicles parked in the track;

[0072] it is judged whether the current planned departure train set is empty; if the current planned departure train set is not empty, the number of vehicles currently marshalled in each marshalling direction corresponding to each planned departure train in the planned departure train set is judged in turn according to the order of the planned departure time; if not, the marshalling module is called again; if yes, the planned departure train is regarded as the target train; the processing-in set time of the first train set leaving the marshalling module is the maximum value of the sum of the time when the first train set is added to the processing-in set and the marshalling operation time corresponding to the processing-in set of any marshalling direction of the target train; wherein the marshalling time of the first train set is determined according to the type and direction of the target train. The working principle of the marshalling module will be described in detail below. is a flowchart of the marshalling module provided by the present application.

[0073] The working principle of the marshalling module will be described in detail below. Figure 7 is a flowchart of the marshalling module provided by the present application. Figure 7 The working principle of the marshalling module will be described in detail below.

[0074] is a flowchart of the marshalling module provided by the present application. Figure 7 , ​To plan the departure train set, For the module over set, no practical significance, .

[0075] The earliest join the set of train sets to be assembled Start assembling, update the train set joining the assembly set time to , update the train set state, the set of trains to be assembled , the set of trains to be assembled . Update the track occupancy state, for any marshalling yard Parking The direction of the train , and the direction of the train stored in the track Including the direction of the train , that is , the track The current number of vehicles stored Plus the number of trains The direction of the train is The sum of the number of trains in the direction Less than the maximum number of vehicles stored in the track Let , update the set of trains stored in the track to .

[0076] Determine the assembly situation of the planned departure train, and the set of trains to be assembled The earliest departure train in the set of trains to be assembled For any marshalling direction , the track of each marshalling yard , the direction of the vehicle that can be parked is the same as the marshalling direction, that is The number of trains assembled Whether the number of vehicles required by the train The marshalling direction meets the number of vehicles required by the train If it meets, the train It is considered as the target assembly train ; Otherwise, call the assembly module again.

[0077] For any marshalling direction The set of trains assembled for the target assembly train The earliest train set to join the set The assembly is over, the time is the maximum of the assembly end time of each marshalling direction, that is The target assembly train is composed of the above train sets . Update the train set state, the set of trains stored in the track , the set of trains to be assembled , the set of trains to be assembled . Update the train state .

[0078] Specifically, in one possible implementation, the processing module is a grouping module; based on the processing module's pending queue, the processing set of the processing module, and the maximum resource amount of the resource set corresponding to the processing module, the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation are determined, including: If the number of trains in the current train formation module is less than the number of peak tail shunting locomotives, then the time when the first train occupies the peak tail shunting locomotive set is set to the time when the first train is added to the waiting queue of the train formation module. If the number of trains in the current train formation module is equal to the number of peak tail shunting locomotives, then the first train waits until the second train completes the train formation operation. The start time of the first train occupying the peak tail shunting locomotive set is set as the sum of the end time of the second train occupying the peak tail shunting locomotive set and the train interval time. The first train is determined to occupy any unoccupied peak tail shunting locomotive in the peak tail shunting locomotive set; The marshalling operation time for the first train is determined based on its type and direction. The end time of the first train's occupation of the peak tail shunting set is set as the sum of the start time of the first train's occupation of the peak tail shunting set and the marshalling operation time of the first train.

[0079] The following is combined with Figure 8 The working principle of the grouping module is explained in detail.

[0080] Figure 8 This is a flowchart illustrating the grouping module provided by the present invention.

[0081] like Figure 8 As shown, the peak-end shunting capacity is determined by the number of trains currently being assembled. Is it less than the number of turbines used for peak tailing? If a peak-end shunting locomotive is available, the first train to join the assembly of waiting trains will be... Start train formation, update train formation start time. If no available peak-end shunting locomotive is available, the train will wait for marshalling until a train marshalling operation is completed, at which point the train marshalling start time will be updated. .

[0082] Furthermore, update the occupancy status of the switching equipment for any idle switching equipment. To order it to perform the grouping task Simultaneously update the train assembly status, and the assembly of trains awaiting formation. Train assembly .

[0083] Update train end formation time Waiting for accessing departure field Updating the state of the shunting machine Updating the set of trains waiting for accessing the departure field .

[0084] It should be noted that the above symbol explanations are shown in Table 1 and Table 2.

[0085] Table 1 Symbol Explanation 1

[0086] Table 2 Symbol Explanation 2

[0087] The marshalling station resource utilization plan preparation method provided in the embodiment determines a plurality of processing modules that need to be called according to the type of the train to be processed, and adds the train to be processed into the to-be-processed queue of the first processing module; each processing module determines the resource occupied by the train or the train set, the start time of occupation and the end time of occupation; when the train or the train set starts to occupy the resource, it is moved from the to-be-processed queue to the processing set, and the departure time is updated. After processing is completed, it is judged whether the train or the train set has the next processing module, if yes, it is added to the next module queue, otherwise the processing is ended. The scheme of the embodiment optimizes the resource allocation through queue management, determines the occupied resource, the start time of occupation and the end time of occupation of each train, effectively avoids the resource occupation conflict in the plan, so as to realize the reasonable preparation of the marshalling station resource, and improve the utilization rate of the marshalling station resource.

[0088] In addition, the application also provides a marshalling station resource utilization plan preparation device, the system comprises a calling module and a plurality of processing modules; the plurality of processing modules comprise: an arrival module, a disassembly module, a gathering module, a marshalling module, a departure module and a technical inspection module; The calling module is used for obtaining a train to be processed, determining a plurality of processing modules that need to be called for plan preparation processing of the train to be processed according to the type of the train to be processed, and adding the train to be processed into the to-be-processed queue of the first processing module, the time when the train to be processed is added into the to-be-processed queue of the first processing module being the train plan arrival time; the processing module comprises: an arrival module, a disassembly module, a gathering module, a marshalling module and a departure module; The processing module is used for determining the resource occupied by a first train or a first train set in the resource set corresponding to the processing module, the start time of occupation and the end time of occupation according to the to-be-processed queue of the processing module, the processing set of the processing module and the maximum resource quantity of the resource set corresponding to the processing module, the first train being the train that enters the to-be-processed queue earliest, and the first train set being the train set that enters the to-be-processed queue earliest; ​The processing module is further configured to remove the first train or the first train set from the to-be-processed queue of the processing module and add the first train or the first train set to a processing-in-process set of the processing module when a start occupation time of the first train or the first train set on the resource set corresponding to the processing module arrives; and update a leaving time of the first train from the processing-in-process set as a sum of a time when the first train or the first train set is added to the processing-in-process set and a work time; The processing module is further configured to remove the second train or the second train set from the processing-in-process set of the processing module when a leaving time of the second train or the second train set from the processing-in-process set arrives, the second train being a train that leaves the processing-in-process set of the processing module earliest, and the second train set being a train set that leaves the processing-in-process set of the processing module earliest; The processing module is further configured to determine whether the second train or a third train exists in a next processing module, the third train being a train obtained by the second train set assembling, to add the second train or the third train to a to-be-processed queue of the next processing module if the second train or the third train exists in the next processing module, to determine a time when the second train or the third train is added to the to-be-processed queue of the next processing module as a leaving time of the second train or the third train from the processing-in-process set of the current processing module, and to determine an end occupation time of the resource set by the second train or the third train as a time when the second train or the third train is added to a processing-in-process set of the next processing module, and to end processing of the second train or the third train if the second train or the third train does not exist in the next processing module, the end occupation time of the resource set by the second train or the third train being the leaving time of the second train or the third train from the processing-in-process set of the current processing module.

[0089] The marshalling station resource utilization plan compiling device provided in the embodiment is configured to determine a plurality of processing modules that need to be called according to the type of the to-be-processed train, and add the to-be-processed train to a to-be-processed queue of the first processing module; each processing module determines the resource occupied by the train or the train set, the start occupation time and the end occupation time; when the train or the train set starts to occupy the resource, the train or the train set is removed from the to-be-processed queue to a processing-in-process set, and the current resource occupation state and the start occupation time and the previous resource end occupation time are updated. After processing is completed, it is determined whether the train or the train set has a next processing module, and if so, the train or the train set is added to the next module queue, otherwise the processing is ended. The scheme of the embodiment optimizes resource allocation through queue management, determines the occupied resource, the start occupation time and the end occupation time of each train, effectively avoids resource occupation conflicts in the plan, and thus realizes reasonable compilation of the resources of the marshalling station and improves the utilization rate of the resources of the marshalling station.

[0090] Figure 9 is a structural schematic diagram of an electronic device provided by the present application, as Figure 9As shown, the electronic device can include a processor 910, a communications interface 920, a memory 930, and a communications bus 940, wherein the processor 910, the communications interface 920, and the memory 930 complete communications with each other through the communications bus 940. The processor 910 can invoke a logical instruction in the memory 930 to execute the marshalling station resource utilization plan compilation method.

[0091] In addition, the logical instruction in the memory 930 described above can be implemented in the form of a software functional unit and sold or used as an independent product, and can be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes several instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

[0092] On the other hand, the present application also provides a computer program product, which includes a computer program, the computer program can be stored on a non-transitory computer readable storage medium, and the computer program is executed by a processor, so that the computer can execute the marshalling station resource utilization plan compilation method provided by the above-mentioned methods.

[0093] In yet another aspect, the present application also provides a non-transitory computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the marshalling station resource utilization plan compilation method provided by the above-mentioned methods.

[0094] The device embodiments described above are only schematic, wherein the units shown as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, i.e., they can be located in one place, or distributed on multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the present embodiment. Those skilled in the art can understand and implement it without creative labor.

[0095] Those skilled in the art can clearly understand the technical solutions of the various embodiments from the above description of the embodiments, and the various embodiments can be implemented by means of software with the necessary general hardware platforms, and of course, can also be implemented by hardware. Based on such understanding, the above technical solutions, essentially or in other words, the part of the prior art that makes a contribution, can be embodied in the form of a software product, which can be stored in a computer readable storage medium, such as a ROM / RAM, a magnetic disk, an optical disk, and the like, and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0096] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, rather than limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: it can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacement for some technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for compiling a marshalling yard resource utilization plan, characterized in that, The method includes: The system acquires trains to be processed, determines the multiple processing modules required for planning and processing the trains based on their type, and adds the trains to the queue of the first processing module. The time when the trains are added to the queue of the first processing module is the train's scheduled arrival time. The processing modules include: arrival module, dismantling module, assembly module, marshalling module, departure module, and technical inspection module. The processing module determines the resources, start time, and end time of the first train or the first train group occupying the resources of the resource group corresponding to the processing module based on the processing module's pending queue, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module. The first train is the train that enters the pending queue earliest, and the first train group is the train group that enters the pending queue earliest. When the start time for the first train or the first train group to occupy the resource set corresponding to the processing module arrives, the first train or the first train group is removed from the pending queue of the processing module and added to the processing set of the processing module; the departure time of the first train or the first train group from the processing set is updated to the sum of the time when the first train or the first train group was added to the processing set and the operation time. When the departure time of the second train or the second train group from the processing set arrives, the second train or the second train group is removed from the processing set of the processing module. The second train is the train that ends its occupation of the resource set corresponding to the processing module earliest, and the second train group is the train group that ends its occupation of the resource set corresponding to the processing module earliest. Determine whether the second or third train has a next processing module; the third train is the train obtained from the assembly of the second trainset; if the second or third train has a next processing module, then add the second or third train to the waiting queue of the next processing module, and determine the time when the second or third train is added to the waiting queue of the next processing module as the departure time of the second or third train from the processing set of the current processing module, and determine the end time of the second or third train occupying the resource set as the time when the second or third train is added to the processing set of the next processing module; if the second or third train does not have a next processing module, then end the processing of the second or third train, and the end time of the second or third train occupying the resource set as the departure time of the second or third train from the processing set of the current processing module.

2. The method for compiling a marshalling yard resource utilization plan according to claim 1, characterized in that, The processing module is an arrival module; Based on the pending queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module, the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation are determined, including: If the number of trains in the current arrival module's processing set is less than the maximum number of arrival yard tracks, then the start time of the first train occupying the arrival yard track set is set to the time when the first train joins the waiting queue of the arrival module. If the number of trains in the current arrival module's processing set is equal to the maximum number of arrival yard tracks, then the first train waits until the second train leaves the arrival yard track. The start time of the first train occupying the arrival yard track set is set to the sum of the end time of the second train occupying the arrival yard track set and the train interval time. The occupied arrival yard track of the first train is determined to be any unoccupied track in the set of arrival yard tracks; If the first train is an arriving dismantling train, the technical inspection module is invoked to add the first train to its pending queue. The time the first train is added to the pending queue is the start time of its occupation of the arrival yard track set. Based on the pending queue of the technical inspection module, the processing set of the technical inspection module, the maximum number of technical inspection teams, and the occupation status of the technical inspection teams, the occupation of the technical inspection team, the start time of occupation, and the end time of occupation are determined. The time the first train is added to the pending queue of the dismantling module is the end time of its occupation of the technical inspection team set. The end time of the first train's occupation of the arrival yard track set is the time the first train is added to the processing set of the dismantling module.

3. The method for compiling a marshalling yard resource utilization plan according to claim 1, characterized in that, The processing module is the departure module; Based on the pending queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module, the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation are determined, including: If the number of trains in the current departure module's processing set is less than the maximum number of departure yard tracks, then the start time of the first train occupying the departure yard track set is set as the time when the first train joins the waiting queue of the departure module. If the number of trains in the current departure module's processing set is equal to the maximum number of departure yard tracks, then the first train waits until the second train leaves the departure yard tracks, and the start time of the first train occupying the departure yard track set is set to the sum of the end time of the second train occupying the departure yard track set and the train interval time. The first train is determined to occupy any unoccupied track in the set of departure yard tracks. If the first train is a non-adjusted transfer, self-arranged origin, or partially modified train, the technical inspection module is invoked to add the first train to the waiting queue of the technical inspection module. The time when the first train is added to the waiting queue of the technical inspection module is the start time of the first train occupying the departure yard track set. Based on the waiting queue of the technical inspection module, the processing set of the technical inspection module, the maximum number of the technical inspection team set, and the technical inspection team occupancy status, the technical inspection team occupied by the first train, the start time of occupation, and the end time of occupation are determined. The waiting time for the first train is determined based on its type and direction. If the first train is partially modified, the coupling and uncoupling operation time is determined based on its direction. If the first train is a non-adjustment transfer or a self-arranged origin, then the end time of the first train occupying the departure yard track set is set as the sum of the end time of the first train occupying the technical inspection team set and the waiting time for departure. If the type of the first train is partially modified, then the end time of the first train occupying the departure yard track set is set as the sum of the end time of the first train occupying the technical inspection team set, the coupling and uncoupling operation time of the first train, and the waiting departure time.

4. The method for compiling a marshalling yard resource utilization plan according to claim 2 or 3, characterized in that, The step of determining the occupied technical inspection team, start time, and end time of the first train based on the pending queue of the technical inspection module, the processing set of the technical inspection module, the maximum number of the technical inspection team set, and the occupancy status of the technical inspection teams includes: If the number of trains in the current processing set of the technical inspection module is less than the maximum number of technical inspection team sets, then the start time of the first train occupying the technical inspection team set is set as the time when the first train is added to the waiting queue of the technical inspection module. If the number of trains in the current technical inspection module's processing set is equal to the maximum number of technical inspection team sets, then the first train waits until the second train completes its technical inspection work. The start time of the first train occupying the technical inspection team set is set to the sum of the end time of the second train occupying the technical inspection team set and the train interval time. The occupying technical inspection team of the first train is determined to be any unoccupied technical inspection team in the set of technical inspection teams; Determine the technical inspection duration of the first train based on its type; The end time of the first train occupying the technical inspection team set is set as the sum of the start time of the first train occupying the technical inspection team set and the technical inspection operation time of the first train.

5. The method for compiling a marshalling yard resource utilization plan according to claim 1, characterized in that, The processing module is a disassembly module; Based on the pending queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module, the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation are determined, including: Determine if the current planned departure train set is empty; if it is empty, then designate the first train as the train to be dismantled. If not empty, in chronological order of planned departure time, determine whether the number of cars currently assembled in each direction corresponding to each planned departure train in the set of planned departure trains meets the planned train formation requirements; if it does, then the first train is designated as the train to be dismantled. If the requirements are not met, the first train in the planned departure train set whose current number of cars does not meet the formation requirements will be considered the target train. According to the order in which trains are added to the processing queue of the dismantling module, it will be determined whether the formation direction of the trains in the processing queue is the same as that of the target train. If it is, the first train in the processing queue with the formation direction of the target train will be designated as the train to be dismantled. If it is not, the first train will be designated as the train to be dismantled. If the number of trains in the current dismantling module's processing set is less than the number of hump yard locomotives, then the start time for the trains to be dismantled to occupy the hump yard locomotive set is set as the time when the trains to be dismantled are added to the processing queue of the dismantling module. If the number of trains in the current dismantling module's processing set is equal to the number of hump yard locomotives, then the trains waiting to be dismantled will wait until the second train completes the dismantling operation. The start time of the trains waiting to be dismantled occupying the hump yard locomotive set will be set as the sum of the end time of the second train occupying the hump yard locomotive set and the train interval time. The hump yard of the train to be dismantled is determined to be any unoccupied hump yard in the hump yard set; The duration of the dismantling operation is determined based on the type and direction of the train to be dismantled. The end time of the hump yard locomotive assembly occupied by the train to be dismantled is the sum of the start time of occupation and the duration of the dismantling operation.

6. The method for compiling a marshalling yard resource utilization plan according to claim 1, characterized in that, The processing module is an aggregation module; Based on the pending vehicle queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module, the resource occupancy time, start time, and end time of the first vehicle group occupying the resource set corresponding to the processing module are determined. The first vehicle group is the earliest vehicle group to enter the pending vehicle queue, including: The start time of the first train group occupying the track set of the marshalling yard corresponding to the assembly module is set as the time when the first train group is added to the queue to be processed of the assembly module. The first train set occupies a marshalling yard track that is any track in the set of marshalling yard tracks that can accommodate vehicles in any direction including the direction of the first train set, and the sum of the number of currently parked vehicles and the number of vehicles in the first train set does not exceed the maximum number of vehicles that track can accommodate. Determine if the currently scheduled departure train assembly is empty; If the current set of planned departure trains is not empty, check in order of planned departure time whether the number of cars currently assembled in each direction corresponding to each planned departure train in the set of planned departure trains meets the planned train formation requirements; if not, call the assembly module again. If satisfied, the planned departure train is considered the target train; for any train set in the assembly direction of the target train, the processing assembly time of the first train set leaving the assembly module is the maximum value of the sum of the processing assembly time of the first train set in the processing assembly time corresponding to any train set in the processing direction of the target train and the assembly operation time; wherein, the assembly time of the first train set is determined according to the type and direction of the target train.

7. The method for compiling a marshalling yard resource utilization plan according to claim 1, characterized in that, The processing module is a grouping module; The step of determining the resources occupied by the first train in the resource set corresponding to the processing module, the start time of occupation, and the end time of occupation, based on the pending queue of the processing module, the processing set of the processing module, the maximum resource amount and resource occupancy of the resource set corresponding to the processing module, includes: If the number of trains in the current train formation module is less than the number of peak tail shunting locomotives, then the time when the first train occupies the peak tail shunting locomotive set is set as the time when the first train is added to the waiting queue of the train formation module. If the number of trains in the current train formation module is equal to the number of peak tail shunting locomotives, then the first train waits until the second train completes the train formation operation. The start time of the first train occupying the peak tail shunting locomotive set is set as the sum of the end time of the second train occupying the peak tail shunting locomotive set and the train interval time. The peak tail shunting locomotive occupied by the first train is determined to be any unoccupied peak tail shunting locomotive in the peak tail shunting locomotive set; The marshalling operation time for the first train is determined based on its type and direction. The end time of the first train's occupation of the peak tail shunting set is set as the sum of the start time of the first train's occupation of the peak tail shunting set and the marshalling operation time of the first train.

8. The method for compiling a marshalling yard resource utilization plan according to any one of claims 1-7, characterized in that, The step of determining, based on the type of the train to be processed, the multiple processing modules to be invoked for the planning and processing of the train to be processed include: If the type of the train to be processed is a transfer without adjustment, then the multiple processing modules are, in order, an arrival module and a departure module; If the type of train to be processed is partially modified, then the plurality of processing modules are, in order, an arrival module and a departure module; If the type of the train to be processed is arrival dismantling, then the plurality of processing modules are, in order, an arrival module and a dismantling module; If the type of train to be processed is self-organized and originating, then the multiple processing modules are, in order, an assembly module, a marshalling module, and a departure module.

9. A marshalling yard resource utilization planning device, characterized in that, The system includes: a calling module and multiple processing modules; the multiple processing modules include: an arrival module, a dismantling module, an assembly module, a grouping module, a departure module, and a technical inspection module; The calling module is used to obtain the train to be processed, determine the multiple processing modules to be called for the planning and processing of the train to be processed according to the type of the train to be processed, and add the train to be processed to the waiting queue of the first processing module. The time when the train to be processed is added to the waiting queue of the first processing module is the train's scheduled arrival time. The processing modules include: arrival module, dismantling module, assembly module, marshalling module, and departure module. The processing module is used to determine, based on the processing module's pending queue, the processing set of the processing module, the maximum resource quantity and resource occupancy status of the resource set corresponding to the processing module, the start time of occupancy and the end time of occupancy of the resource set corresponding to the processing module, the processing module's pending queue, the processing set of the processing module, the maximum resource quantity and resource occupancy status of the resource set corresponding to the processing module, the first train being the earliest train to enter the pending queue, and the first train being the earliest train to enter the pending queue. The processing module is further configured to, when the start time for the first train or the first train group to occupy the resource set corresponding to the processing module arrives, remove the first train or the first train group from the pending queue of the processing module and add the first train or the first train group to the processing set of the processing module; update the departure time of the first train from the processing set to the sum of the time when the first train or the first train group was added to the processing set and the operation time; The processing module is further configured to remove the second train or the second train group from the processing set of the processing module when the departure time of the second train or the second train group from the processing set arrives, wherein the second train is the train that ends occupying the resource set corresponding to the processing module earliest, and the second train group is the train group that ends occupying the resource set corresponding to the processing module earliest. The processing module is further configured to determine whether the second or third train has a next processing module; the third train is a train obtained from the assembly of the second trainset; if the second or third train has a next processing module, the second or third train is added to the waiting queue of the next processing module, the time when the second or third train is added to the waiting queue of the next processing module is determined to be the departure time of the second or third train from the processing set of the current processing module, and the end time of the second or third train occupying the resource set is determined to be the time when the second or third train is added to the processing set of the next processing module; if the second or third train does not have a next processing module, the processing of the second or third train is terminated, and the end time of the second or third train occupying the resource set is the departure time of the second or third train from the processing set of the current processing module.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the marshalling yard resource utilization plan preparation method as described in any one of claims 1 to 8.

11. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the marshalling yard resource utilization plan preparation method as described in any one of claims 1 to 8.

12. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the marshalling yard resource utilization plan preparation method as described in any one of claims 1 to 8.

Images