Iron and steel metallurgy material transportation decision control method

Abstract

The invention provides a ferrous metallurgy material transportation decision control method which comprises the following steps: S1, establishing an adhesive tape machine information database, obtaining all possible adhesive tape machine paths through path calculation, obtaining all possible path groups through path group screening calculation, and eliminating the path groups with repeated adhesive tape machines by adopting an exclusion method; s2, reading an adhesive tape machine which transports the material in the system and an adhesive tape machine transportation scheme of the material, and selecting to execute S3 or S4; s3, keeping the adhesive tape machine which is transporting the materials unchanged, and re-planning all paths to obtain a new path group; s4, the adhesive tape machine transportation scheme of the materials is kept unchanged, and path groups conflicting with the adhesive tape machine transportation scheme are removed; and S5, calculating the optimal path group through the optimal path group, sending the information of the optimal path group to a control system, and adjusting the state of each sealing-tape machine on the corresponding path. According to the ferrous metallurgy material transportation decision control method, automatic and intelligent transportation of various materials can be achieved.

Description

Technical Field

[0001] The invention belongs to the technical field of production scheduling, and in particular relates to a steel metallurgical material transportation decision control method. Background Art

[0002] Regarding the transportation methods of steel metallurgical materials, with the development direction of centralized factory construction, the scale of metallurgical material feeding systems is also developing towards large-scale and multi-material lines. The material yard structure is becoming increasingly complex, and the types of materials, belt conveyor transportation processes and nodes are also increasing. At present, most of the material yards in my country are transported manually, which has obvious defects and shortcomings.

[0003] The defects and deficiencies of the existing technology are as follows: (1) Manual adjustment of the material line is laborious; (2) Manual adjustment of the material line has no statistical principles and poor rationality; (3) Manual adjustment of the material line cannot find the shortest path and the system has high energy consumption; (4) Manual adjustment of the material line has slow manual analysis and long response time.

[0004] As traditional iron and steel metallurgical material transportation relies on manual scheduling, there are problems such as low efficiency, unreasonable path planning, and waste of resources. With the continuous development of the steel industry, metallurgical enterprises have an increasingly urgent need to improve the degree of automation. How to achieve intelligent scheduling of material transportation has become an urgent problem to be solved. Most of the existing material transportation decision-making and control methods only consider the transportation of a single material, which is difficult to meet the transportation needs of multiple varieties and batches of materials.

[0005] In response to the above problems, domestic and foreign scholars and enterprises are committed to studying intelligent decision-making and control methods for the transportation of iron and steel metallurgical materials. For example, some methods use heuristic algorithms to plan the transportation routes of materials, but such algorithms often rely on experience, are difficult to optimize globally, and have high algorithm complexity. In addition, some methods use optimization algorithms such as simulated annealing algorithms to find better solutions, but the computational efficiency is low and it is difficult to meet the real-time requirements of industrial production. Most existing methods lack a dynamically updated path planning mechanism and cannot adapt to the ever-changing material requirements and equipment status in the actual production environment.

[0006] The invention with publication number CN106052692A discloses a shortest path planning navigation method and a corresponding system, which technically realizes the effective search for a single shortest path. However, its limitation is that the invention fails to simultaneously process and calculate the comprehensive shortest value of multiple paths. When faced with complex and changeable path selection requirements, the method of the invention seems to be inadequate. In addition, the invention lacks the ability to dynamically optimize according to real-time changes in the actual path situation, which limits its application potential in navigation scenarios that require high flexibility and real-time response. Summary of the invention

[0007] In order to overcome the shortcomings of the prior art, the present invention provides a steel metallurgical material transportation decision-making and control method, which can realize automatic search for the optimal path for multiple materials, and can make real-time adjustments according to actual conditions, thereby improving transportation efficiency, reducing resource waste, and realizing the automation and intelligence of metallurgical material transportation.

[0008] The above object of the present invention is achieved through the following technical solutions:

[0009] A steel metallurgical material transportation decision control method comprises the following steps:

