A method for automatically generating shunting operation plans at intermediate railway freight stations

Abstract

This invention discloses an automatic generation method for shunting operation plans at intermediate railway freight stations, comprising: S1, establishing an automatic generation system for shunting operation plans at intermediate railway freight stations, maintaining its basic information, and configuring system business rules to facilitate subsequent simulation of track conditions, vehicle conditions, vehicle grouping, and vehicle dispatching needs at the freight yard, thereby ultimately simulating the dispatching needs of vehicles on each track; S2, inputting or importing current vehicle information into the system, and the system identifies vehicle groups and target tracks according to business rules, generating dispatching task tables for each track and clarifying dispatching tasks; S3, using an exhaustive algorithm to simulate all possible shunting operations, and then using the system business rules that must be followed in actual shunting operations to eliminate shunting possibilities that do not meet the requirements, ultimately generating an operation plan that guides actual shunting operations. This invention enables dispatchers at freight yards to quickly simulate the current vehicle conditions at the freight yard and quickly generate efficient and logically sound shunting operation plans to guide actual shunting operations, reducing the manpower costs of dispatching work at the yard and improving the generation efficiency of shunting operation plans.

Description

Technical Field

[0001] This invention relates to the field of railway intermediate station shunting operation technology, specifically to a method for automatically generating railway freight intermediate station shunting operation plans. Background Technology

[0002] Currently, most technologies related to railway station shunting operation planning are used to guide shunting operations at marshalling yards. For example, Chinese patent CN202110913343.7 describes a system for simulating the execution process of shunting operation planning at railway passenger stations, and Chinese patent CN201810598936.7 describes a method for compiling shunting operation plans for coupling and uncoupling trains. However, no related technologies have been found to guide shunting operations at intermediate stations. Existing technologies cannot be directly applied to business scenarios that guide shunting operations at intermediate stations. Therefore, with the increasing demand for shunting operations at intermediate stations, it has become urgent to develop an automatic method for generating shunting operation plans for railway freight intermediate stations. Summary of the Invention

[0003] This invention provides a method for automatically generating shunting operation plans for intermediate railway freight stations, filling the gap in existing technologies for automatically generating shunting operation plans for intermediate railway freight stations.

[0004] To achieve the above objectives, the present invention employs the following technical solution:

[0005] A method for automatically generating shunting operation plans at intermediate railway freight stations includes the following steps:

[0006] S1. Establish an automatic generation system for shunting operation plans at intermediate railway freight stations, maintain its basic information, and configure system business rules to facilitate subsequent simulation of track conditions, vehicle conditions, vehicle grouping, and vehicle dispatching needs at freight yards, thereby ultimately simulating the dispatching needs of vehicles on each track.

[0007] S2. Input or import current vehicle information into the system. The system identifies vehicle groups and target lanes according to business rules, generates a dispatch task table for each lane, and clarifies the dispatch tasks.

[0008] S3. Use an exhaustive algorithm to simulate all possible shunting operations, then use the system business rules that need to be followed in actual shunting operations to eliminate shunting possibilities that do not meet the requirements, and finally generate a work order that can guide actual shunting operations.

[0009] As a preferred option of the above scheme, step S4 is also included: the manager adjusts and confirms the final work order.

[0010] As a preferred embodiment of the above scheme, in step S1, the basic system information includes:

[0011] Site management: includes site name;

[0012] Track management includes track name, track group, track user, track terminal signal, associated consignee, and track parking limit;

[0013] Signal line management includes departure tracks, arrival tracks, starting signals, transfer signals, and terminal signals;

[0014] Product Name Assignment Management: This includes the product name and its assigned section;

[0015] Vehicle type and lane management: including vehicle type name and its assigned lane;

[0016] Train identification rule management: including train identification scenarios and train identification conditions;

[0017] Team management: includes team name and team member management;

[0018] Consignee management: includes consignee name and the section to which the consignee belongs;

[0019] User management includes user account and password, permissions, and department affiliation;

[0020] Department management: This includes department structure tree management.

