CN113619653B

CN113619653B - Automatic generation method of shunting operation plan, electronic equipment and medium

Info

Publication number: CN113619653B
Application number: CN202110726989.4A
Authority: CN
Inventors: 王如跃; 万丰丰; 席兴彪; 许晨光; 吴春波; 刘坤; 陈�峰; 李玉月
Original assignee: Casco Signal Ltd
Current assignee: Casco Signal Ltd
Priority date: 2021-06-29
Filing date: 2021-06-29
Publication date: 2023-05-09
Anticipated expiration: 2041-06-29
Also published as: CN113619653A

Abstract

The invention relates to an automatic generation method, electronic equipment and medium of a shunting operation plan, which are used for generating a shunting operation rough plan through a shunting operation task content matching template, carrying out hook-by-hook optimization on the shunting operation rough plan generated by the template through priori knowledge to generate the shunting operation plan, and automatically inserting a single machine plan according to the position and the machine position of a locomotive after the shunting operation plan is generated, so that the automatic generation of the shunting operation plan is realized. Compared with the prior art, the invention has wide practicability, and the hook planning and automatic insertion single-machine special line planning based on priori knowledge can flexibly provide a shunting operation planning scheme, thereby reducing the labor intensity of shunting operation planning of station staff.

Description

Automatic generation method of shunting operation plan, electronic equipment and medium

Technical Field

The present invention relates to a track traffic signal system, and in particular, to an automatic generation method, an electronic device, and a medium for a shunting operation plan.

Background

In order to cope with different operation requirements, the conventional locomotives are utilized to send transported passenger and freight to a destination to complete the passenger and freight tasks, and shunting operations such as disassembly, grouping, unhooking, line transferring and the like are required to be carried out on the conventional trains. The method has the advantages that a shunting operation plan is effectively and reasonably formulated, and the method has important significance for guaranteeing smooth transportation at stations, accelerating the turnover period of vehicles and improving the transportation work efficiency.

The scheduling is the most flexible work in a shunting yard, scheduling rules of shunting operations in different marshalling yards are different, and scheduling methods in the same yard are different under the conditions of stock track occupation and different scheduling states. However, the shunting operation plan of the domestic large-scale marshalling yard mainly depends on manual planning, and comprehensive judgment is needed by virtue of past experience during planning, so that the level of planning personnel directly influences the merits of the plan.

In order to improve the efficiency of shunting operation plans, some beneficial attempts have been made in the industry. According to the method, a shunting operation plan is generated according to the situation of drop-out and is added and modified in a manual mode, but the shunting task is used as a guide, the connection relation among the tracks is not considered, and the automatic generation shunting operation plan is required to be manually modified frequently in the actual use process, so that the automation degree is reduced; the other mode is to summarize the existing shunting operation planning schemes and methods by combining the experience of the former, so as to obtain rules which are followed when the shunting operation planning hook is planned by the man in future.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide an automatic generation method, electronic equipment and medium of a shunting operation plan, which have wide practicability, and the shunting operation plan making scheme can be flexibly provided by hook plan making based on priori knowledge and automatic insertion of a single machine line-transferring plan, so that the labor intensity of shunting operation plan making of station staff is reduced.

The aim of the invention can be achieved by the following technical scheme:

according to the first aspect of the invention, an automatic generation method of a shunting operation plan is provided, the shunting operation rough plan is generated through a shunting operation task content matching template, the shunting operation rough plan generated by the template is subjected to hook-by-hook optimization through priori knowledge, and after the shunting operation rough plan is generated, a single machine plan is automatically inserted according to the locomotive position and the locomotive position, so that the automatic generation of the shunting operation plan is realized.

As a preferred technical solution, the method comprises the steps of:

step 101, a dispatching center compiles dispatching tasks and provides starting stations, starting station tracks, target stations, target station tracks, task information of picking up and delivering vehicles and task type information;

step 102, matching in a history base according to the information of the task, if the same situation exists, the matching is considered to be successful, a shunting operation plan is generated according to the history, otherwise, step 103 is executed;

step 103, compiling templates according to the matching scheduling plans of the initial station, the initial station track, the target station and the target station track, and generating a shunting job ticket;