[0010] S1. Establish a tape conveyor information database, obtain all possible tape conveyor paths through path calculation, obtain all possible path groups through path group screening calculation, and use the elimination method to eliminate the path groups with duplicate tape conveyors;

[0011] S2, read the belt conveyor that is transporting the material in the system and the belt conveyor transportation plan of the material, and select to execute S3 or S4 according to actual needs;

[0012] S3, keep the belt conveyor that is transporting materials unchanged, re-plan all paths, and obtain a new path group;

[0013] S4. Keep the belt conveyor transportation plan of the material unchanged, and eliminate the path group that conflicts with the belt conveyor transportation plan;

[0014] S5. derive an optimal path group through optimal path group calculation, and send the optimal path group information to the control system to adjust the status of each belt conveyor on the corresponding path.

[0015] Furthermore, the data format of the database in S1 is as follows:

[0016] [Px, Lx, Py1...Pyn]

[0017] Among them, Px represents a certain belt conveyor, Lx represents the length of the belt conveyor, Py1...Pyn represents that there are n belt conveyors connected to the downstream of Px belt conveyor, which are Py1...Pyn respectively.

[0018] Furthermore, the path calculation in S1 is as follows:

[0019] When the material is transferred for the xth time (x≥1), the starting point is Px, and the data format of Px is [Px, Lx, Px+1:1......Px+1:n]. Its downstream belt conveyor is Px+1:1......Px+1:n. There are n routes to be selected for the xth transfer, that is, there are n options, which are:

[0020]

[0021] Where [Px, Px+1:1] represents the first path selection of the x-th transfer, and [Px, Px+1:n] represents the n-th path selection of the x-th transfer;

[0022] After the last transfer, if the material is transported from Px+1:1 to the next step, the data format of Px+1:1 is [Px+1:1, Lx+1:1, Px+2:1......Px+2:m]. After the material enters Px+1:1, its downstream belt conveyor is Px+2:1......Px+2:m, and there are m options. In this case, there are m routes to be selected for the n+1th transfer, which are:

[0023]

[0024] After the last transfer, if the material enters Px+1:n for the next transportation, the data format of Px+1:n is [Px+1:n, Lx+1:n, Px+2:1......Px+2:k]. After the material enters Px+1:n, its downstream belt conveyor is Px+2:1......Px+2:k, and there are k options. In this case, there are k routes to be selected for the n+1th transfer, which are:

[0025]

[0026] Each belt conveyor path is deduced in turn according to the above calculation.

[0027] Furthermore, the path group screening calculation in S1 is as follows:

[0028] When there are i kinds of materials input into the system at the same time, after path calculation and solution, the following path allocation methods are obtained:

[0029] [Material 1, Path 11, Path 12, ..., Path 1m], a total of m paths;

[0030] [Material 2, Path 21, Path 22, ..., Path 2n], a total of n paths;

[0031] [Material 3, Path 31, Path 32, ..., Path 3k], a total of k paths; ......

[0033] [Material i, path i1, path i2, ..., path il], a total of l paths;

[0034] At this time, m×n×k×l path groups are obtained.

[0035] Furthermore, the elimination method in S1 is: eliminating the path groups with duplicate belt conveyors to ensure the uniqueness of each belt conveyor in each path group.

[0036] Furthermore, the optimal path group in S5 is calculated as follows:

[0037] Assume that there are j path groups left, which are:

[0038] The first one:

[0039] [Material 1, Path 11];

[0040] [Material 2, Path 21];

[0041] [Material 3, Path 31]; ......

[0043] [material i, path i1];

[0044] Second type:

[0045] [Material 1, Path 12];

[0046] [Material 2, Path 22];

[0047] [Material 3, Path 32]; ......

[0049] [material i, path i2];

[0050] Type j:

[0051] [Material 1, Path 1j];

[0052] [Material 2, Path 2j];

[0053] [Material 3, Path 3j]; ......

[0055] [material i, path ij];

[0056] Calculate the total length of the belt conveyor for the above j types of path groups respectively:

[0057]

