Method for automatically generating shunting operation plan list of railway freight intermediate station

Abstract

The invention discloses a railway freight intermediate station shunting operation plan list automatic generation method comprising the following steps: S1, establishing a railway freight intermediate station shunting operation plan list automatic generation system, maintaining basic information of the system, and configuring system business rules, therefore, the station track condition, the vehicle condition, the vehicle grouping condition and the vehicle scheduling demand condition of the freight station can be simulated subsequently, and the vehicle scheduling demand of each station track can be simulated finally. S2, current vehicle information is input or imported into the system, the system identifies vehicle groups and target station tracks according to business rules, a scheduling task table of each station track is generated, and scheduling tasks are clarified; and S3, utilizing an exhaustion algorithm to simulate shunting possibilities of all the train sets, then utilizing system business rules which need to be followed by an actual shunting effect to exclude shunting possibilities which do not meet requirements, and finally generating an operation list which has an effect of guiding the actual shunting effect. According to the invention, the dispatcher of the freight station can rapidly simulate the current vehicle condition of the freight station and rapidly generate the efficient and logic-conforming shunting operation list for guiding the actual shunting operation, so that the labor cost of the dispatching work of the station is reduced and the generation efficiency of the shunting operation list is improved.

Description

Technical Field

[0001] The invention relates to the technical field of shunting operations at railway intermediate stations, and in particular to a method for automatically generating a shunting operation plan sheet at a railway freight intermediate station. Background Art

[0002] Currently, most of the technologies related to railway station shunting operation plans are used to guide shunting operations at marshalling yards, such as Chinese patent CN202110913343.7, a railway passenger station shunting operation plan execution process simulation system, and Chinese patent CN201810598936.7, a method for compiling a shunting operation plan for detaching and coupling trains. However, no relevant technologies for guiding shunting operations at intermediate stations have been found so far, and the existing technologies cannot be directly applied to business scenarios for guiding shunting operations at intermediate stations. Therefore, with the increasing demand for shunting operations at intermediate stations, it has become urgent to develop a method for automatically generating shunting operation plan sheets for railway freight intermediate stations. Summary of the invention

[0003] The invention provides a method for automatically generating a shunting operation plan sheet for an intermediate railway freight station, which fills the gap in the prior art regarding the automatic generation technology of shunting operation plan sheets for intermediate railway freight stations.

[0004] To achieve the above object, the present invention adopts the following technical solutions:

[0005] A method for automatically generating a shunting operation plan sheet for a railway freight intermediate station comprises the following steps:

[0006] S1. Establish an automatic generation system for railway freight intermediate station shunting operation plan sheets, maintain its basic information, and configure system business rules to facilitate subsequent simulation of the track conditions, vehicle conditions, vehicle grouping conditions, and vehicle dispatching requirements of the freight station, and finally simulate the dispatching requirements of each track vehicle;

[0007] S2. Input or import the current vehicle information into the system. The system identifies the vehicle grouping and target track according to the business rules, generates a dispatching task table for each track, and clarifies the dispatching task;

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

[0009] As a preferred embodiment of the above solution, step S4 is also included, in which the manager adjusts and confirms the final work order.

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

[0011] Site management: including site name;

[0012] Track management: including track name, track group, track user, track terminal signal, associated consignee, and track storage limit;

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

[0014] Product name and channel management: including the product name and the channel to which it belongs;

[0015] Vehicle type and track management: including vehicle type name and track it belongs to;

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

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

[0018] Consignee management: including consignee name and consignee’s affiliated channel;

[0019] User management: including login account password, permissions, and department;

[0020] Department management: including department structure tree management.

[0021] As a preferred embodiment of the above scheme, in step S2, when importing business information, the import table must contain 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 corresponding to the vehicle, and the vehicle ticket number.

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

[0023] After the system obtains the current vehicle information, it determines whether there is a target track. If so, it determines whether the adjacent vehicles are in the same target track, that is, whether the current vehicle and the adjacent vehicles can be grouped as one. If not, it determines the current track category.

[0024] If the current track is a station track, the grouping situation, target track situation and direction situation are analyzed according to whether the arrival station is the current station and the empty weight;

[0025] If the current track is a cargo track, the grouping situation, target track situation and direction situation are analyzed according to the empty weight.

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

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

[0028] S302, dividing the maneuver into on-site maneuver and off-site maneuver according to the geographical location, the on-site maneuver means that the current track is on-site and the target track is on-site; the off-site maneuver means that the current track is on-site and the target track is off-site;