step 104, starting from the first hook plan, carrying out scheduling operation planning on hooks by hooks according to the prior knowledge of travelling crane, if no rule is confirmed, merging a plurality of possible scheduling modes into a shunting operation list set, grading each shunting operation list in the set, and outputting the shunting operation list with the optimal grading;

step 105, for the situation that the shunting is not in the first stock track of the shunting plan, automatically inserting a single machine plan according to the shunting position; if the locomotive is not in the field, executing steps 101 to 104 to generate a new cross-field single machine plan, and if the locomotive is in the field, automatically inserting a locomotive wire transfer plan;

step 106, confirming and modifying the automatically generated shunting operation list, and issuing a shunting operation plan;

and step 107, after the shunting operation plan is completed, recording the shunting operation list as priori knowledge of next shunting operation list establishment.

As an preferable technical scheme, the history database in step 102 is a knowledge base stored in a database or stored in a local history shunting operation list, after the history database is stored, statistics and analysis are performed on the history records, and characteristics of a shunting operation plan are extracted from the history records for future shunting operation scheduling work, wherein the characteristics of the shunting operation plan include selection conditions of tracks in different operation types, preferential use conditions of tracks in receiving and sending, and preferential driving paths in driving among tracks.

As an optimal technical scheme, the matching in the history base according to the task information comprises the matching of the whole shunting operation list and the history operation list and the matching of the characteristics of stock way selection between the upper hook and the lower hook;

the matching items comprise forced matching items and non-forced matching items, wherein the forced matching items are the history job ticket and the scheduling job plan compiled at present, the history job ticket and the scheduling job plan are required to be identical on the information, the non-forced matching items are not required to be identical, the set error range is allowed, and the information of the items is still considered to be successfully matched within the allowed range.

As an optimal technical scheme, the scheduling planning template is a planning template which is formulated in consideration of the use conditions of shunting operation tasks, station type and stock tracks;

after the task is determined, searching is carried out in a template library according to the initial station, the initial station track, the target station and the target station track to obtain a matched template, and automatic adjustment is carried out on the template according to task information so as to conveniently and more finely compile a shunting plan.

As an preferable technical scheme, the shunting operation list set is a set formed by all possible shunting walking routes, the system combines the shunting operation list hooks, the length of the walking routes, estimated time consumption, the frequency of use of the stock tracks in the plan and the influence degree of the plan on other operations simultaneously carried out to formulate a grading rule, and finally, grading is carried out on each subset in the set, so that the optimal selection is given.

As an optimal technical scheme, the automatic locomotive wire transferring and inserting plan of the dispatching machine in the field is as follows:

and combining the field, the stock way and the machine position of the shunting machine, and automatically inserting the stock way, the machine position and the connection relation among the stock ways of the first hook of the shunting plan into a single machine operation plan.

As a preferred technical solution, the specific process of step 105 is as follows:

a. if the stock track where the shunting is located is the same as the stock track corresponding to the first hook in the shunting task, and the position where the shunting is located is the same as the position in the shunting task, or the current stock track has no stock, executing step 106;

b. if the stock track of the shunting is the same as the stock track corresponding to the first hook in the shunting task, but the position of the shunting is different from the position required by the shunting task, and the stock track has a stock, searching another stock track which has a public traction line with the stock track and is closest to the stock track, and inserting the stock track to perform a single-machine turning operation;

c. if the shunting is not in the field, taking the field in which the shunting is located as an initial field, taking the stock way as an initial stock way, taking the first stock way of a shunting plan as a target stock way, constructing a new shunting task by using the information, turning to the steps 101-104, and automatically generating a single-machine operation across the field;

d. if the first hook stock tracks of the shunting task and the shunting task are in the same field and have the same machine position, but are not the same stock tracks, searching a public lead-out line, and if the public lead-out line exists, automatically inserting a hook as a single machine operation before shunting planning;

e. if the first stock track of the shunting task and the shunting task are in the same field and the positions of the shunting task are different, if the stock track where the shunting task is located does not store a vehicle, a single-hook machine plan is inserted before the shunting plan; if a stock is stored on the stock way, a two-hook plan is needed to be inserted, all the stock ways which can be pulled out and pushed in by the pulling-out line at the stock way at the shunting operation list are searched to form a set A, the first hook of the shunting operation list can be pulled out and pushed in by the pulling-out line to form a set B, an intersection is searched in the set A and the set B to form a set C of the stock ways, the stock ways at the shunting operation list are calculated to the stock ways in the set C, then the resources consumed by the first hook stock way of the shunting operation list are searched for the optimal stock way, the stock way at the shunting operation list is used as the first hook plan to be inserted, the selected optimal stock way is used as the second hook, and the two-hook single plan is inserted.