[0058] The path group with the smallest calculated result is selected as the optimal path group.

[0059] The beneficial effects of the present invention compared with the prior art solutions are:

[0060] 1. The present invention specifies the data format required for calculation. By determining the data format, the required data can be quickly extracted to establish a database, and the calculation of subsequent methods and the improvement of the methods can be greatly facilitated.

[0061] 2. The present invention can solve the transportation needs of multiple varieties and batches of materials. The present invention can calculate all possible paths. After calculating all possible path groups, the present invention will eliminate the path groups with repeated belt machines in the path groups to ensure that the paths are more reasonable.

[0062] 3. The present invention can adapt to the ever-changing material requirements and equipment status in the actual production environment. The present invention adjusts the transportation method according to whether there is a belt conveyor that is transporting materials in the system. Compared with ordinary transportation methods, it is more flexible and practical.

[0063] 4. After preliminarily calculating all candidate path combinations, the present invention can select two options, "re-planning" or "eliminating conflicting belt conveyor units", according to the actual situation, so that the operator can flexibly select the corresponding strategy according to the actual situation.

[0064] 5. The present invention can calculate the optimal path in various material transportation situations, improve transportation efficiency, reduce the waste of belt conveyor resources, and realize the intelligent upgrade of material transportation. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] Figure 1 A schematic diagram of belt conveyor transportation of a steel metallurgical material transportation decision control method provided by the present invention;

[0066] Figure 2 A schematic diagram of a flow chart of a steel metallurgical material transportation decision-making and control method provided by the present invention; DETAILED DESCRIPTION

[0067] The present invention is described in detail below through specific embodiments, but the protection scope of the present invention is not limited thereto.

[0068] Example 1

[0069] like Figure 1-2 As shown, S1, establish a tape machine information database, and enter the tape machine, tape machine length, tape machine docking relationship and other information into it; the data format of the database in S1 is as follows:

[0070] [Px, Lx, Py1...Pyn]

[0071] Among them, Px represents a certain belt conveyor, Lx represents the length of the belt conveyor, Py1...Pyn represents that there are n belt conveyors connected to the downstream of the Px belt conveyor, which are Py1...Pyn respectively. Similarly, the data format of Py1 is designed as [Py1, Ly1, Pz1...Pzm], Ly1 represents the length of the belt conveyor, Pz1...Pzm represents that there are m belt conveyors connected to the downstream of the Py1 belt conveyor, which are Pz1...Pzm respectively. Similarly, Py2 transports materials, and the designed data format of Py2 is [Po2, Lo2, Po1...Pom].

[0072] The data of all possible belt conveyor paths are calculated through the path, and all possible path data are solved; the path calculation is: when the material is transferred for the xth time (x≥1), the starting point is Px, and the Px data format is [Px, Lx, Px+1: 1......Px+1: n], and its downstream belt conveyor is: Px+1: 1......Px+1: n. It can be seen that there are n routes to be selected for the xth transfer, that is, there are n choices, which are:

[0073]

[0074] Where [Px, Px+1:1] represents the first path selection of the x-th transfer, and [Px, Px+1:n] represents the n-th path selection of the x-th transfer;

[0075] After the last transfer, if the material enters Px+1:1 for the next transportation, the data format of Px+1:1 is [Px+1:1, Lx+1:1, Px+2:1......Px+2:m]. After the material enters Px+1:1, its downstream belt conveyor is: Px+2:1......Px+2:m, there are m options. In this case, there are m routes to be selected for the n+1th transfer, which are:

[0076]

[0077] Similarly, after the last transfer, if the material enters Px+1:n for the next transportation, the data format of Px+1:n is [Px+1:n, Lx+1:n, Px+2:1......Px+2:k]. After the material enters Px+1:n, its downstream belt conveyor is: Px+2:1......Px+2:k, there are k options. In this case, there are k routes to be selected for the n+1th transfer, which are:

[0078]

[0079] Each transfer route is calculated based on the above calculations.