[0029] S303, formulate the task grouping of picking up and delivering vehicles, that is, formulate the minimum task unit, extract the task grouping information of all off-site mobilizations in step S301, and calculate the task group plan according to the number of vehicles picked up and delivered by 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, and put all the 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 of each yard area in step S303, and calculate the task score according to the position of each serial number in the grouping scheme in the shunting task group and whether there is any obstruction in front of the non-task group. If all the serial numbers in the task group are not blocked, the task group score is determined to be 100 points. Vehicles that do not get 100 points need to be marked as needing a hook-turning operation and recording the hook-turning position. If all the task groups are on the same track, it is necessary to verify and mark whether the task group targets have the same target track to determine whether the vehicle needs to use the falling method to unmold the current track, that is, whether the vehicle in the track needs 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 times;

[0031] S305, obtaining the result of step S304 and calculating branches for each solution group;

[0032] S306, exhaustively enumerate all possibilities of combinations within the branch in step S305, determine the rationality of the planned scheduling line task, and combine and arrange all branch results to form a complete grouping line solution set;

[0033] S307, generating a work plan sheet according to the task grouping route plan set in step S306, and determining the vehicle maneuvering area location according to the station yard, and giving priority to the on-site maneuvering task group that is not blocked by vehicles in the station yard;

[0034] S308, when step S307 is executed and there is no more on-site task to be executed, the grouping scheme is calculated according to the grouping;

[0035] S309: After confirming the current group route, it is necessary to verify whether there is an on-site transfer task group in the current vehicle, and after adding and removing hooks for the on-site task, go to the target site to complete the hooking operation plan of the current task group;

[0036] S310. After looping through steps S307-S309 to obtain all executable plans using the line grouping line plan set of step S306, sort the work plan sheets according to the number of hooking times and the number of round trips. In principle, the line plans with the least number of hooking times and the fewest number of round trips are sorted in ascending order and returned to the user.

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

[0038]

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

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

[0041] S3051, initialization and deep copy: make 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: sorting the list L in descending order according to the point value to generate a new list L';

[0043] S3053, grouping by point value: group L' by point value to generate a mapping G;

[0044] S3054, generating permutations and combinations: initializing the current permutation and combination list C, generating all permutations and combinations for each group, and updating the current permutation and combination list C;

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

[0046] S3056. Return result: return result list R.

[0047] As a preferred embodiment of the above solution, in step S306, the core of the exhaustive enumeration is to clarify whether each line in the branch is accessible. If it is accessible, all possible round trips and pick-up and drop-off times are exhaustively enumerated, specifically including:

[0048] S3061. Determine whether the on-site task group can be executed: Determine the location of the vehicle maneuvering area according to the station, and give priority to executing the on-site maneuvering task group that is not blocked by vehicles. If it cannot be executed, return to the current track to continue execution next time.

[0049] S3062, determining whether the whereabouts merging can be performed;

[0050] S3063, judging whether the reverse merge can be executed;

[0051] S3064, judging whether each hooking task group is within a reasonable range according to the upper limit of the number of vehicles and the upper limit of temporary storage of the current track at each step, and the number of vehicles, the upper limit of storage, and the upper limit of temporary storage of the target track;

[0052] S3065. If all conditions are met, the route is traversable and the route is recorded;

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

[0054] As a preferred embodiment of the above solution, step S4 specifically includes: flexibly adjusting the operation sequence of the operation list according to actual needs, and allowing the insertion of shunting operations that do not conflict with previous operation lists.

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

[0056] By simulating the track conditions, vehicle conditions, vehicle grouping conditions, and vehicle dispatching requirements of the freight station, the dispatching requirements of each track vehicle can be finally simulated; all vehicle group shunting possibilities are simulated through an exhaustive algorithm, and then the business rules that need to be followed in the actual shunting function are used to exclude shunting possibilities that do not meet the requirements, and finally a work order with the function of guiding actual shunting is generated; after the work order is generated, the operation sequence of the work order can be flexibly adjusted according to actual needs, and shunting operations that do not conflict with the previous work order can be inserted. Through this method, the dispatcher of the freight station can quickly simulate the current vehicle situation of the freight station and quickly generate efficient and logical shunting work orders. Used to guide actual shunting operations. Reduce the manpower cost of the station's dispatching work and improve the efficiency of generating shunting work orders. BRIEF DESCRIPTION OF THE DRAWINGS