[0021] As a preferred option of the above scheme, in step S2, when importing business information, the imported table must include the following basic information: the track where the vehicle is located, the consignee corresponding to the vehicle, the vehicle type, the empty weight of the vehicle, the category of goods corresponding to the vehicle, the vehicle model, and the vehicle ticket number.

[0022] As a preferred embodiment of the above scheme, the rules for automatically identifying vehicle groups and target lanes in step S2 are as follows:

[0023] After obtaining the current vehicle information, the system determines whether there is a target lane. If there is, it determines whether the adjacent vehicles are in the same target lane, that is, whether the current vehicle and the adjacent vehicles can be grouped together. If not, it determines the current lane category.

[0024] If the current stock channel is a station stock channel, then the grouping situation, target stock channel situation and direction situation are analyzed based on whether the destination station is the current station and whether it is empty or heavy;

[0025] If the current stock channel is a cash stock channel, then the grouping situation, target stock channel situation, and direction situation are analyzed based on the weight of the cash flow.

[0026] As a preferred embodiment of the above scheme, step S3 specifically includes:

[0027] S301, the shunting operation planning and dispatching room provides shunting task group information, including the number of cars to be picked up and delivered, the target track, the current track, the task number, the current track type, the target track type, and the task group direction information;

[0028] S302. Based on geographical location, transfers are divided into on-exchange transfers and off-exchange transfers. On-exchange transfers mean that the current stock channel is on-exchange and the target stock channel is on-exchange; off-exchange transfers mean that the current stock channel is on-exchange and the target stock channel is off-exchange.

[0029] S303. Formulate vehicle pick-up and delivery task groups, that is, formulate the smallest task unit, extract all off-site dispatch task group information in step S301, and calculate the task group plan according to the number of vehicles picked up and delivered in the task group, the current track, the target track, the current track type, the target track type, the track temporary storage limit, and the track vehicle limit. Place all task groups that meet the conditions of the number of vehicles picked up and delivered, the current track, the target track, the current track type, and the target track type together to form a hookable task group.

[0030] S304. Extract the task grouping scheme for each area in step S303, and calculate the task score based on the position of each number in the shunting task group and whether there are any obstacles from other task groups in front. If none of the numbers in the task group are blocked, the task group score is 100 points. If the vehicle does not get 100 points, it needs to be marked as needing to be hooked and the hooking position is recorded. If all task groups are on the same track, it is necessary to verify and mark whether the target of the task group has the same target track to determine whether the vehicle needs to use the drop method to untangle the current track. That is, whether the vehicles in the track need to be placed in the temporary track according to the target track dimension and the task groups with the same target track in the task group need to be connected and placed to reduce the number of shunting operations.

[0031] S305. Calculate branches for each scheme group based on the results obtained in step S304.

[0032] S306. Exhaustively enumerate all possibilities of combinations within the branches in step S305, determine the rationality of the planned route task, and combine and arrange all branch results to form a complete set of grouped route schemes.

[0033] S307. Generate a work plan based on the task grouping route scheme set in step S306, and determine the vehicle shunting area location based on the station, prioritizing the execution of in-station shunting task groups that are not blocked by vehicles.

[0034] S308. After step S307 reaches a point where no tasks can be executed within the field, the grouping scheme is calculated by grouping.

[0035] S309. After confirming the current group route, it is necessary to verify whether there is an on-site task group in the current vehicle, and to perform the operations of adding or removing hooks for the on-site task before proceeding to the target area to complete the hooking operation plan of the current task group.

[0036] S310. After obtaining all executable plans by iteratively executing steps S307-S309 using the route grouping and route scheme set from step S306, sort the work plan sheet according to the number of hookings and round trips. In principle, the route scheme with the fewest hookings and round trips is sorted in ascending order and returned to the user.

[0037] As a preferred embodiment of the above scheme, in step S304, the score is calculated according to the following formula (1):

[0038]

[0039] In the formula, point is the task group score, k is the number of vehicles on the outside of the group, and p is the total number of vehicles in the group.