[0080] The optional path group solutions for all materials are obtained through path group screening calculation, and the elimination method is used to eliminate the paths with repeated belt conveyors in the path group to screen out feasible path group solutions; the path group screening calculation includes when there are i kinds of materials input simultaneously in the system, after the above calculation and solution, it is concluded that there are the following path allocation methods:

[0081] [Material 1, Path 11, Path 12, ..., Path 1m], a total of m paths;

[0082] [Material 2, Path 21, Path 22, ..., Path 2n], a total of n paths;

[0083] [Material 3, Path 31, Path 32, ..., Path 3k], a total of k paths; ......

[0085] [Material i, path i1, path i2, ..., path il], a total of l paths;

[0086] At this point, theoretically there are m×n×k×l path combinations.

[0087] The elimination method is to eliminate the path combination with repeated belt conveyors in the path group to ensure the uniqueness of each belt conveyor in the path group, that is, each belt conveyor only appears once in the path array, so as to obtain a reasonable alternative path. The elimination method makes the path group obtained by path group screening calculation feasible.

[0088] S2, read the belt conveyor path group of the material being transported in the system, and choose to execute S3 or S4 according to actual needs. If the material being transported is ordinary material and its belt conveyor transportation plan can be changed, S3 can be selected to improve transportation efficiency and reduce the waste of belt conveyor resources. If the material being transported is more important or its belt conveyor transportation plan is difficult to change, S4 can be selected at this time.

[0089] S3. Keep the conveyor belt machine being transported unchanged, re-plan all paths, and obtain a new path group solution; that is, except for the conveyor belt machine being transported, which cannot be changed, all the conveyor belt machine paths are recalculated and planned to obtain the optimal path.

[0090] S4. Keep the belt conveyor path group that is being transported unchanged, eliminate the path group plan that contains the belt conveyor path group that is being transported, and obtain a new path group plan; ensure that the belt conveyor that is transporting materials and its belt conveyor transportation plan remain unchanged, and remove the group involving the belt conveyor transportation plan in the original feasible path group.

[0091] S5. Calculate the total path length of each path group respectively, calculate the minimum total path length as the optimal path, and send the optimal path information to the control system to adjust the status of each belt conveyor on the corresponding path.

[0092] In the field of iron and steel metallurgy, materials are transported by belt conveyors. Especially in the material yard area, various materials need to be transported back and forth multiple times to different process flows. For complex material yards, the design of the belt conveyor flow involves crossover and reuse, resulting in multiple path selection problems after unused materials enter the material yard. This patent designs a decision-making control system based on the material transportation characteristics in the field of iron and steel metallurgy to realize automatic path selection and control of materials.

[0093] Figure 1 This is an example diagram of material switching by a belt conveyor in a metallurgical material yard. Due to the different general layout and process conditions of the engineering projects, the material system structure of each factory is different, so the diagram structure is only an example. The material flow switching is achieved through equipment such as multi-way distributors, which are located at branch nodes (for example, P2 to P5 or P7, and there is a three-way distributor at the P2 unloading point).

[0094] The system settings are:

[0095] The process equipment is: on-site belt conveyor material transportation system, each belt conveyor motor can realize PLC remote control start and stop, and each distributor can realize remote control switching of material flow direction.

[0096] The system hardware includes: PLC control system, which is used to realize remote control of the tape machine and switch;

[0097] The software includes: process decision system algorithm and software platform.

[0098] Example 2

[0099] like Figure 2 As shown, the use process of the steel metallurgical material transportation decision control method provided by the present invention is as follows:

[0100] T1: Read the real-time data information of the belt conveyor in the PLC control system, specifically read the information such as the length of the belt conveyor and the connection relationship of the belt conveyor.

[0101] T2: If a new tape machine is added, read the length of the new tape machine and the docking relationship with the new tape machine, and update the database.

[0102] T3: Read the real-time feed demand of i types of feed in the PLC control system.

[0103] T4: Match the starting position of the i-th feed.

[0104] T5: Preliminary calculation of candidate path combinations for all materials; obtain optional path group solutions for all materials through path calculation and path group screening calculation, and use the elimination method to screen out all feasible path group solutions.