[0057] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for describing the embodiments are briefly introduced below.

[0058] Figure 1 is a flow chart of the method of the present invention;

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

[0060] Figure 3The automatic identification of vehicle groups and target tracks flow chart of the present invention;

[0061] Figure 4 The track scheduling task table of the present invention;

[0062] Figure 5 It is a schematic diagram of adjustment and confirmation of the present invention. DETAILED DESCRIPTION

[0063] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of the present invention.

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

[0065] Step S1: Establish an automatic generation system for railway freight intermediate station shunting operation plan, maintain its basic information, and configure system business rules to facilitate subsequent simulation of the track conditions, vehicle conditions, vehicle grouping conditions, and vehicle scheduling requirements of the freight station, and finally simulate the scheduling requirements of each track vehicle. Figure 2 As shown, the basic system information includes but is not limited to:

[0066] 1) Site management: including site name;

[0067] 2) Track management: including track name, track group, track user, track terminal signal, associated consignee, and track storage limit;

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

[0069] 4) Product name and channel management: including the product name and the channel to which it belongs;

[0070] 5) Vehicle type and track management: including vehicle type name and track to which it belongs;

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

[0072] 7) Team management: including team name and team member management;

[0073] 8) Consignee management: including consignee name and consignee’s affiliated channel;

[0074] 9) User management: including login account password, authority, and department;

[0075] 10) Department management: including department structure tree management.

[0076] Step S2: Input or import the current vehicle information into the system. The system identifies the vehicle group and target track according to the business rules and generates a dispatching task table for each track (such as Figure 4 As shown in the figure, the dispatching task is clear and we know which vehicles go to which tracks.

[0077] When importing business information, the import table must include the following basic information: the track where the vehicle is located, the consignee corresponding to the vehicle, the vehicle type, the vehicle's empty weight, the vehicle's corresponding cargo category, the vehicle's corresponding model, and the vehicle's ticket number.

[0078] When automatically identifying vehicle groups and target tracks, Figure 3 As shown, after the system obtains the current vehicle information, it determines whether there is a target track. If so, it determines whether the adjacent vehicles are in the same target track, that is, whether the current vehicle and the adjacent vehicles can be grouped as one. If not, it determines the current track category; if the current track is a station track, the grouping situation, the target track situation and the direction situation are analyzed according to whether the arrival station is this station and the empty weight; if the current track is a cargo track, the grouping situation, the target track situation and the direction situation are analyzed according to the empty weight.

[0079] In the attached Figure 4 In the diagram, 710 for track WH3 means: 10 vehicles are going to track 7 on track WH3. The diagram for track 5 means: there are 18+8+23+4 vehicles in track 5, of which the outermost 4 vehicles go to track 27, and the other vehicles are 23 vehicles going to track 27 together, 8 vehicles going to track KH1 together, and 18 vehicles going to track 27 together.

[0080] Step S3: Use the exhaustive algorithm to simulate all train shunting possibilities, and then use the system business rules that need to be followed in the actual shunting function to eliminate shunting possibilities that do not meet the requirements, and finally generate a work order that can guide the actual shunting function. Specifically include:

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

[0082] S302. The movement is divided into on-site movement and off-site movement according to the geographical location. The on-site movement means that the current track is on-site and the target track is on-site; the off-site movement means that the current track is on-site and the target track is off-site.

[0083] S303, formulate task groups for picking up and delivering vehicles, that is, formulate the minimum task unit, extract the task group information of all off-site transfers in step S301, such as: field 1 task group: {1, 2, 3, 4, 5}, field 2 task group: {6, 7, 8, 9}, and calculate the task group plan according to the number of vehicles picked up and delivered, current track, target track, current track type, target track type, track temporary storage limit, and track vehicle limit of the task group, such as: field 1 {{1,2,4}, {3,5}}, field 2 {{6,7}, {8,9}}, put all task groups that meet the conditions of the number of vehicles picked up and delivered, current track, target track, current track type, and target track type together to form a hookable task group.

[0084] S304: Extract the task grouping scheme of each area in step S303, and calculate the number of each number in the grouping scheme according to the position of each number in the shunting task group and whether there is a non-task group blocking the front through the formula To calculate the task score, point is the task group score, k is the number of vehicles outside the group, and p is the total number of vehicles in the group. The specific calculation steps include:

[0085] S3041, Initialize and copy input data:

[0086] 1) Make a deep copy of the input track line list I to obtain I', that is, I' is copyInputArrays.

