Marshalling station resource utilization plan compilation method, device, equipment, medium and product
By defining processing modules and resource occupancy times in the marshalling yard resource utilization plan, the problems of low resource utilization and insufficient conflict detection were solved, achieving rational resource allocation and efficient utilization, and optimizing the railway transportation process.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA ACADEMY OF RAILWAY SCI CORP LTD
- Filing Date
- 2025-10-22
- Publication Date
- 2026-06-12
AI Technical Summary
Existing methods for planning the utilization of marshalling yard resources lack effective conflict detection and avoidance mechanisms, resulting in low resource utilization. Furthermore, manual planning is highly subjective, while automated methods lack transparent decision-making logic, making them difficult to quantify and optimize.
A method for planning the utilization of marshalling yard resources is adopted. By obtaining the type of train to be processed, the multiple processing modules that need to be called are determined, and the train is added to the queue of the first processing module. Based on the maximum resource quantity and occupancy status of the resource set, the occupancy time of the train or train set is determined, so as to achieve reasonable resource allocation and avoid conflicts.
It has improved the utilization rate of marshalling yard resources, optimized the operation process, reduced resource conflicts, provided a transparent and controllable planning process, and improved railway transportation efficiency.
Smart Images

Figure CN121201162B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of marshalling yard management technology, and in particular to methods, apparatus, equipment, media and products for compiling marshalling yard resource utilization plans. Background Technology
[0002] As railway freight hubs, marshalling yards undertake crucial functions such as train congestion and dispersal, and train marshalling and demarcation. The formulation of their resource utilization plans directly impacts the transportation efficiency of the entire railway network. Currently, the formulation of marshalling yard resource utilization plans primarily relies on manual experience. Traditionally, these plans depend on the dispatcher's experience and historical data. Dispatchers, based on train arrival forecasts, traffic flow predictions, and the condition of station equipment, use their years of accumulated operational experience to arrange track usage, shunting operations, and the allocation of technical and maintenance teams. While this method can meet daily operational needs to a certain extent, it has significant limitations.
[0003] Current research employs mathematical programming-based optimization methods to solve marshalling yard resource allocation problems. These methods seek optimal resource allocation solutions by establishing objective functions and constraints. However, due to the complexity and randomness of marshalling yard operations, these methods often require numerous simplification assumptions, limiting their practical effectiveness. Furthermore, some studies utilize discrete event simulation techniques to model marshalling yard operations and evaluate the effectiveness of different resource allocation schemes through simulation experiments. While simulation methods can effectively reflect the complexity of the operation process, they are primarily used for scheme evaluation rather than direct planning, and their computational time is lengthy, making them unsuitable for real-time planning.
[0004] Existing technologies suffer from several technical shortcomings. First, when coordinating the allocation of multiple resources (tracks, locomotives, and maintenance teams), existing methods lack effective conflict detection and avoidance mechanisms. Manual planning is prone to resource allocation conflicts, leading to difficulties in plan execution. While mathematical programming methods can consider constraints, they are not adaptable enough to dynamically changing work environments. Furthermore, the decision-making process of manual experience-based planning methods is highly subjective, difficult to quantify and reproduce. Although existing automated methods can provide planning results, their decision-making logic and intermediate processes are often not transparent enough, making effective adjustments and optimizations difficult.
[0005] In summary, the existing marshalling yard resource utilization plan lacks an effective conflict detection and avoidance mechanism, which makes it impossible to achieve reasonable allocation of marshalling yard resources and results in low utilization rate of marshalling yard resources. Summary of the Invention
[0006] This invention provides a method, apparatus, equipment, medium, and product for compiling marshalling yard resource utilization plans, which solves the defects of existing technologies that cannot achieve reasonable compilation of marshalling yard resources and have low utilization rates. This invention achieves reasonable compilation of marshalling yard resources and improves the utilization rate of marshalling yard resources.
[0007] This invention provides a method for compiling a marshalling yard resource utilization plan, comprising the following steps:
[0008] 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.
[0009] 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.
[0010] 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.
[0011] 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.
[0012] 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.
[0013] According to the method for compiling a marshalling yard resource utilization plan provided by the present invention, the processing module is an arrival module;
[0014] 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:
[0015] 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.
[0016] 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.
[0017] The occupied arrival yard track of the first train is determined to be any unoccupied track in the set of arrival yard tracks;
[0018] If the first train is an arriving dismantling 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 arrival 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 the technical inspection team sets, the first train's occupation of the technical inspection team, the start time of occupation, and the end time of occupation are determined. The time when the first train is added to the waiting queue of the dismantling module is the end time of the first train occupying the technical inspection team set. The end time of the first train occupying the arrival yard track set is the time when the first train is added to the processing set of the dismantling module.
[0019] According to the method for compiling a marshalling yard resource utilization plan provided by the present invention, the processing module is a departure module;
[0020] 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:
[0021] 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.
[0022] 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 as the sum of the end time of the second train occupying the departure yard track set and the train interval time.
[0023] The first train is determined to occupy any unoccupied track in the set of departure yard tracks.
[0024] If the first train is a non-adjusted transfer, self-arranged origin, or partially adapted train, then 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 the technical inspection team sets, the technical inspection team to which the first train occupies, the start time of occupation, and the end time of occupation are determined.
[0025] 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.
[0026] 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.
[0027] 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.
[0028] According to a method for compiling a marshalling yard resource utilization plan provided by the present invention, the step of determining the occupying technical inspection team, start time of occupation, and end time of occupation 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 occupation status of the technical inspection teams includes:
[0029] 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.
[0030] 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.
[0031] 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;
[0032] Determine the technical inspection duration of the first train based on its type;
[0033] 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.
[0034] According to a method for compiling a marshalling yard resource utilization plan provided by the present invention, the processing module is a disassembly module;
[0035] 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:
[0036] 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.
[0037] 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.
[0038] If the conditions are not met, the first train in the planned departure train set whose current number of cars does not meet the formation requirements is considered the target train. According to the order in which trains are added to the processing queue of the dismantling module, it is 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 is taken as the train to be dismantled; if it is not, the first train is taken as the train to be dismantled.
[0039] 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.
[0040] 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.
[0041] The hump yard of the train to be dismantled is determined to be any unoccupied hump yard in the hump yard set;
[0042] The duration of the dismantling operation is determined based on the type and direction of the train to be dismantled.
[0043] 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.
[0044] According to a method for compiling a marshalling yard resource utilization plan provided by the present invention, the processing module is an aggregation module;
[0045] 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:
[0046] 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.
[0047] 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.
[0048] Determine if the currently scheduled departure train assembly is empty;
[0049] 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.
[0050] 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.
[0051] According to a method for compiling a marshalling yard resource utilization plan provided by the present invention, the processing module is a marshalling module;
[0052] 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:
[0053] 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.
[0054] 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.
[0055] 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;
[0056] The marshalling operation time for the first train is determined based on its type and direction.
[0057] 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.
[0058] According to a method for compiling a marshalling yard resource utilization plan provided by the present invention, the step of determining multiple processing modules to be invoked for compiling a plan for the train to be processed based on the type of the train to be processed includes:
[0059] 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;
[0060] 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;
[0061] 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;
[0062] 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.
[0063] The present invention also provides a marshalling yard resource utilization plan preparation device, the system comprising: a calling module and multiple processing modules; the multiple processing modules comprising: an arrival module, a dismantling module, an assembly module, a marshalling module, a departure module, and a technical inspection module;
[0064] 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.
[0065] 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.
[0066] 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;
[0067] 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.
[0068] 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.
[0069] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the computer program to implement the marshalling yard resource utilization plan preparation method as described above.
[0070] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the marshalling yard resource utilization plan preparation method as described above.
[0071] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the marshalling yard resource utilization plan preparation method as described above.
[0072] This invention provides a method, apparatus, equipment, medium, and product for planning marshalling yard resource utilization. It determines multiple processing modules to be invoked based on the type of train to be processed and adds the train to be processed to the queue of the first processing module. Each processing module determines the resources occupied by the train or trainset, the start time of occupation, and the end time of occupation. When a train or trainset begins to occupy resources, it is moved from the queue to the processing queue, and the current resource occupation status, start time, and end time of the previous resource occupation are updated. After processing is completed, it is determined whether the train or trainset has a next processing module. If so, it is added to the next module's queue; otherwise, processing ends. This invention optimizes resource allocation through queue management, determining the resources occupied, start time, and end time of occupation for each train, effectively avoiding resource occupation conflicts in the marshalling yard plan, thereby achieving reasonable resource planning for the marshalling yard and improving resource utilization. Attached Figure Description
[0073] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.
[0074] Figure 1 This is a flowchart illustrating the marshalling yard resource utilization plan preparation method provided by the present invention;
[0075] Figure 2 This is an example diagram of train resource occupancy provided by the present invention;
[0076] Figure 3 This is a flowchart illustrating the arrival module provided by the present invention;
[0077] Figure 4 This is a flowchart illustrating the starting module provided by the present invention;
[0078] Figure 5 This is a flowchart illustrating the technical inspection module provided by the present invention;
[0079] Figure 6 This is a flowchart illustrating the disassembly module provided by the present invention;
[0080] Figure 7 This is a flowchart illustrating the assembly module provided by the present invention;
[0081] Figure 8 This is a flowchart illustrating the grouping module provided by the present invention;
[0082] Figure 9 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation
[0083] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.
[0084] The technical solution of this application and how it solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The following is a combination of... Figures 1-8 This invention describes a method for developing a marshalling yard resource utilization plan.
[0085] Figure 1 This is a flowchart illustrating the marshalling yard resource utilization plan preparation method provided by the present invention, as shown below. Figure 1 As shown, the method includes the following:
[0086] Step 101: Obtain the train to be processed. Based on the type of the train to be processed, determine the multiple processing modules that need to be called to plan and process the train to be processed, and add the train to be processed to the queue of the first processing module. The time when the train to be processed is added to the queue of the first processing module is the train's scheduled arrival time.
[0087] The processing modules include: arrival module, dismantling module, assembly module, grouping module, departure module, and technical inspection module.
[0088] Step 102: The processing module determines the resources, start time and end time of the first train or the first train group to occupy the corresponding resource set of 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 processing module's corresponding resource set. 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.
[0089] Step 103: When the start time of the first train or the first train group occupying 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 or the first train group 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.
[0090] Step 104: When the departure time of the second train or the second train group from the processing set arrives, remove the second train or the second train group from the processing set of the processing module. The second train is the train that leaves the processing set of the processing module earliest, and the second train group is the train group that leaves the processing set of the processing module earliest.
[0091] Step 105: Determine whether the second or third train has a next processing module.
[0092] The third train was acquired by assembling the second train group.
[0093] Step 106: 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. 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. The end time of the resource set occupied by the second or third train is determined to be the time when the second or third train is added to the processing set of the next processing module.
[0094] Step 107: If there is no next processing module for the second or third train, then the processing of the second or third train ends. The end time of the second or third train's occupation of the resource set is the time when the second or third train leaves the set from the processing of the current processing module.
[0095] In practical applications, train types include four categories: un-adjusted transfer, partial refitting, arrival-dismantling, and self-arranged originating trains. Train operations at marshalling yards are divided into arrival, dismantling, assembly, marshalling, and departure, requiring resources such as tracks, technical inspection teams, and hump yard and marshalling yard locomotives. Based on this, service nodes are defined as the following sets: arrival yard tracks (tracks capable of arrival operations), marshalling yard tracks (tracks capable of dismantling / assembly / marshalling operations), departure yard tracks (tracks capable of departure operations), technical inspection teams, hump yard locomotives, and marshalling yard locomotives. Each of these service nodes has a maximum service capacity constraint, i.e., a maximum resource quantity. Resource utilization plans are then developed for each operation at the marshalling yard (arrival, dismantling, assembly, marshalling, and departure) in modules.
[0096] Combination Figure 2 The processing procedures and resource usage for different types of trains are explained. Figure 2 This is an example diagram of train resource occupancy provided by the present invention.
[0097] in, C is the set of tracks where trains heading in the direction of d𝑖𝑟 can be received at arrival station 𝑎, and C is the set of technical inspection teams. It is a collection of camel hump stock lines. It is a collection of hump yard shunting locomotives, with the number of hump yard tracks equal to the number of shunting locomotives, and they are used in conjunction with each other. It is a marshalling yard m The set of tracks in the direction of d𝑖𝑟 where trains can stop. It is a peak tail shunting unit collection. It is the departure area The direction in which trains can stop is A collection of stock market channels. It is a type of k Direction is dir Train technical inspection operation time, This is the waiting time to access the departure area. It is the time to wait for disintegration. It is a type of k Direction is dir The time required for train dismantling operations. Assembly and operation time, This is the waiting time for group formation. It is a type of k Direction is dir Train formation operation time, It is a type of k Direction is dir The train's waiting time for departure. Time for unloading and hanging operations.
[0098] like Figure 2 As shown, when the type of train to be processed is a non-adjustment transfer, the train to be processed needs to perform arrival operations and departure operations in sequence, which are mapped to the resource queue and occupied in sequence as follows: occupy the arrival yard track set, and the occupation time is the waiting time to access the departure yard; simultaneously occupy the departure yard track set and the technical inspection team set, and the occupation time is the technical operation time; occupy the departure yard track set, and the occupation time is the waiting time to depart.
[0099] Combination Figure 2 When the type of train to be processed is partially modified, the train to be processed needs to perform arrival, coupling / uncoupling, and departure operations in sequence, and be mapped to the resource queue, and occupy them in the following order: occupy the arrival yard track set, and occupy the time waiting to access the departure yard; occupy the departure yard track set and the technical inspection team set at the same time, and occupy the time technical operation time; occupy the departure yard track set, and occupy the time the coupling / uncoupling operation time and the waiting departure time are combined.
[0100] Combination Figure 2When the type of train to be processed is arrival and dismantling, the train to be processed needs to undergo arrival and dismantling operations in sequence, and be mapped to the resource queue, and occupy them in the following order: simultaneously occupy the arrival yard track set and the technical inspection team set, and occupy the time for technical inspection operation; occupy the arrival yard track set, and occupy the time for waiting for dismantling; simultaneously occupy the hump yard track set and the hump shunting locomotive set, and occupy the time for dismantling operation.
[0101] Combination Figure 2 When the train to be processed is a self-organized originating train, the train needs to undergo assembly, marshalling, and departure operations in sequence, and be mapped to the resource queue, and occupy them in the following order: occupy the marshalling yard track assembly, the occupation time is the sum of the assembly operation time and the waiting marshalling time; occupy the marshalling yard track assembly and the tail shunting locomotive assembly, the occupation time is the marshalling operation time; occupy the marshalling yard track assembly, the occupation time is the waiting time to access the departure yard; simultaneously occupy the departure yard track assembly and the technical inspection team assembly, the occupation time is the technical operation time; occupy the departure yard track assembly, the occupation time is the waiting time to depart.
[0102] In practical applications, after acquiring the train to be processed, the processing flow and multiple processing modules to be called are determined according to the type of the train (unredirected transfer, partial adaptation, arrival dismantling, self-arranged departure, etc.). The train to be processed is then added to the queue of the first processing module to ensure that the station operation plan for the train to be processed meets the operation requirements.
[0103] Optionally, in one possible implementation, step 101 above, which determines the multiple processing modules to be invoked for planning the train to be processed based on the type of train to be processed, includes:
[0104] If the type of train to be processed is a non-delayed transfer, then the multiple processing modules are the arrival module and the departure module in sequence;
[0105] If the type of train to be processed is partially modified, then the multiple processing modules are the arrival module and the departure module in sequence;
[0106] If the type of train to be processed is arrival dismantling, then the multiple processing modules are the arrival module and the dismantling module in sequence;
[0107] If the type of train to be processed is self-organized origin, then the multiple processing modules are, in order, assembly module, marshalling module, and departure module.
[0108] Furthermore, the processing module determines the resources to be occupied by the first train or trainset that enters the queue earliest, as well as the start and end times of resource occupation, based on its own pending queue, processing set, and the maximum resource quantity and resource occupancy status of the corresponding resource set. By considering the maximum carrying capacity of resources and clarifying the resource occupation time, resource overload and resource utilization conflicts are avoided, ensuring the feasibility of the prepared resource utilization plan.
[0109] Furthermore, when the start time for the first train or trainset arrives, it is removed from the pending queue and added to the processing set, and its departure time from the processing set is updated. This step enables dynamic updates to the job status, ensuring that the processing progress of each train or trainset can be tracked. By updating the occupancy time of the processing set, accurate time information is provided for subsequent scheduling decisions, which helps optimize the overall operation of the marshalling yard.
[0110] Furthermore, when the departure time of the second train or trainset arrives, it is removed from the processing set. The second train is the train that leaves the processing module's processing set earliest, and the second trainset is the trainset that leaves the processing module's processing set earliest. In practice, resources are freed up for the entry of subsequent trains or trainsets after the train or trainset completes its work in the processing module. By updating the processing set in a timely manner, resources are ensured to be used efficiently, avoiding idle waiting.
[0111] Furthermore, determine whether the second train or the third train assembled from the second trainset has a next processing module. If a next processing module exists, it means that the operation process of the train or trainset is not yet complete and needs to continue to the next step; if it does not exist, it means that the operation process of the train or trainset has ended.
[0112] Specifically, if a second or third train has a subsequent processing module, it is added to the processing queue of that module, and its addition time and resource usage end time are determined. This step ensures the orderly flow of trains between different processing modules, guaranteeing that each train can complete all necessary operations according to the predetermined process. Precise timing further optimizes resource utilization efficiency and avoids unnecessary waiting and conflicts.
[0113] Conversely, if the second or third train does not have a subsequent processing module, processing for that train or trainset ends, and the end time for its resource occupation is determined by the time it leaves the current processing module. This step marks the end of the train or trainset's operational process at the marshalling yard, releasing resources for use by other trains or trainsets. This helps improve the resource turnover efficiency of the entire marshalling yard, ensuring its continuous and efficient operation.
[0114] This application, based on queuing theory, treats key resources in marshalling yards, such as tracks, technical inspection teams, and shunting locomotives, as service nodes. Each service node has a maximum service capacity limit and service time standard. Trains or train sets are the service objects flowing through these nodes, and the service objects determine which service nodes they flow through and their flow order based on their attributes. The core of the model lies in obtaining the service capacity and time standard of each service node. By determining the entry and exit times of each train set or train from the service node queue, the capacity occupancy of the service node is determined, further judging whether the next service object is allowed to enter the service node and its entry time. This effectively avoids resource occupancy conflicts in the marshalling yard in the plan, thereby achieving reasonable planning for station phases. This method simplifies the complex marshalling yard operations into a series of resource occupancy and release processes through queue theory, establishes a resource queue mapping mechanism, and provides a structured method to handle marshalling yard resource allocation problems. It accurately calculates resource occupancy time. Compared with existing manual planning based on experience, the planning process is more transparent and controllable, improves the utilization rate of station resources, and enhances the applicability of the plan. It lays a theoretical foundation for the automatic compilation of station operation plans and has strong practical value and innovation.
[0115] Understandably, the above steps have enabled the rational allocation of marshalling yard resources, improved resource utilization, optimized operational processes, reduced resource conflicts, and provided strong support for the efficient operation of railway transportation.
[0116] Based on the above description, 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 working principle of each processing module will be explained in detail below.
[0117] Specifically, in one possible implementation, the aforementioned processing module is an arrival module; step 102, 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, determines the resources, start occupancy time, and end occupancy time of the first train occupying the resource set corresponding to the processing module, including:
[0118] 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 arrival module's processing queue.
[0119] 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.
[0120] The first train is determined to occupy any unoccupied track in the arrival yard track set;
[0121] If the first train is an arriving dismantling 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 arrival 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 teams, the first train's occupation of the technical inspection team, the start time of occupation, and the end time of occupation are determined. The time when the first train is added to the waiting queue of the dismantling module is the end time of the first train occupying the technical inspection team set. The end time of the first train occupying the arrival yard track set is the time when the first train is added to the processing set of the dismantling module.
[0122] The following is combined with Figure 3 The working principle of the arrival module is explained in detail. Figure 3 This is a flowchart illustrating the arrival module provided by the present invention.
[0123] like Figure 3 As shown, the train enters the train assembly area to be connected to the arrival yard. The time is the planned arrival time, that is... Perform an arrival field track capability assessment; if the arrival field... Destination direction is The number of trains is less than the number of arrivals. docking The number of tracks for trains traveling in a particular direction, i.e. The train that will be the first to enter the waiting arrival station assembly line will be the one that arrives first. train Access to arrival station, update train Arrival time is Otherwise the train Waiting to connect until the trains assemble Trains in the middle Depart, update the train The status is "Train has arrived," and the arrival time is... ,in This refers to the train interval. The track occupancy status is updated for any arrival station. docking Tracks of trains heading in the opposite 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 .
[0124] 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.
[0125] 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... .
[0126] 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:
[0127] 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.
[0128] 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 as the sum of the end time of the second train occupying the departure yard track set and the train interval time.
[0129] The occupied departure track of the first train is determined to be any unoccupied track in the set of departure tracks;
[0130] 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.
[0131] 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.
[0132] 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.
[0133] 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.
[0134] 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.
[0135] 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 Trains in the middle Departure, train update The status is "Train has entered the departure yard," and the entry time is... ,in This refers to the train interval.
[0136] Update the resource status corresponding to the previous module. If the train is a self-organized originating train, that is... The release of the marshalling yard track resources occupied by each train set that makes up the train, i.e. The train sets have been updated to If the train is a non-depressurized transfer train or a partially modified train, that is... Or 2, the release of resources at the arrival point of the stock market. Arrival train assembly update Update the list of trains awaiting connection to the departure station. .
[0137] Update the lane occupancy status for any starting point. docking Tracks of trains heading in the opposite 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 departure train assembly. Update: Trains awaiting technical inspection are assembling. and trains Joining the set time .
[0138] Call the technical inspection module to determine the technical inspection team occupying the train, the start time of occupation, and the end time of occupation.
[0139] Determine the train type; if the train For unadjusted transfers or self-compiled origins, i.e. or Update train departure times If the train For partially modified trains, namely If necessary, the coupling / uncoupling operation will be carried out, and the train departure time will be updated. Update the lane occupancy status. Update train collection .
[0140] 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:
[0141] 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.
[0142] 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.
[0143] The technical inspection team occupying the first train is determined to be any unoccupied technical inspection team in the set of technical inspection teams;
[0144] Determine the technical inspection duration of the first train based on its type;
[0145] 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.
[0146] 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.
[0147] 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, meaning... So the train This shift was occupied for technical inspection work, Update: Trains awaiting technical inspection are assembling. Technical inspection trains assembled .
[0148] train Complete technical inspection and update the technical inspection completion time. Update the status of the technical inspection team. Update the collection of technical inspection trains .
[0149] Specifically, in one possible implementation, the processing module is a dismantling module; in step 102 above, 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 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, includes:
[0150] 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.
[0151] If not empty, in chronological order of planned departure time, check whether the number of cars currently assembled in each direction corresponding to each planned departure train in the planned departure train set meets the planned train formation requirements; if it does, then the first train is designated as the train to be dismantled.
[0152] If the conditions 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 the train to be dismantled. If it is not, the first train will be the train to be dismantled.
[0153] 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 to the time when the trains to be dismantled are added to the processing queue of the dismantling module.
[0154] 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.
[0155] The hump yard locomotive occupied by the train to be dismantled is determined to be any unoccupied hump yard locomotive in the hump yard locomotive set;
[0156] The duration of the dismantling operation is determined based on the type and direction of the train to be dismantled.
[0157] 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.
[0158] The following is combined with Figure 6 The working principle of the disassembly module is explained in detail. Figure 6 This is a flowchart illustrating the disassembly module provided by the present invention.
[0159] Combination Figure 6 , To assemble for the planned departure of the train, This module is over-aggregated and has no practical significance. .
[0160] Assess the assembly status of trains scheduled to depart, and the assembly of trains scheduled to depart. The earliest train departing from China For any grouping direction Each train set track The direction in which vehicles can stop is the same as the direction of the train formation, that is... The number of vehicles gathered Does the sum satisfy the train? The required number of vehicles for this formation direction If the conditions are met, then depart from the train assembly point. Trains removed from China Repeat the above judgment until the trains are assembled. An empty string indicates that all trains scheduled to depart have assembled, and the trains to be dismantled will be added to the assembly at this point. Treat it as a train to be dismantled; if this is not met, the train will be... Viewed as a train disintegrating from its target The train that will be added first to the assembly of trains to be dismantled, and whose train set direction is... The train's formation direction, i.e. , View it as a train awaiting dismantling.
[0161] Determine if there are available hump yard locomotives. If the number of trains being dismantled is less than the number of hump yard locomotives, then... If there is available locomotive, the train dismantling start time will be updated to [date / time]. Otherwise the train Waiting to be dismantled, until the first train in the dismantling train assembly completes the dismantling operation. Dismantling can only begin after dismantling is complete, and the start time for dismantling must be updated. .
[0162] Update the resource status of the previous module to reach the current stock market status. Arrival at the train station Waiting for the dismantling train to assemble .
[0163] Update server occupancy status for any peak server loadout. None of the dismantled trains occupied the shunting locomotive. Then let Update the assembly status of the dismantled train. .
[0164] Train dismantling complete; dismantling completion time updated. Update the machine occupancy status. Update train assembly status. .
[0165] Furthermore, determine the train crew within the train. g Whether it has reached its destination; if so, that is... If the condition is met, the processing of the train set will end; otherwise, the train set will be... g Add to the waiting queue. Update the train set assembly status .
[0166] Specifically, in one possible implementation, the processing module is an aggregation module; in step 102 above, based on the processing module's queue of vehicles awaiting processing, the processing module's processing set, the maximum resource quantity and resource occupancy status of the processing module's corresponding resource set, the resources occupied by the first vehicle group in the processing module's corresponding resource set, the start time of occupation, and the end time of occupation are determined. The first vehicle group is the earliest vehicle group to enter the queue of vehicles awaiting processing, including:
[0167] Set the start time of the first train group occupying the track set of the marshalling yard corresponding to the assembly module as the time when the first train group is added to the waiting queue of the assembly module;
[0168] The lane occupied by the first train set is determined to be any lane in the set of lanes in the marshalling yard 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 can be parked on that lane.
[0169] Determine if the currently scheduled departure train assembly is empty;
[0170] 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.
[0171] If the conditions are met, the planned departure train is considered as 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.
[0172] The following is combined with Figure 7The working principle of the aggregation module is explained in detail. Figure 7 This is a flowchart illustrating the aggregation module provided by the present invention.
[0173] Combination Figure 7 , To assemble for the planned departure of the train, This module is over-aggregated and has no practical significance. .
[0174] The first train crew to join the assembly. Commence assembly; update crew joining assembly time. At the same time, update the train crew assembly status, and the train crews to be assembled. Assembly of train crews Update the lane occupancy status for any group of tracks. docking Track of steering train And the direction of the track where the train sets are stored Including train set direction ,Right now , stock channel Current number of vehicles stored Plus train The direction of the center is Number of train sets The sum is less than the maximum number of vehicles that can be stored on that track. ,make Update the set of car groups stored on this track to .
[0175] Assess the assembly status of trains scheduled to depart and the assembly status of trains awaiting departure. The earliest train departing from China For any grouping direction Each train set track The direction in which vehicles can stop is the same as the direction of the train formation, that is... Number of vehicles assembled Does the train meet the requirements? The required number of vehicles for this formation direction If the conditions are met, the train will... Viewed as a target assembly train Otherwise, the assembly module will be called again.
[0176] For the target assembly train any grouping direction The assembly of car groups, the earliest car group to join the assembly. The assembly ends at the maximum time of the assembly end time for each group direction, i.e. The target assembly train consists of the aforementioned train sets. Simultaneously update the train set status and store the train set on the track. Assembly of train crews Trains awaiting assembly Update train status. .
[0177] 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:
[0178] 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.
[0179] 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.
[0180] The first train is determined to occupy any unoccupied peak tail shunting locomotive in the peak tail shunting locomotive set;
[0181] The marshalling operation time for the first train is determined based on its type and direction.
[0182] 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.
[0183] The following is combined with Figure 8 The working principle of the grouping module is explained in detail.
[0184] Figure 8 This is a flowchart illustrating the grouping module provided by the present invention.
[0185] 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. .
[0186] 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 .
[0187] Update train end formation time Waiting to be connected to the departure station = Simultaneously update the equipment adjustment status. Update and wait for trains to be connected to the departure station. .
[0188] It should be noted that the explanations of the above symbols are detailed in Tables 1 and 2.
[0189] Table 1. Symbol Explanation 1
[0190]
[0191] Table 2 Symbol Explanation 2
[0192]
[0193] The marshalling yard resource utilization planning method provided in this embodiment determines multiple processing modules to be invoked based on the type of train to be processed, and adds the train to be processed to the waiting queue of the first processing module. Each processing module determines the resources occupied by the train or trainset, the start time of occupation, and the end time of occupation. When a train or trainset begins to occupy resources, it is moved from the waiting queue to the processing queue, and the departure time is updated. After processing is completed, it is determined whether the train or trainset has a next processing module. If so, it is added to the next module's queue; otherwise, processing ends. This embodiment optimizes resource allocation through queue management, determines the resources occupied by each train, the start time of occupation, and the end time of occupation, effectively avoids resource occupation conflicts in the planning of marshalling yards, thereby achieving reasonable planning of marshalling yard resources and improving the utilization rate of marshalling yard resources.
[0194] In addition, this application also provides a marshalling yard resource utilization plan preparation device, the system including a calling module and multiple processing modules; the multiple processing modules include: arrival module, dismantling module, assembly module, marshalling module, departure module, and technical inspection module;
[0195] The calling module is used to obtain the trains to be processed. Based on the type of the train, it determines the multiple processing modules that need to be called to plan and process the train, and adds the train to be processed to the queue of the first processing module. The time when the train is 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, and departure module.
[0196] The processing module is used to determine the resources, start time and end time of the first train or the first train group occupying the corresponding resource set of the processing module based on the processing module's pending queue, the processing set of the processing module, and the maximum resource amount of the processing module's corresponding resource set. 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.
[0197] The processing module is also used to 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 when the start time of the first train or the first train group occupying the resource set corresponding to the processing module arrives; and 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.
[0198] The processing module is also used 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. The second train is the train that leaves the processing set of the processing module earliest, and the second train group is the train group that leaves the processing set of the processing module earliest.
[0199] The processing module is also used to determine whether the second or third train has a next processing module; the third train is the train obtained by assembling the second train group; if the second or third train has a next processing module, then the second or third train is added to the waiting queue of the next processing module, and the time when the second or third train is added to the waiting queue of the next processing module is determined as 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 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 the processing of the second or third train ends, 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.
[0200] In the marshalling yard resource utilization planning device provided in this embodiment, the calling module determines the multiple processing modules to be called based on the type of train to be processed, and adds the train to be processed to the waiting queue of the first processing module. Each processing module determines the resources occupied by the train or trainset, the start time of occupation, and the end time of occupation. When a train or trainset begins to occupy resources, it is moved from the waiting queue to the processing queue, and the current resource occupation status, start time of occupation, and end time of the previous resource occupation are updated. After processing is completed, it is determined whether the train or trainset has a next processing module. If so, it is added to the next module queue; otherwise, processing ends. The solution in this embodiment optimizes resource allocation through queue management, determines the resources occupied, start time of occupation, and end time of occupation for each train, effectively avoids resource occupation conflicts in the marshalling yard in the plan, thereby achieving reasonable planning of marshalling yard resources and improving the utilization rate of marshalling yard resources.
[0201] Figure 9 This is a schematic diagram of the structure of the electronic device provided by the present invention, such as... Figure 9 As shown, the electronic device may include a processor 910, a communications interface 920, a memory 930, and a communication bus 940. The processor 910, communications interface 920, and memory 930 communicate with each other via the communication bus 940. The processor 910 can call logical instructions from the memory 930 to execute a marshalling yard resource utilization plan compilation method.
[0202] Furthermore, the logical instructions in the aforementioned memory 930 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0203] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer is able to execute the marshalling yard resource utilization plan preparation method provided by the above methods.
[0204] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to perform the marshalling yard resource utilization planning method provided by the above methods.
[0205] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.
[0206] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.
[0207] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A marshalling yard resource utilization plan making method, characterized by, 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 of claim 1, wherein, 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 of claim 1, wherein, 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 as 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 of claim 2 or 3, wherein, 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 conditions are not met, the first train in the planned departure train set whose current number of cars does not meet the formation requirements is considered the target train. According to the order in which trains are added to the processing queue of the dismantling module, it is 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 is taken as the train to be dismantled; if it is not, the first train is taken 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; Determine the marshalling operation time for the first train 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 that need 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 the 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, the assembly module, the marshalling module, and the departure module.
9. A marshalling yard resource utilization planning device, characterized in that, The system includes: Calling module and multiple processing modules; The multiple processing modules include: arrival module, dismantling module, assembly module, grouping module, departure module, and 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.