[0040] As a preferred embodiment of the above scheme, in step S305, the branching algorithm includes:

[0041] S3051. Initialization and Deep Copy: Perform a deep copy of the flipHookList of each PointOrderVo object in the input list L, and update the flipHookList of the object.

[0042] S3052. Sorting: Sort list L in descending order of point value to generate a new list L';

[0043] S3053, Grouping by point value: Group L' by point value to generate mapping G;

[0044] S3054. Generate permutations and combinations: Initialize the current permutation and combination list C, generate all permutations and combinations for each group, and update the current permutation and combination list C;

[0045] S3055. Construct the final result: Reverse each permutation and combination C, create a new TasksVo object T, and add T to the result list R;

[0046] S3056, Return Results: Returns a list of results, R.

[0047] As a preferred option of the above scheme, in step S306, the core of the exhaustive search lies in determining whether each route within the branch is traversable. If it is traversable, then all possible round trips and hook-ups are exhaustively searched, specifically including:

[0048] S3061. Determine if the in-yard task can be executed: Based on the location of the vehicle shunting area in the station, prioritize the execution of in-yard shunting task groups that are not blocked by vehicles. If the task cannot be executed, return to this track to continue execution next time.

[0049] S3062. Determine whether the fall merge can be executed;

[0050] S3063. Determine whether the hook merge can be executed;

[0051] S3064. Based on the current track's maximum number of vehicles and temporary storage limit, as well as the target track's maximum number of vehicles, storage limit, and temporary storage limit, determine whether each hooking task group is within a reasonable range.

[0052] S3065. If all conditions are met, the route is passable; record the route.

[0053] S3066, Record the lines of all branches.

[0054] As a preferred option of the above scheme, step S4 specifically includes: flexibly adjusting the work order sequence according to actual needs, while allowing the insertion of shunting operations that do not conflict with previous work orders.

[0055] Due to the above structure, the beneficial effects of the present invention are as follows:

[0056] By simulating the track conditions, vehicle conditions, vehicle grouping, and vehicle dispatching needs of a freight yard, the dispatching requirements for each track are ultimately simulated. An exhaustive algorithm simulates all possible shunting combinations, and then business rules governing actual shunting operations are used to eliminate unsuitable combinations, ultimately generating a work order that guides actual shunting operations. After the work order is generated, the order of operations can be flexibly adjusted according to actual needs, and shunting operations that do not conflict with previous work orders can be inserted. This method allows freight yard dispatchers to quickly simulate the current vehicle situation at the freight yard and rapidly generate efficient and logically sound shunting work orders to guide actual shunting operations. It reduces the manpower costs of dispatching work at the yard and improves the efficiency of shunting work order generation. Attached Figure Description

[0057] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below.

[0058] Figure 1 This is a flowchart of the method of the present invention;

[0059] Figure 2 This is a system interface diagram of the present invention;

[0060] Figure 3This is a flowchart illustrating the automatic vehicle grouping and target lane identification process of the present invention.

[0061] Figure 4 This is the scheduling task table for each track in this invention;

[0062] Figure 5 This is a schematic diagram illustrating the adjustment and confirmation of the present invention. Detailed Implementation

[0063] The technical solution of the present invention will now be clearly and completely described with reference to the accompanying drawings. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0064] like Figure 1 As shown in the figure, this embodiment provides a method for automatically generating shunting operation plans for intermediate railway freight stations, including the following steps:

[0065] Step S1: Establish an automatic generation system for shunting operation plans at intermediate railway freight stations, maintain its basic information, and configure system business rules to facilitate subsequent simulations of track conditions, vehicle conditions, vehicle grouping, and vehicle dispatching needs at freight yards, ultimately simulating the dispatching needs of vehicles on each track. For example, Figure 2 As shown, the basic system information includes, but is not limited to:

[0066] 1) Site Management: Includes site name;

[0067] 2) Track Management: This includes track name, track group, track user, track terminal signal, associated consignee, and track parking limit;

[0068] 3) Signal line management: including departure track, arrival track, starting signal, transfer signal, and terminal signal;