[0105] T6: Detect whether there is material being transported, and decide whether to "re-plan" or "eliminate conflicting belt conveyor units". "Re-planning" means keeping the belt conveyor being transported unchanged, re-planning all paths, and obtaining a new path group plan. "Eliminating conflicting belt conveyor units" means keeping the entire belt conveyor transportation plan of the material being transported unchanged, and eliminating the path group plans that may conflict with the above-mentioned belt conveyor unit transportation plan.

[0106] T7: After the above work is completed, the optimal path combination can be obtained by calculating the total path length of each path group and comparing them.

[0107] T8: Read the current docking relationship of the belt conveyor in the PLC control system, and according to the docking relationship of the belt conveyor in the optimal path combination, find out the inconsistent docking relationship of the belt conveyor between the two, and mark the status of these devices.

[0108] T9: Send the belt conveyor information that needs to be adjusted and the interlocking actions that the belt conveyor needs to perform to the PLC control system, so that the status of all belt conveyors is adjusted to the belt conveyor status in the optimal path group.

[0109] T10: Start the belt conveyor to transport materials. After the transportation is completed or new materials are added in the middle, the next cycle starts from T1.

[0110] Example 3

[0111] like Figure 1 As shown:

[0112] Through path calculation, we can get:

[0113] When the starting point of the material is P1, the path to be selected is [P 1 P 4：1 ];

[0114] When the starting point of the material is P2, the path to be selected is

[0115] When the starting point of the material is P3, the path to be selected is

[0116] When the starting point of the material is P4, the path to be selected is

[0117] When the starting point of the material is P5, the path to be selected is [P 5 P 8：1]; When the starting point of the material is P6, the path to be selected is When the starting point of the material is P7, the path to be selected is When the starting point of the material is P8, the path to be selected is When the starting point of the material is P9, the path to be selected is [P 9 P n：1 ]; The path of material 1 has the following 4 options:

[0118] P1-P4-P7-10; (named as path 11)

[0119] P1-P4-P7-P11; (named as path 12)

[0120] P1-P4-P8-P11; (named as path 13)

[0121] P1-P4-P8-Pn; (named as path 14)

[0122] There are 4 options for the path of material 2:

[0123] P2-P7-P10; (named as path 21)

[0124] P2-P7-P11; (named as path 22)

[0125] P2-P5-P8-P11; (named as path 23)

[0126] P2-P5-P8-Pn; (named as path 24)

[0127] There are 4 options for the path of material 3:

[0128] P3-P5-P8-P11; (named as path 31)

[0129] P3-P5-P8-Pn; (named as path 32)

[0130] P3-P6-P8-Pn; (named as path 33)

[0131] P3-P6-P9-Pn; (named as path 34)

[0132] When three types of materials are input into the system at the same time, the following path allocation methods are obtained through path calculation:

[0133] [Material 1, Path 11, Path 12, Path 13, Path 14], 4 paths in total;

[0134] [Material 2, Path 21, Path 22, Path 23, Path 24], a total of 4 paths;

[0135] [Material 3, Path 31, Path 32, Path 33, Path 34], a total of 4 paths;

[0136] At this time, a total of 4×4×4=64 path groups are obtained.

[0137] The three material choices in path group 1 are [path 11, path 21, path 31]; 0

[0138] The three material choices in path group 2 are [path 11, path 21, path 32]; 0

[0139] The three material choices in path group 3 are [path 11, path 21, path 33]; 0

[0140] The three material choices in path group 4 are [path 11, path 21, path 34]; 0

[0141] The choices of the three materials in path group 5 are [path 11, path 22, path 31]; 0

[0142] The choices of the three materials in path group 6 are [path 11, path 22, path 32]; 0

[0143] The three material choices in path group 7 are [path 11, path 22, path 33]; 0

[0144] The three material choices in path group 8 are [path 11, path 22, path 34]; 0

[0145] The three material choices in path group 9 are [path 11, path 23, path 31]; 1