According to a second aspect of the present invention there is provided an electronic device comprising a memory and a processor, the memory having stored thereon a computer program, the processor implementing the method when executing the program.

According to a third aspect of the present invention there is provided a computer readable storage medium having stored thereon a computer program, characterized in that the program when executed by a processor implements the method.

Compared with the prior art, the invention has the following advantages:

1. according to the task content matching template, the problem of a framework of shunting operation in a cross-field area can be solved, the previous experience is condensed by the template, and the programming of a shunting operation plan in the cross-field area is realized with the minimum hook number. The prior knowledge is used for reference during hook-by-hook optimization, and a next hook plan can be generated according to information such as the operation type, the upper hook stock way, the lower hook stock way and the like, and matching priority rules.

2. According to the invention, whether the single machine operation needs to be added or not can be judged according to the generated shunting operation list and the position of the shunting machine, if so, a cross-site single machine operation or a hook plan needed by the single machine plan is automatically generated or inserted, and the manual addition and the single machine operation of a plan staff are omitted.

3. After shunting operation is completed, statistical analysis is performed on the historical operation list, the obtained knowledge is used as priori knowledge to participate in the scheduling process of shunting operation in the future, and the existing rules can be supplemented through dynamic statistics so as to be more suitable for actual shunting task requirements.

Drawings

FIG. 1 is a general flow chart of the present invention for generating a shunting operation plan;

FIG. 2 is a flow chart of the present invention for generating a shunting operation plan hook plan optimization;

FIG. 3 is a flow chart of the present invention for generating a stand-alone job plan.

Detailed Description

The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

The invention discloses a method for automatically generating a shunting operation plan, which comprises the following steps: (1) The station obtains shunting operation tasks, and according to operation characteristics, three basic types are split: and (5) single-machine line switching in the zone and single-machine line switching in the cross-zone and vehicle flow planning. The shunting task information comprises an operation starting field, a starting stock way, a target field, a target stock way, a locomotive number, a locomotive identification, a shunting group operation type, a planning type, a picking-up type, a number of vehicles and the like. The dispatching center compiles a shunting task and provides relevant information of the shunting task; (2) For shunting tasks of the traffic flow planning type, matching a shunting operation planning template, checking the stock holding number, the stock occupation, the cross operation and the priori knowledge to dynamically plan an optimal path, automatically filling transportation information, and generating an optimal shunting operation plan. (3) For a single-machine transfer shunting task, a single-machine transfer traffic flow plan is generated firstly, and then a shunting operation plan is generated according to the traffic flow plan shunting task; (4) For the shunting task of the single-machine line-transferring type in the zone, a single-hook or multi-hook single-machine line-transferring plan is automatically inserted according to the locomotive position and the original shunting plan information. Matching templates according to the information of the task type, the initial track, the target track, the current track, the train consist and the like, and generating a shunting operation list frame; (3) Traversing each hook plan in the job ticket one by one from the first hook plan, generating a next hook plan according to the information of the last hook track, the type, the number of vehicles and the like and combining the prior knowledge of the track priority order and the like, and recording a data set for tracks which are not precisely matched to select the most preferable scheme by a scoring mechanism. (4) And (5) automatically generating a work plan by the manual confirmation system, and generating a formal shunting work plan. (5) And automatically inserting a single machine line transfer plan according to the position of the locomotive and the planned initial track and the track occupation condition. (6) After the plan is executed, the information of the shunting operation and the combination mode of the driving routes in the shunting list are recorded and used as priori knowledge for planning in the future.

As shown in fig. 1, the specific process of automatically generating the shunting operation plan according to the present invention is as follows:

101 The dispatching center issues shunting operation tasks and provides information such as a starting field area, a starting stock way, a target field area, a target stock way, vehicle taking and sending information, task types and the like.

102 Searching whether similar tasks exist or not from a history base according to the content of the shunting operation task, generating a new shunting operation plan according to the history shunting operation which is successfully matched if the matching is successful, and turning to step 103 if the matching is failed).