[0069] 4) Product Name Assignment Management: This includes the product name and its assigned assignment section;

[0070] 5) Vehicle type and lane management: including vehicle type name and its assigned lane;

[0071] 6) Train identification rule management: including train identification scenarios and train identification conditions;

[0072] 7) Team Management: This includes team name and team member management;

[0073] 8) Consignee Management: Includes consignee name and the section to which the consignee belongs;

[0074] 9) User Management: Includes user account and password, permissions, and department affiliation;

[0075] 10) Department Management: This includes department structure tree management.

[0076] Step S2: Input or import current vehicle information into the system. The system identifies vehicle groups and target lanes according to business rules and generates a scheduling task table for each lane (e.g., ...). Figure 4 As shown in the diagram, the scheduling task is clearly defined, indicating which vehicles will go to which tracks. Among these:

[0077] When importing business information, the imported table must include the following basic information: the track where the vehicle is located, the consignee corresponding to the vehicle, the vehicle type, the empty and heavy load of the vehicle, the category of goods corresponding to the vehicle, the vehicle type, and the vehicle ticket number.

[0078] When automatically identifying vehicle groups and target lanes, such as Figure 3 As shown, after obtaining the current vehicle information, the system determines whether there is a target lane. If so, it determines whether adjacent vehicles share the same target lane, i.e., whether the current vehicle and adjacent vehicles can be grouped together. If not, it determines the current lane category. If the current lane is a station lane, it analyzes the grouping, target lane, and direction based on whether the destination is this station and whether the vehicle is empty or loaded. If the current lane is a freight lane, it analyzes the grouping, target lane, and direction based on whether the vehicle is empty or loaded.

[0079] In the appendix Figure 4 In the diagram, track WH3, 710 indicates that 10 vehicles are going to track 7 from track WH3. Track 5 is represented graphically as follows: there are a total of 18+8+23+4 vehicles in track 5. The outermost 4 vehicles go to track 27, the other vehicle types go to track 27 in groups of 23, 8 vehicles go to track KH1, and 18 vehicles go to track 27.

[0080] Step S3: Simulate all possible shunting operations using an exhaustive algorithm, then eliminate shunting possibilities that do not meet the requirements using the system's business rules that must be followed in actual shunting operations, and finally generate a work order that can guide actual shunting operations. Specifically, this includes:

[0081] S301, the shunting operation planning and dispatching room provides shunting task group information, including the number of cars to be picked up and delivered, the target track, the current track, the task number, the current track type, the target track type, and the task group direction information.

[0082] S302. Based on geographical location, the transfer is divided into on-exchange transfer and off-exchange transfer. On-exchange transfer means that the current stock channel is on-exchange and the target stock channel is on-exchange; off-exchange transfer means that the current stock channel is on-exchange and the target stock channel is off-exchange.

[0083] S303. Formulate vehicle pick-up and delivery task groups, that is, formulate the smallest task unit. Extract all off-site dispatch task group information from step S301, such as: task group for site 1: {1, 2, 3, 4, 5}, task group for site 2: {6, 7, 8, 9}. Calculate task group schemes based on the number of vehicles picked up and delivered, current lane, target lane, current lane type, target lane type, lane temporary storage limit, and lane vehicle limit for each task group, such as: site 1 {{1, 2, 4}, {3, 5}}, site 2 {{6, 7}, {8, 9}}. Place all task groups that meet the conditions of the number of vehicles picked up and delivered, current lane, target lane, current lane type, and target lane type together to form hookable task groups.

[0084] S304. Extract the task grouping scheme for each area from step S303, and based on the position of each number in the grouping scheme within the shunting task group and whether there are any obstacles from other task groups ahead, use the formula... To calculate the task score, the formula is as follows: `point` represents the task group score, `k` represents the number of vehicles on the outside of the group, and `p` represents the total number of vehicles in the group. The specific calculation steps include:

[0085] S3041. Initialize and copy input data:

[0086] 1) Perform a deep copy of the input track list I to obtain I', i.e., I' is copyInputArrays.