[0087] 2) Make a deep copy of the input track line map M to obtain M', that is, M' is copyInputArraysMap.

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

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

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

[0091] S3043. Calculate the score of each site:

[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 list.

[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 Or if T_l satisfies certain conditions, 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, 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] by point from largest to smallest.

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

[0112] For example: using the {1,2,4} grouping scheme in yard 1, calculate the positions of serial numbers 1, 2, and 4 in the shunting task group and whether there are any obstructions ahead that are not in the task group to calculate the task score. When 1, 2, and 4 are not blocked (i.e., all vehicles in the task group are on the outermost side), the score of the task group is determined to be 100 points, and the execution route is directly recorded; vehicles that do not score 100 points are deemed to be blocked by other task groups, and it is necessary to mark the need for hook-turning operation and record the hook-turning position. If all task groups are on the same track, it is necessary to verify and mark whether the task group targets have the same target track to determine whether the vehicle needs to use the falling method to unmute the current track, that is, whether the vehicles in the track need to be placed in the temporary track according to the dimension of the target track 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 times.

[0113] S305. Calculate branches for each solution group based on the result of step S304, and generate a task execution order based on the scores. If there are multiple task groups with the highest scores, generate multiple branches. For example, in 103 field 1, {{1,2,4}, {3,5}}{1,2,4} and {3,5} are all 100 points after calculation in step S304. Then, 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: make a deep copy of the flipHookList of each PointOrderVo object in the input list (L), and update the flipHookList of the object. The deep copy includes:

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

[0116] {

[0117] F_i&if

[0118] &otherwise

[0119] } ]

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