103 Reading a starting field area, a starting stock way, a target stock way and a target field area of a shunting operation task, matching a cross-field area operation template by using the information, automatically filling the information and related information such as operation type into the template, and generating a shunting plan rough frame.

104 Starting from the first hook, optimizing each hook plan at the back according to priori knowledge, determining to use a certain track if the priori rule prescribes that the track must be selected under certain conditions, and dividing the next hook plan into two parallel shunting plans to record in a shunting plan set, wherein the track A can be selected or the track B can be selected by the next hook plan.

105 Step 104 generates n parallel shunting plans that can all complete the shunting task, so each step is scored at this step. The scoring criteria are based on the estimated completion time, total hooks, and the number of resources expended to complete the task, with the highest scoring shunting operation plan being output as the most preferred.

106 Acquiring the field, stock and position conditions of the locomotive, and executing the following operations according to the information:

a. if the track where the shunting is located is the same as the track corresponding to the first hook in the shunting task, and the position where the shunting is located is the same as the position in the shunting task, or the current track has no stock, the step 106) is ended, and the step 107) is shifted.

b. If the stock track of the shunting is the same as the stock track corresponding to the first hook in the shunting task, but the position of the shunting is different from the position required by the shunting task, and the stock track has a stock, another stock track which has a common traction line with the stock track and is closest to the stock track is searched, and the stock track is inserted to perform a single-machine turning operation.

c. If the shunting is not in the field, taking the field where the shunting is located as an initial field, taking the stock way as an initial stock way, taking the first stock way of the shunting plan as a target stock way, and taking the operation type as a single-machine operation crossing the field, constructing a new shunting task according to the information, turning to the steps 102-105, and automatically generating the single-machine operation crossing the field.

d. If the first hook stock tracks of the shunting and shunting tasks are in the same field and the positions are the same, but not the same stock tracks, the common draw-out line is searched, and if the common draw-out line exists, a hook is automatically inserted as a single machine operation before shunting planning.

107 The scheduling staff confirms the shunting operation list manually, and outputs the shunting operation list after confirmation.

108 After the shunting operation list is completed, recording information such as task content, track selection and the like, analyzing the track selection condition and the driving resource consumption condition regularly, extracting an excellent scheme, inputting the excellent scheme into a priori condition library, and taking the excellent scheme as a step 104) hook plan selection optimization providing scheme.

The steps form a closed loop, a shunting operation list frame is established through template matching, resources consumed by manpower programming can be saved, a hook plan with priori knowledge is programmed and optimized, driving experience can be drawn to enable the machine to select a better driving scheme, finally, historical operation lists are analyzed, the driving experience can be enriched in content of statistical analysis, and the system learns more selection methods applicable to the field.

DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION

The invention will now be described in detail with reference to the drawings and specific examples. Fig. 1 illustrates an overall flow of automatic generation of a shunting operation plan, and a flow from a shunting task to automatic generation of a shunting operation plan. Fig. 2 illustrates a specific method for generating a rough framework of a shunting plan according to a matching template of the shunting task, and optimizing and refining hook by hook based on priori knowledge. Fig. 3 presents a flow for automatically generating a stand-alone plan based on the location of the shunting, a specific detail of how the shunting plan should be generated for different situations.

As shown in fig. 1, the specific method of the present invention is as follows:

1) And the dispatching center sends the train task, the 0001 number of locomotives takes 10 trains from the I-5G, and goes to the III-1G to send 6 trains, and the IV-5G to send 4 trains. (wherein "I-5G" means 5 strands of the I field).

2) And (3) generating a rough frame of the shunting operation list by matching the templates, performing hook-by-hook optimization, and automatically generating the shunting operation list across the field.

3) The position and position information of 0001 locomotive are searched, and based on these information, it is determined whether or not it is necessary to automatically insert a stand-alone program, and if necessary, it is automatically generated.

4) After the shunting job ticket is completed, relevant information is imported into a repository, and the information is analyzed regularly to form rules, and serves the hook optimization in the step 2) as prior information.

As shown in fig. 2, the invention generates a rough shunting plan frame according to a shunting task matching template, and the specific method for optimizing and refining hook by hook based on priori knowledge is as follows:

2) Searching whether I-5G picking up vehicles exist in the history library, giving a plan for III-1G, IV-5G delivering vehicles, filling relevant contents such as the type of the shunting task, the use of shunting and the like into the automatically generated shunting operation list if the I-5G picking up vehicles exist, skipping the step x), and continuously executing the step 3 if no matching item exists.

3) And searching the mine field area planning templates from the I field to the IV in the planning template set. After successful matching, generating a rough frame of the shunting plan, wherein the rough frame is I-5G+10; I-1L; II-1G; II-1L; III-1G-6; III-1L; IV-5G-4 (where "+" represents trailer, "over" represents pass, "-" represents flail, and I-1L represents tie-line 1 between I and II fields).

4) The optimization is carried out from the first hook to the second hook, the prior knowledge has rules, the I-5G sends the stock track to the II field, and the stock track is preferentially transmitted through the connecting line I-2L, so that the second hook is modified to be I-2L.

5) There are a total of 6 possible hook plans for delivery via I-2L to III-1G:

a.I-2L; II-1G; II-1L; III-1G-6

b.I-2L; II-1G; II-2L; III-1G-6

c.I-2L; II-2G; II-2L; III-1G-6

d.I-2L; II-2G; II-3L; III-1G-6

e.I-2L; II-3G; II-3L; III-1G-6

f.I-2L; II-3G; II-4L; III-1G-6.

6) Continuing to optimize the next hook, recording in priori knowledge, and planning III-1G to IV-5G delivery vehicles, wherein the delivery vehicles pass through III-2L preferentially, so that the optimization of the 6 th hook is changed into III-2L. There are currently 6 possible data sets:

a.I-5G+10; I-2L; II-1G; II-1L; III-1G-6; IV-5G-4

b.I-5G+10; I-2L; II-1G; II-2L; III-1G-6; IV-5G-4

c.I-5G+10; I-2L; II-2G; II-2L; III-1G-6; IV-5G-4

d.I-5G+10; I-2L; II-2G; II-3L; III-1G-6; IV-5G-4

e.I-5G+10; I-2L; II-3G; II-3L; III-1G-6; IV-5G-4

f.I-5G+10; I-2L; II-3G; II-4L; III-1G-6; IV-5G-4.

7) The 6 possibilities are scored by combining scoring rules formulated by factors such as the expected distance to be passed, the time spent by the journey, the influence on other tracks and the like, and the highest scoring item output is selected.

As shown in fig. 3, the specific method for automatically generating the single machine plan according to the position of the dispatching machine in the invention is as follows:

1) As described above in FIG. 2, a locomotive shunting plan for 0001 is automatically generated, with an initial track of I-5G.

2) At this time, the position of the 0001 locomotive is searched, information such as a field area, a stock way, a locomotive position and the like of the locomotive is obtained, if the information is in other field areas such as II-3G, the stock way II-3G of the shunting is taken as an initial stock way, the operation type is single-machine operation, the target stock way is a first hook stock way I-5G of a shunting operation list, and the method is jumped out to automatically generate the shunting operation list across the field area by turning to the method of FIG. 2. If the track where the locomotive is located is the track in the field, step 3 is shifted.

3) Aiming at different stock ways of the dispatching machine, the following situations can be classified:

a. the shunting is in I-5G, the shunting is the same as the first stock-hooking track of the shunting plan, the shunting position is consistent, and the situation is that the shunting jumps out of the method without inserting a single machine plan;

b. the shunting machine is in I-5G, the first hook stock way is the same as the shunting plan, and the machine positions are different. If no car is stored on the I-5G, a single machine plan is not needed to be inserted, if the car is stored, a single machine turning plan is needed to be inserted, a common traction line with the I-5G is found, a stock track I-4G with the closest distance is found, and a plan with a hook I-4G type being a single machine is inserted before a first hook of a shunting operation sheet.

c. If the dispatch is at I-4G, which is different from the first hook track of the dispatch plan but the same location, and the common draw-out line I-3L of I-4G and I-5G in the direction, a plan with the type of I-4G as a single machine is inserted before the hook plan of I-5G.