[0087] 2) Perform a deep copy of the input trajectory mapping M to obtain M', that is, M' is copyInputArraysMap.

[0088] S3042. Collect the order number from the vehicle information:

[0089] For each i∈[0,|I'|) and j∈[0,|I'[i]|):

[0090] Add I'[i][j].order to L, i.e., L←L∪{I'[i][j].order}.

[0091] S3043. Calculate the score for each station:

[0092] For each i∈[0,|S|) and j∈[0,|S[i]|):

[0093] 1) Initialize P[i][j] as a new PointOrderVo object.

[0094] 2) Initialize F[i][j] as a new flipHookList.

[0095] 3) Initialize k = 0 and p = 0.

[0096] 4) For each l∈[0,|S[i][j]|):

[0097] p←p+1.

[0098] If S[i][j][l].order∈L, then k←k+1.

[0099] otherwise:

[0100] Let T_l←M'[S[i][j][l].thisTrackId].

[0101] if If T_l satisfies a specific condition, then k ← k+1.

[0102] 5) Calculate the score

[0103] 6) Set P[i][j].point = point.

[0104] 7) Set P[i][j].mergeListTileList = copyTrackLines(S[i][j]).

[0105] 8) If Then set P[i][j].flipHookList = F[i][j].

[0106] 9) If point = 100, then call D←checkDrop(S[i][j],M').

[0107] 10) If Then set P[i][j].dropList = D.

[0108] 11) Set P[i][j].type = T.

[0109] S3044. Sorting and Returning Results:

[0110] 1) Sort P[i] in descending order of point.

[0111] 2) Add the sorted P[i] to P, i.e., P←P∪{P[i]}.

[0112] Example: Using the {1,2,4} grouping scheme in field 1, calculate the position of serial numbers 1, 2, and 4 in the shunting task group and whether there are any non-task group obstructing them in front to calculate the task score. When 1, 2, and 4 are not obstructed (i.e. all vehicles in the task group are on the outermost side), the task group is judged to have a score of 100 points, and the execution route is directly recorded. If the vehicle does not get 100 points, it is considered that there are other task groups obstructing it. In this case, it is necessary to mark that a hooking operation is required and record the hooking position. If all task groups are on the same track, it is necessary to verify and mark whether the target of the task group has the same target track to determine whether the vehicle needs to use the drop method to de-encode the current track. That is, whether the vehicles in the track need to be placed in the temporary track according to the target track dimension and the task groups with the same target track in the task group need to be connected and placed to reduce the number of shunting operations.

[0113] S305. Using the results from step S304, calculate branches for each scheme group and generate a task execution order based on the scores. If multiple task groups have the highest scores, generate multiple branches. For example, in game 103, {{1,2,4},{3,5}}, both {1,2,4} and {3,5} have a score of 100 after calculation in step S304. Therefore, in the task execution order, there should be branch 1 {{1,2,4},{3,5}} and branch 2 {{3,5},{1,2,4}}. The branching algorithm includes:

[0114] S3051, Initialization and Deep Copy: Perform a deep copy of the flipHookList for each PointOrderVo object in the input list (L), and update the object's flipHookList. The deep copy includes:

[0115] For each (i∈[0,|L|)), if the flipHookList of (L[i]) is not empty, then perform a deep copy of it: [F'_i=

[0116] {

[0117] F_i&if

[0118] &otherwise

[0119] } ]