[0146] The three material choices in path group 10 are [path 11, path 23, path 32]; 1

[0147] The three material choices in path group 11 are [path 11, path 23, path 33]; 1

[0148] The three material choices in path group 12 are [path 11, path 23, path 34]; 1

[0149] The three material choices in path group 13 are [path 11, path 24, path 31]; 1

[0150] The three material choices in path group 14 are [path 11, path 24, path 32]; 1

[0151] The three material choices in path group 15 are [path 11, path 24, path 33]; 1

[0152] The three material choices in path group 16 are [path 11, path 24, path 34]; 1

[0153] The three material choices in path group 17 are [path 12, path 21, path 31];

[0154] The three material choices in path group 18 are [path 12, path 21, path 32];

[0155] The three material choices in path group 19 are [path 12, path 21, path 33];

[0156] The three material choices in path group 20 are [path 12, path 21, path 34];

[0157] The three material choices in path group 21 are [path 12, path 22, path 31];

[0158] The three material choices in path group 22 are [path 12, path 22, path 32];

[0159] The three material choices in path group 23 are [path 12, path 22, path 33]; 0

[0160] The three material choices in path group 24 are [path 12, path 22, path 34];

[0161] The three material choices in path group 25 are [path 12, path 23, path 31];

[0162] The three material choices in path group 26 are [path 12, path 23, path 32];

[0163] The three material choices in path group 27 are [path 12, path 23, path 33]; 0

[0164] The three material choices in path group 28 are [path 12, path 23, path 34];

[0165] The three material choices in path group 29 are [path 12, path 24, path 31];

[0166] The three material choices in path group 30 are [path 12, path 24, path 32]; 1

[0167] The three material choices in path group 31 are [path 12, path 24, path 33]; 1

[0168] The three material choices in path group 32 are [path 12, path 24, path 34]; 1

[0169] The three material choices in path group 33 are [path 13, path 21, path 31];

[0170] The three material choices in path group 34 are [path 13, path 21, path 32];

[0171] The three material choices in path group 35 are [path 13, path 21, path 33];

[0172] The three material choices in path group 36 are [path 13, path 21, path 34]; 1

[0173] The three material choices in path group 37 are [path 13, path 22, path 31];

[0174] The three material choices in path group 38 are [path 13, path 22, path 32];

[0175] The three material choices in path group 39 are [path 13, path 22, path 33];

[0176] The three material choices in path group 40 are [path 13, path 22, path 34]; 1

[0177] The three material choices in path group 41 are [path 13, path 23, path 31];

[0178] The three material choices in path group 42 are [path 13, path 23, path 32];

[0179] The three material choices in path group 43 are [path 13, path 23, path 33];

[0180] The three material choices in path group 44 are [path 13, path 23, path 34];

[0181] The three material choices in path group 45 are [path 13, path 24, path 31];

[0182] The three material choices in path group 46 are [path 13, path 24, path 32];

[0183] The three material choices in path group 47 are [path 13, path 24, path 33];

[0184] The three material choices in path group 48 are [path 13, path 24, path 34];

[0185] The three material choices in path group 49 are [path 14, path 21, path 31];

[0186] The three material choices in path group 50 are [path 14, path 21, path 32];

[0187] The three material choices in path group 51 are [path 14, path 21, path 33];

[0188] The three material choices in path group 52 are [path 14, path 21, path 34];

[0189] The three material choices in path group 53 are [path 14, path 22, path 31];

[0190] The three material choices in path group 54 are [path 14, path 22, path 32]; The three material choices in path group 55 are [path 14, path 22, path 33];

[0191] The three material choices in path group 56 are [path 14, path 22, path 34];

[0192] The three material choices in path group 57 are [path 14, path 23, path 31];

[0193] The three material choices in path group 58 are [path 14, path 23, path 32];

[0194] The three material choices in path group 59 are [path 14, path 23, path 33];

[0195] The three material choices in path group 60 are [path 14, path 23, path 34];

[0196] The three material choices in path group 61 are [path 14, path 24, path 31];