[0122] S3052, sorting: sort the list (L) in descending order according to the 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 (L') by point value, and generate 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 Generate all permutations and combinations (Perm(S)) for each group ((P,S)∈G) and update the current permutation and combination list (C): [C'={c∪p|c∈C,p∈Perm(S)}][C=C'];

[0125] S3055. Construct the final result: reverse each permutation and combination (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 result: return result list (R): [return R].

[0127] S306. Exhaust all possibilities of the combination within the branch in step S305, judge the rationality of the planned scheduling line task, and combine and arrange all branch results to form a complete set of grouped line solutions to reduce the round trips and empty runs when the off-site task group is mobilized. For example: Branch 1 in field 1 is {{1,2,4},{3,5}}, branch 2 is {{3,5},{1,2,4}}, and branch 1 in field 2 is {{6,7},{8,9}}. The combination results include {{1,2,4},{6,7},{3,5},{8,9}} or {{6,7},{1,2,4},{8,9},{3,5}} or {{3,5},{6,7},{1,2,4},{8,9}} and other grouped line solutions.

[0128] The core of exhaustive enumeration is to clarify whether each line in the branch is accessible. If it is accessible, all possible round trips and pick-up and drop-off times are exhaustively enumerated, including:

[0129] S3061. Determine whether the on-site task group can be executed: Determine the location of the vehicle maneuvering area according to the station, and give priority to executing the on-site maneuvering task group that is not blocked by vehicles. If it cannot be executed, return to the current track to continue execution next time.

[0130] S3062, determining whether the whereabouts merging can be performed;

[0131] S3063, judging whether the reverse merge can be executed;

[0132] S3064, judging whether each hooking task group is within a reasonable range according to the upper limit of the number of vehicles and the upper limit of temporary storage of the current track at each step, and the number of vehicles, the upper limit of storage, and the upper limit of temporary storage of the target track;

[0133] S3065. If all conditions are met, the route is traversable and the route is recorded;

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

[0135] S307. Generate an operation plan sheet according to the task grouping route plan set in step S306, determine the vehicle maneuvering area location according to the station yard, and give priority to the on-site maneuvering task group that is not blocked by vehicles on the site.

[0136] S308. When step S307 is executed to the point where there is no on-site task to be executed, the grouping scheme is calculated by group. For example: {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 mark, and the hooks of the dropped vehicles 1, 2, and 4 are calculated. According to the distribution of the task group tracks, the position and quantity information of the dropped vehicles 1, 2, and 4 are updated. According to the task group numbers 1, 2, and 4, the order of hooking is calculated using an exhaustive method (for example, task No. 1 is parked on track three, and task groups No. 2 and No. 4 are parked on track five, then the pulling order is 1->4->2 or 4->2->1). After the car is stored, the feasibility of the current task group is calculated. According to the car number limit and temporary storage upper limit of the current track, as well as the car number, storage upper limit, and temporary storage upper limit of the target track, it is calculated whether each hooking task group is within a reasonable range. If the line is unreasonable, the hooking sequence of the adjustment is eliminated until all current hooking sequence sets are calculated. If there is no available result, it means that the current task grouping cannot be executed, and it can be regarded as an invalid line and not calculated. Then, the next line plan is found in the 106 group line plan set. If multiple reasonable lines are calculated according to the hooking sequence, the current hooking times are calculated to determine the site attributes. The line with the least hooking times is obtained from the data with the least hooking times, or the line with the least hooking times is obtained from the data with the least hooking times.

[0137] S309. After confirming the current grouping route, it is necessary to verify whether there is an on-site transfer task group in the current vehicle, and after adding and removing hooks on the on-site task, go to the target area to complete the hooking operation plan of the current task group. For example: In {{1,2,4},{6,7},{3,5},{8,9}}, with {1,2,4}, if task No. 2 and task No. 4 are on the same track, and there is a task group with on-site transfer task number 10 between the two groups of tasks, it should be identified that the task group should insert the step of adding and removing hooks of task 10 in the process of calculating 4->2, and after completing the {1,2,4} grouping, start executing the {6,7} task grouping and then start with 108-109 until {{1,2,4},{6,7},{3,5},{8,9}} are executed.

[0138] S310. After looping through steps S307-S309 to obtain all executable plans using the line grouping line plan set of step S306, sort the work plan sheets according to the number of hooking times and the number of round trips. In principle, the line plans with the least number of hooking times and the fewest number of round trips are sorted in ascending order and returned to the user.

[0139] Step S4: The manager adjusts and confirms the final work order. Specifically, the work order of the work order is flexibly adjusted according to actual needs, that is, the order of tasks that do not affect other tasks can be adjusted (such as Figure 5 The blue and yellow modules in the task list) allow the insertion of shunting operations that do not conflict with the previous work order. For tasks that do not affect other tasks, any task can be temporarily added, and the location can be anywhere (such as Figure 5 middle green position).

[0140] The above are only preferred embodiments of the present invention and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for automatically generating a shunting operation plan sheet for a railway freight intermediate station, characterized in that: The following steps are involved: S1. Establish an automatic generation system for railway freight intermediate station shunting operation plan sheets, maintain its basic information, and configure system business rules to facilitate subsequent simulation of the track conditions, vehicle conditions, vehicle grouping conditions, and vehicle dispatching requirements of the freight station, and finally simulate the dispatching requirements of each track vehicle; S2. Input or import the current vehicle information into the system. The system identifies the vehicle grouping and target track according to the business rules, generates a dispatching task table for each track, and clarifies the dispatching task; S3. Use an exhaustive algorithm to simulate all train shunting possibilities, and then use the system business rules that need to be followed in actual shunting to eliminate shunting possibilities that do not meet the requirements, and finally generate a work order that can guide actual shunting.

2. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 1, characterized in that: The process also includes step S4, in which the manager adjusts and confirms the final work order.

3. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 1, characterized in that: In step S1, the basic system information includes: Site management: including site name; Track management: including track name, track group, track user, track terminal signal, associated consignee, and track storage limit; Signal line management: including departure track, arrival track, starting signal, transfer signal and terminal signal; Product name and channel management: including the product name and the channel to which it belongs; Vehicle type and track management: including vehicle type name and track it belongs to; Train identification rule management: including train identification scenarios and train identification conditions; Team management: including team name and team member management; Consignee management: including consignee name and consignee’s affiliated channel; User management: including login account password, permissions, and department; Department management: including department structure tree management.

4. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 1, characterized in that: In step S2, when importing business information, the import 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 corresponding to the vehicle, and the vehicle ticket number.

5. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 1, characterized in that: In step S2, the rules for automatically identifying vehicle groups and target tracks are as follows: After the system obtains the current vehicle information, it determines whether there is a target track. If so, it determines whether the adjacent vehicles are in the same target track, that is, whether the current vehicle and the adjacent vehicles can be grouped as one. If not, it determines the current track category. If the current track is a station track, the grouping situation, target track situation and direction situation are analyzed according to whether the arrival station is the current station and the empty weight; If the current track is a cargo track, the grouping situation, target track situation and direction situation are analyzed according to the empty weight.

6. The method for automatically generating a shunting operation plan sheet for a railway freight intermediate station 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 vehicles to be picked up and delivered, the target track, the current track, the task sequence number, the current track type, the target track type, and the task group direction information; S302, dividing the maneuver into on-site maneuver and off-site maneuver according to the geographical location, the on-site maneuver means that the current track is on-site and the target track is on-site; the off-site maneuver means that the current track is on-site and the target track is off-site; S303, formulate the task grouping of picking up and delivering vehicles, that is, formulate the minimum task unit, extract the task grouping information of all off-site mobilizations in step S301, and calculate the task group plan according to the number of vehicles picked up and delivered by 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, and put all the 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 of each yard area in step S303, and calculate the task score according to the position of each serial number in the grouping scheme in the shunting task group and whether there is any obstruction in front of the non-task group. If all the serial numbers in the task group are not blocked, the task group score is determined to be 100 points. Vehicles that do not get 100 points need to be marked as needing a hook-turning operation and recording the hook-turning position. If all the task groups are on the same track, it is necessary to verify and mark whether the task group targets have the same target track to determine whether the vehicle needs to use the falling method to unmold the current track, that is, whether the vehicle in the track needs 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 times; S305, obtaining the result of step S304 and calculating branches for each solution group; S306, exhaustively enumerate all possibilities of combinations within the branch in step S305, determine the rationality of the planned scheduling line task, and combine and arrange all branch results to form a complete grouping line solution set; S307, generating a work plan sheet according to the task grouping route plan set in step S306, and determining the vehicle maneuvering area location according to the station yard, and giving priority to the on-site maneuvering task group that is not blocked by vehicles in the station yard; S308, when step S307 is executed and there is no on-site task to be executed, the grouping scheme is calculated according to the grouping; S309: After confirming the current group route, it is necessary to verify whether there is an on-site transfer task group in the current vehicle, and after adding and removing hooks for the on-site task, go to the target site to complete the hooking operation plan of the current task group; S310. After looping through steps S307-S309 to obtain all executable plans using the line grouping line plan set of step S306, sort the work plan sheets according to the number of hooking times and the number of round trips. In principle, the line plans with the least number of hooking times and the fewest number of round trips are sorted in ascending order and returned to the user.

7. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 6, characterized in that: In step S304, the score is calculated according to the following formula (1): In the formula, point is the task grouping score, k is the number of vehicles outside the group, and p is the total number of vehicles in the group.

8. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 6, characterized in that: In step S305, the branching algorithm includes: S3051, initialization and deep copy: make a deep copy of the flipHookList of each PointOrderVo object in the input list L, and update the flipHookList of the object; S3052, sorting: sorting the list L in descending order according to the point value to generate a new list L'; S3053, grouping by point value: group L' by point value to generate a mapping G; S3054, generating permutations and combinations: initializing the current permutation and combination list C, generating all permutations and combinations for each group, and updating the current permutation and combination list C; S3055, construct the final result: reverse each permutation combination C, create a new TasksVo object T, and add T to the result list R; S3056. Return result: return result list R.

9. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 6, characterized in that: In step S306, the core of the exhaustive enumeration is to determine whether each line in the branch is accessible. If it is accessible, all possible round trips and pick-up and drop-off times are exhaustively enumerated, including: S3061. Determine whether the on-site task group can be executed: Determine the location of the vehicle maneuvering area according to the station, and give priority to executing the on-site maneuvering task group that is not blocked by vehicles. If it cannot be executed, return to the current track to continue execution next time. S3062, determining whether the whereabouts merging can be performed; S3063, judging whether the reverse merge can be executed; S3064, judging whether each hooking task group is within a reasonable range according to the upper limit of the number of vehicles and the upper limit of temporary storage of the current track at each step, and the number of vehicles, the upper limit of storage, and the upper limit of temporary storage of the target track; S3065. If all conditions are met, the route is traversable and the route is recorded; S3066. Record the lines of all branches.

10. The method for automatically generating a railway freight intermediate station shunting operation plan sheet according to claim 2, characterized in that: Step S4 specifically includes: flexibly adjusting the operation sequence of the operation list according to actual needs, and allowing the insertion of shunting operations that do not conflict with the previous operation list.

Images