[0121] Update the flipHookList of (L[i]): [L[i].flipHookList = F'_i];

[0122] S3052, Sorting: Sort the list (L) in descending order of point value and generate a new list (L'): [L'=sort(L,compare(a,b)=P_b-P_a)];

[0123] S3053, Grouping by point value: Group the points (L') by point value and generate a mapping (G): [G={(P,{L'[j]|P_j=P})|P∈{P_0,P_1,…,P_{|L'|-1}}}];

[0124] S3054. Generate permutations and combinations: Initialize the current permutation and combination list. For each group ((P,S)∈G), generate all permutations and combinations (Perm(S)) and update the current list of permutations and combinations (C): [C'={c∪p|c∈C,p∈Perm(S)}][C=C'];

[0125] S3055. Construct the final result: Reverse each permutation (c): [c' = reverse(c)], and create a new TasksVo object (T): [T.maxList = N][T.inputArrays = A][T.inputArraysMap = M][T.pointOrderVoList = c'], and add (T) to the result list (R): [R = R∪{T}];

[0126] S3056, Return Results: Return result list (R): [return R].

[0127] S306. Exhaustively enumerate all possible combinations within the branches in step S305, determine the rationality of the planned scheduling route tasks, and combine and arrange all branch results to form a complete set of grouped route schemes to reduce round trips and wasted trips when off-site task groups are mobilized. For example: In field 1, branch 1 is {{1,2,4},{3,5}}, branch 2 is {{3,5},{1,2,4}}, and in field 2, branch 1 is {{6,7},{8,9}}. The combination results of branch 1 in field 2 are {{1,2,4},{6,7},{3,5},{8,9}}, {{6,7},{1,2,4},{8,9},{3,5}}, or {{3,5},{6,7},{1,2,4},{8,9}}, etc., grouped route schemes.

[0128] The core of exhaustive search lies in determining whether each route within a branch is traversable. If it is traversable, then exhaustively search for all possible round trips and unhooking attempts, specifically including:

[0129] S3061. Determine if the in-yard task can be executed: Based on the location of the vehicle shunting area in the station, prioritize the execution of in-yard shunting task groups that are not blocked by vehicles. If the task cannot be executed, return to this track to continue execution next time.

[0130] S3062. Determine whether the fall merge can be executed;

[0131] S3063. Determine whether the hook merge can be executed;

[0132] S3064. Based on the current track's maximum number of vehicles and temporary storage limit, as well as the target track's maximum number of vehicles, storage limit, and temporary storage limit, determine whether each hooking task group is within a reasonable range.

[0133] S3065. If all conditions are met, the route is passable; record the route.

[0134] S3066, Record the lines of all branches.

[0135] S307. Generate a work plan based on the task grouping route scheme set in step S306, and determine the vehicle shunting area location based on the station, prioritizing the execution of in-station shunting task groups that are not blocked by vehicles.

[0136] S308. After step S307 reaches a point where no tasks can be executed within the field, the grouping scheme is calculated by group. For example, for {1,2,4}, it is first determined whether the task grouping scheme scores 100 points. If it scores 100 points, it is first determined whether there is a drop marker, and the hooking of vehicles 1, 2, and 4 is calculated. Based on the track distribution of the task group, the position and quantity information of vehicles 1, 2, and 4 after the drop are updated. According to the task group numbers 1, 2, 4, the order of hooking can be calculated using an exhaustive method (e.g., if task 1 is parked on track 3, and task groups 2 and 4 are parked on track 5, then the pull order is 1->4->2 or 4->2->1). After parking the car, the feasibility of the current task group is calculated. Based on the current track's car limit, temporary storage limit, and the target track's car limit, storage limit, and temporary storage limit, it is calculated whether each hooking task group is within a reasonable range. If the route is unreasonable, the hooking order is removed until all current hooking order sets are calculated. If there is no usable result, it means that the current task group is not executable and can be regarded as an invalid route and not calculated. Then, the next route plan is searched in the 106 group route plan set. If multiple reasonable routes are calculated according to the hooking order, the current hooking count is calculated. The route with the fewest hooking counts is obtained from the data with the fewest hooking counts, or the route with the fewest hooking counts is obtained from the data with the fewest hooking counts.

[0137] S309. After confirming the current group route, it is necessary to verify whether there is an in-yard dispatch task group in the existing vehicle. After performing the hook-up and hook-down operations for the in-yard task, proceed to the target area to complete the hook-up operation plan for the current task group. Example: In {{1,2,4},{6,7},{3,5},{8,9}}, if task 2 and task 4 are on the same track, and there is an in-yard dispatch task group with the number 10 between the two task groups, then it should be identified that in the process of calculating 4->2, a hook-up and hook-down operation of task 10 should be inserted. After completing the {1,2,4} group, start executing the {6,7} task group, and then start with 108-109 until {{1,2,4},{6,7},{3,5},{8,9}} are completed.

[0138] S310. After obtaining all executable plans by iteratively executing steps S307-S309 using the route grouping and route scheme set from step S306, sort the work plan sheet according to the number of hookings and round trips. In principle, the route scheme with the fewest hookings and round trips is sorted in ascending order and returned to the user.

[0139] Step S4: The manager adjusts and confirms the final work order. Specifically, the order of tasks on the work order can be flexibly adjusted according to actual needs. That is, for tasks that do not affect other tasks, the order can be adjusted (e.g., ...). Figure 5 The tasks in the blue and yellow modules (in the text) also allow the insertion of shunting operations that do not conflict with previous work orders. For tasks that do not affect other tasks, any task can be added temporarily, and the location can be any position (e.g., ...). Figure 5 (Middle green area).

[0140] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for automatically generating shunting operation plans at intermediate railway freight stations, characterized in that, Includes the following steps: S1. Establish an automatic generation system for shunting operation plans at intermediate railway freight stations, maintain its basic information, and configure system business rules to facilitate subsequent simulation of track conditions, vehicle conditions, vehicle grouping, and vehicle dispatching needs at freight yards, thereby ultimately simulating the dispatching needs of vehicles on each track. S2. Input or import current vehicle information into the system. The system identifies vehicle groups and target lanes according to business rules, generates a dispatch task table for each lane, and clarifies the dispatch tasks. S3. Use an exhaustive algorithm to simulate all possible shunting operations, then use the system business rules that need to be followed in actual shunting operations to eliminate shunting possibilities that do not meet the requirements, and finally generate a work order that can guide actual shunting operations. S4. The manager adjusts and confirms the final work order; Step S4 specifically includes: flexibly adjusting the work order sequence according to actual needs, while allowing the insertion of shunting operations that do not conflict with previous work orders.

2. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 1, characterized in that, In step S1, the basic system information includes: Site management: includes site name; Track management includes track name, track group, track user, track terminal signal, associated consignee, and track parking limit; Signal line management includes departure tracks, arrival tracks, starting signals, transfer signals, and terminal signals; Product Name Assignment Management: This includes the product name and its assigned section; Vehicle type and lane management: including vehicle type name and its assigned lane; Train identification rule management: including train identification scenarios and train identification conditions; Team management: includes team name and team member management; Consignee management: includes consignee name and the section to which the consignee belongs; User management includes user account and password, permissions, and department affiliation; Department management: This includes department structure tree management.

3. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 1, characterized in that, In step S2, when importing business information, the imported table must include the following basic information: the track where the vehicle is located, the consignee corresponding to the vehicle, the vehicle type, the empty weight of the vehicle, the category of goods corresponding to the vehicle, the vehicle model, and the vehicle ticket number.

4. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 1, characterized in that, In step S2, the rules for automatically identifying vehicle groups and target lanes are as follows: After obtaining the current vehicle information, the system determines whether there is a target lane. If there is, it determines whether the adjacent vehicles are in the same target lane, that is, whether the current vehicle and the adjacent vehicles can be grouped together. If not, it determines the current lane category. If the current stock channel is a station stock channel, then the grouping situation, target stock channel situation and direction situation are analyzed based on whether the destination station is the current station and whether it is empty or heavy; If the current stock channel is a cash stock channel, then the grouping situation, target stock channel situation, and direction situation are analyzed based on the weight of the cash flow.

5. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 1, characterized in that, Step S3 specifically includes: S301, the shunting operation planning and dispatching room provides shunting task group information, including the number of cars to be picked up and delivered, the target track, the current track, the task number, the current track type, the target track type, and the task group direction information; S302. Based on geographical location, transfers are divided into on-exchange transfers and off-exchange transfers. On-exchange transfers mean that the current stock channel is on-exchange and the target stock channel is on-exchange; off-exchange transfers mean that the current stock channel is on-exchange and the target stock channel is off-exchange. S303. Formulate vehicle pick-up and delivery task groups, that is, formulate the smallest task unit, extract all off-site dispatch task group information in step S301, and calculate the task group plan according to the number of vehicles picked up and delivered in the task group, the current track, the target track, the current track type, the target track type, the track temporary storage limit, and the track vehicle limit. Place all task groups that meet the conditions of the number of vehicles picked up and delivered, the current track, the target track, the current track type, and the target track type together to form a hookable task group. S304. Extract the task grouping scheme for each area in step S303, and calculate the task score based on the position of each number in the shunting task group and whether there are any obstacles from other task groups in front. If none of the numbers in the task group are blocked, the task group score is 100 points. If the vehicle does not get 100 points, it needs to be marked as needing to be hooked and the hooking position is recorded. If all task groups are on the same track, it is necessary to verify and mark whether the target of the task group has the same target track to determine whether the vehicle needs to use the drop method to untangle the current track. That is, whether the vehicles in the track need to be placed in the temporary track according to the target track dimension and the task groups with the same target track in the task group need to be connected and placed to reduce the number of shunting operations. S305. Calculate branches for each scheme group based on the results obtained in step S304. S306. Exhaustively enumerate all possibilities of combinations within the branches in step S305, determine the rationality of the planned route task, and combine and arrange all branch results to form a complete set of grouped route schemes. S307. Generate a work plan based on the task grouping route scheme set in step S306, and determine the vehicle shunting area location based on the station, prioritizing the execution of in-station shunting task groups that are not blocked by vehicles. S308. After step S307 reaches a point where no tasks can be executed within the field, the grouping scheme is calculated by grouping. S309. After confirming the current group route, it is necessary to verify whether there is an on-site task group in the current vehicle, and to perform the operations of adding or removing hooks for the on-site task before proceeding to the target area to complete the hooking operation plan of the current task group. S310. After obtaining all executable plans by iteratively executing steps S307-S309 using the route grouping and route scheme set from step S306, sort the work plan sheet according to the number of hookings and round trips. In principle, the route scheme with the fewest hookings and round trips is sorted in ascending order and returned to the user.

6. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 5, characterized in that, In step S304, the score is calculated according to the following formula (1): In the formula, point is the task group score, k is the number of vehicles on the outside of the group, and p is the total number of vehicles in the group.

7. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 5, characterized in that, In step S305, the branching algorithm includes: S3051. Initialization and Deep Copy: Perform a deep copy of the flipHookList of each PointOrderVo object in the input list L, and update the flipHookList of the object. S3052. Sorting: Sort list L in descending order of point value to generate a new list L'; S3053, Grouping by point value: Group L' by point value to generate mapping G; S3054. Generate permutations and combinations: Initialize the current permutation and combination list C, generate all permutations and combinations for each group, and update the current permutation and combination list C; S3055. Construct the final result: Reverse each permutation and combination C, create a new TasksVo object T, and add T to the result list R; S3056, Return Results: Returns a list of results, R.

8. The method for automatically generating shunting operation plans at intermediate railway freight stations according to claim 5, characterized in that, In step S306, the core of exhaustive search lies in determining whether each route within the branch is traversable. If it is traversable, then all possible round trips and hook-ups are exhaustively searched, specifically including: S3061. Determine if the in-yard task can be executed: Based on the location of the vehicle shunting area in the station, prioritize the execution of in-yard shunting task groups that are not blocked by vehicles. If the task cannot be executed, return to this track to continue execution next time. S3062. Determine whether the fall merge can be executed; S3063. Determine whether the hook merge can be executed; S3064. Based on the current track's maximum number of vehicles and temporary storage limit, as well as the target track's maximum number of vehicles, storage limit, and temporary storage limit, determine whether each hooking task group is within a reasonable range. S3065. If all conditions are met, the route is passable; record the route. S3066, Record the lines of all branches.

Images