[0197] The three material choices in path group 62 are [path 14, path 24, path 32];

[0198] The three material choices in path group 63 are [path 14, path 24, path 33];

[0199] The three material choices in path group 64 are [path 14, path 24, path 34];

[0200] According to the elimination method, the path groups with duplicate belt conveyors are eliminated to ensure the uniqueness of each belt conveyor in each path group:

[0201] The adhesive tape machine in path 11 overlaps with the adhesive tape machines in paths 21 and 22 .

[0202] The tape machines in path 12 overlap with the tape machines in paths 21 , 22 , 23 , and 31 .

[0203] The tape machines in path 13 overlap with the tape machines in paths 23 , 24 , 31 , 32 , and 33 .

[0204] The tape machines in path 14 overlap with the tape machines in paths 23 , 24 , 31 , 32 , 33 , and 34 .

[0205] The tape conveyor in path 21 overlaps with the tape conveyor in path 34 .

[0206] The tape conveyor in path 22 overlaps with the tape conveyor in path 31 .

[0207] The adhesive tape machine in path 23 overlaps with the adhesive tape machines in paths 31 , 32 , and 33 .

[0208] The tape machines in path 24 overlap with the tape machines in paths 31 , 32 , 33 , and 34 .

[0209] Therefore, the path groups with duplicate tape machines are eliminated from the 64 path groups. The original 64 path groups now only have path groups 9, path groups 10, path groups 11, path groups 12, path groups 13, path groups 14, path groups 15, path groups 16, path groups 30, path groups 31, path groups 32, path groups 36, and path groups 40, with a total of 13 path groups available. The feasible path groups are marked on the right.

[0210] That is, the remaining path groups are:

[0211] The first one:

[0212] [Material 1, Path 11];

[0213] [Material 2, Path 23];

[0214] [Material 3, Path 31];

[0215] Second type:

[0216] [Material 1, Path 11];

[0217] [Material 2, Path 23];

[0218] [Material 3, Path 32];

[0219] The third type:

[0220] [Material 1, Path 11];

[0221] [Material 2, Path 23];

[0222] [Material 3, Path 33]; Type 4:

[0223] [Material 1, Path 11];

[0224] [Material 2, Path 23];

[0225] [Material 3, Path 34]; Fifth:

[0226] [Material 1, Path 11];

[0227] [Material 2, Path 24];

[0228] [Material 3, Path 31]; Type 6:

[0229] [Material 1, Path 11];

[0230] [Material 2, Path 24];

[0231] [Material 3, Path 32]; Seventh:

[0232] [Material 1, Path 11];

[0233] [Material 2, Path 24];

[0234] [Material 3, Path 33]; Type 8:

[0235] [Material 1, Path 11];

[0236] [Material 2, Path 24];

[0237] [Material 3, Path 34]; Type 9:

[0238] [Material 1, Path 12];

[0239] [Material 2, Path 24];

[0240] [Material 3, Path 32]; Type 10:

[0241] [Material 1, Path 12];

[0242] [Material 2, Path 24];

[0243] [Material 3, Path 33]; Eleventh:

[0244] [Material 1, Path 12];

[0245] [Material 2, Path 24];

[0246] [Material 3, Path 34]; Type 12:

[0247] [Material 1, Path 13];

[0248] [Material 2, Path 21];

[0249] [Material 3, Path 34]; Thirteenth:

[0250] [Material 1, Path 13];

[0251] [Material 2, Path 22];

[0252] [Material 3, Path 34];

[0253] The total length of the belt conveyors in the above 13 path groups is calculated respectively, and the path group with the smallest calculation result is selected as the optimal path group. The belt conveyors that need to be adjusted are marked according to the status of the belt conveyors in the optimal path group, and the status information of the belt conveyors in the optimal path group is sent back to the PLC system.

[0254] The above-described embodiments are only preferred embodiments of the present invention, but not all feasible embodiments of the present invention. For those skilled in the art, any obvious changes made thereto without departing from the principles and spirit of the present invention should be considered to be included in the scope of protection of the claims of the present invention.