d. If the shunting is in the I-4G, the shunting is different from the first stock track of the shunting plan and the shunting position is different, judging whether the shunting is in two conditions according to whether the I-4G stores the train or not. If the I-4G has no car, and the common outgoing line I-3L of the I-4G and the I-5G in the direction, inserting a plan with the I-4G type as a single machine before the hook plan of the I-5G; if a car is stored, a hook plan is needed to be additionally inserted, the I-4G is searched for by pushing in and pulling out the stock track set A which is corresponding to the I-5G, the intersection of the A and the B is searched for, and the stock track with the shortest overall path, such as the I-6G, is searched for, and then the I-5G needs to be inserted with two hook plans before the hook plan, namely the I-4G and the I-6G, and the types are single-machine plans.

4) Outputting the shunting operation list, confirming by planning staff, and outputting after confirming.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the described modules may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.

The electronic device of the present invention includes a Central Processing Unit (CPU) that can perform various appropriate actions and processes according to computer program instructions stored in a Read Only Memory (ROM) or computer program instructions loaded from a storage unit into a Random Access Memory (RAM). In the RAM, various programs and data required for the operation of the device can also be stored. The CPU, ROM and RAM are connected to each other by a bus. An input/output (I/O) interface is also connected to the bus.

A plurality of components in a device are connected to an I/O interface, comprising: an input unit such as a keyboard, a mouse, etc.; an output unit such as various types of displays, speakers, and the like; a storage unit such as a magnetic disk, an optical disk, or the like; and communication units such as network cards, modems, wireless communication transceivers, and the like. The communication unit allows the device to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processing unit performs the various methods and processes described above, such as methods 101-108. For example, in some embodiments, the methods 101-108 may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device via the ROM and/or the communication unit. One or more of the steps of methods 101-108 described above may be performed when a computer program is loaded into RAM and executed by a CPU. Alternatively, in other embodiments, the CPU may be configured to perform methods 101-108 in any other suitable manner (e.g., by means of firmware).

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a load programmable logic device (CPLD), etc.

Program code for carrying out methods of the present invention may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.

Claims

1. The automatic generation method of the shunting operation plan is characterized in that the method generates a shunting operation rough plan through a shunting operation task content matching template, hook-by-hook optimization is conducted on the shunting operation rough plan generated by the template through priori knowledge to generate a shunting operation plan, and after the shunting operation plan is generated, a single machine plan is automatically inserted according to the position and the machine position of a locomotive, so that automatic generation of the shunting operation plan is realized;

the method comprises the following steps:

2. The automatic shunting operation plan generation method according to claim 1, wherein the history base in the step 102 is a knowledge base of a history shunting operation list stored in a database or stored locally, statistics and analysis are performed on the history record after the history record is stored, and characteristics of the shunting operation plan are extracted from the history record for future shunting operation scheduling work, wherein the characteristics of the shunting operation plan include selection conditions of tracks in different operation types, preferential use conditions of tracks in a receiving and sending process, and preferential use paths in a driving process between tracks.

3. The automatic generation method of a shunting operation plan according to claim 1, wherein the matching in a history base according to the information of the task includes matching the whole shunting operation list with the history operation list and matching the characteristics of stock selection between the upper hook and the lower hook;

the matching items comprise forced matching items and non-forced matching items, wherein the forced matching items are the history job ticket and the current compiled shunting operation plan, the information of the forced matching items is identical, the non-forced matching items are not required to be identical, the set error range is allowed, and the items are still considered to be successfully matched in the information within the allowed range.

4. The automatic generation method of a shunting operation plan according to claim 1, wherein the scheduling plan creating template is a planning template created by considering shunting operation tasks, station type and track use conditions;

5. The automatic generation method of a shunting operation plan according to claim 1, wherein the shunting operation list set is a set formed by all possible shunting walking routes, and the system combines the shunting operation list hooks, the length of the walking routes, estimated time consumption, the frequency of use of tracks in the plan and the influence degree of the plan on other operations simultaneously carried out to formulate a grading rule, and finally grading each subset in the set so as to give the optimal selection.

6. The automatic generation method of a shunting operation plan according to claim 1, wherein the automatic insertion of the shunting machine into the locomotive wire transfer plan in the present field is:

7. The automatic generation method of a shunting operation plan according to claim 1, wherein the specific process of step 105 is as follows:

8. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, characterized in that the processor, when executing the program, implements the method of any of claims 1-7.

9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any one of claims 1-7.