Claims

1. A steel metallurgical material transportation decision control method, characterized in that: The steps include: S1. Establish a tape conveyor information database, obtain all possible tape conveyor paths through path calculation, obtain all possible path groups through path group screening calculation, and use the elimination method to eliminate the path groups with duplicate tape conveyors; S2, read the belt conveyor that is transporting the material in the system and the belt conveyor transportation plan of the material, and select to execute S3 or S4 according to actual needs; S3, keep the belt conveyor that is transporting materials unchanged, re-plan all paths, and obtain a new path group; S4. Keep the belt conveyor transportation plan of the material unchanged, and eliminate the path group that conflicts with the belt conveyor transportation plan; S5. derive an optimal path group through optimal path group calculation, and send the optimal path group information to the control system to adjust the status of each belt conveyor on the corresponding path.

2. A steel metallurgical material transportation decision control method according to claim 1, characterized in that: The data format of the database in S1 is as follows: [Px, Lx, Py1...Pyn] Among them, Px represents a certain belt conveyor, Lx represents the length of the belt conveyor, Py1...Pyn represents that there are n belt conveyors connected to the downstream of Px belt conveyor, which are Py1...Pyn respectively.

3. A steel metallurgical material transportation decision control method according to claim 2, characterized in that: The path calculation in S1 is as follows: When the material is transferred for the xth time (x≥1), the starting point is Px, and the data format of Px is [Px, Lx, Px+1:1......Px+1:n]. Its downstream belt conveyor is Px+1:1......Px+1:n. There are n routes to be selected for the xth transfer, that is, there are n options, which are: Where [Px, Px+1:1] represents the first path selection of the x-th transfer, and [Px, Px+1:n] represents the n-th path selection of the x-th transfer; After the last transfer, if the material is transported from Px+1:1 to the next step, the data format of Px+1:1 is [Px+1:1, Lx+1:1, Px+2:1......Px+2:m]. After the material enters Px+1:1, its downstream belt conveyor is Px+2:1......Px+2:m, and there are m options. In this case, there are m routes to be selected for the n+1th transfer, which are: After the last transfer, if the material enters Px+1:n for the next transportation, the data format of Px+1:n is [Px+1:n, Lx+1:n, Px+2:1......Px+2:k]. After the material enters Px+1:n, its downstream belt conveyor is Px+2:1......Px+2:k, and there are k options. In this case, there are k routes to be selected for the n+1th transfer, which are: Each belt conveyor path is deduced in turn according to the above calculation.

4. A steel metallurgical material transportation decision control method according to claim 3, characterized in that: The path group screening calculation in S1 is as follows: When there are i kinds of materials input into the system at the same time, after path calculation and solution, the following path allocation methods are obtained: [Material 1, Path 11, Path 12, ..., Path 1m], a total of m paths; [Material 2, Path 21, Path 22, ..., Path 2n], a total of n paths; [Material 3, Path 31, Path 32, ..., Path 3k], a total of k paths; ...... [Material i, path i1, path i2, ..., path il], a total of l paths; At this time, m×n×k×l path groups are obtained.

5. A steel metallurgical material transportation decision control method according to claim 4, characterized in that: The elimination method in S1 is: eliminating the path groups with duplicate belt conveyors to ensure the uniqueness of each belt conveyor in each path group.

6. A steel metallurgical material transportation decision control method according to claim 5, characterized in that: The optimal path group in S5 is calculated as follows: Assume that there are j path groups left, which are: The first one: [Material 1, Path 11]; [Material 2, Path 21]; [Material 3, Path 31]; ...... [material i, path i1]; Second type: [Material 1, Path 12]; [Material 2, Path 22]; [Material 3, Path 32]; ...... [Material i, Path i2]; Type j: [Material 1, Path 1j]; [Material 2, Path 2j]; [Material 3, Path 3j]; ...... [Material i, path ij]; calculate the total length of the belt conveyor for the above j types of path groups respectively: The path group with the smallest calculated result is selected as the optimal path group.

Images