Method and system for selecting an optimal raw material transportation path

Abstract

The application provides a method and system for selecting an optimal raw material transportation path, the method comprising determining a starting site and an ending site of raw material transportation; obtaining initial transportation data; obtaining transportation time for each transportation device to complete one transportation; taking the transportation time as a weight value, and determining a transportation adjacency matrix according to the initial transportation data; obtaining a current available state of each transportation device; processing the transportation adjacency matrix according to the current available state to determine an available route adjacency matrix; calculating the available route adjacency matrix by using a minimum path algorithm to obtain a minimum time path tracking matrix between all transportation devices; and determining an optimal raw material transportation path between the starting site and the ending site according to the minimum time path tracking matrix. In this way, the transportation adjacency matrix is updated according to the current available state to obtain the available route adjacency matrix, and then the dynamic selection of the optimal raw material transportation path is realized, and the transportation efficiency of the raw material is improved.

Description

Technical Field

[0001] The present application relates to the field of raw material transportation in steel enterprises, and in particular to a method and system for selecting an optimal raw material transportation route. Background Art

[0002] The raw material yard is the site within a steel company responsible for receiving and distributing raw materials. After the raw materials are identified and sorted, they need to be transported to the designated location using the optimal transportation route.

[0003] like Figure 1 The figure shows a top view of an existing raw material transportation system. The transportation equipment in the raw material transportation system includes a receiving trough 01, a belt conveyor 02, a three-way distributor 03, and a stacker 04. Multiple belt conveyors 02 and multiple three-way distributors 03 are interspersed between the receiving trough 01 and the stacker 04. The stacker 04 corresponds to one or more terminal stockpiles 05. The terminal stockpiles 05 are piles of raw materials at the primary stockyard. Multiple terminal stockpiles 05 can be set up at each primary stockyard, and each terminal stockpile 05 can store a different type of raw material. The raw material transportation process is as follows: the raw materials are unloaded at the receiving trough 01 by a dumper or car, then transported from the corresponding receiving trough 01 to the belt conveyor 02. Then, via the belt conveyor 02 and the three-way distributor 03, they are transported to the stacker 04. Finally, the stacker 04 stacks the raw materials into a specific terminal stockpile 05.

[0004] During actual transportation, due to the high frequency of use of various transport equipment, it's inevitable that some equipment may malfunction or become unavailable due to maintenance. This failure will affect the transportation of raw materials. Furthermore, the availability of the final stockpile 05 will determine whether the raw materials in the stocker 04 can be unloaded in a timely manner, further affecting the transportation of the raw materials. Furthermore, the belt length and speed of each belt conveyor vary, resulting in varying transport times for each belt conveyor. Therefore, it's necessary to select the most appropriate combination of transport equipment as the optimal raw material transportation route based on the real-time availability of each transport equipment and the final stockpile 05, as well as the transport time of each belt conveyor.

[0005] Currently, the selection of the optimal raw material transportation route is typically done manually. This involves manually obtaining the real-time availability of each transport device and the final material pile 05, as well as the transport time of each belt conveyor, analyzing and determining the optimal raw material transportation route. However, this manual selection of the optimal raw material transportation route cannot dynamically optimize the transportation route. If a transport device suddenly becomes unavailable, or the final material pile 05 becomes full and unavailable, the operator must discover the problem, re-obtain the real-time availability of each transport device and the final material pile 05, and then manually select a new optimal raw material transportation route. This significantly reduces raw material transportation efficiency. Summary of the Invention

[0006] The present application provides a method and system for selecting an optimal raw material transportation route, which can be used to solve the problem that the existing method of manually selecting the optimal raw material transportation route cannot dynamically optimize the transportation route. Once a certain transportation equipment is suddenly unavailable, or the belt speed of the belt conveyor changes, or the original target terminal pile 05 is full of raw materials, the operator can only wait until a problem occurs in the final raw material transportation before discovering and taking targeted measures. This will greatly reduce the technical problem of the transportation efficiency of the raw materials.

[0007] In a first aspect, the present application provides a method for selecting an optimal raw material transportation route, the selection method comprising:

[0008] Determine the starting point receiving trough and the end point material pile for raw material transportation;

[0009] Acquire initial transport data; the initial transport data includes the number groups of the starting material receiving trough, all transport equipment, and the terminal material pile, as well as the initial usable status of the starting material receiving trough, all transport equipment, and the terminal material pile; wherein the transport equipment includes the belt conveyor, three-way distributor, and stacker provided between the starting material receiving trough and the terminal material pile;

[0010] Obtaining the transport time required for each transport device to complete one transport; wherein the transport time of the belt conveyor is determined based on the length and belt speed of each belt conveyor;

[0011] Taking all transportation times as weights and determining a transportation adjacency matrix based on the initial transportation data;

[0012] Obtaining the current availability status of each transport device and the terminal stockpile;

[0013] Processing the transport adjacency matrix according to the current availability status to determine an available route adjacency matrix;

[0014] Calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time path tracking matrix between all transport equipment;

[0015] An optimal raw material transportation path between the starting site and the end site is determined according to the minimum time path tracking matrix.

[0016] In an implementation of the first aspect, the transport time of the adhesive tape machine is determined according to the following formula:

[0017]

[0018] Among them, T[i] is the transportation time of the belt conveyor, i is each belt conveyor, l is the length of each belt conveyor, m is the belt speed of each belt conveyor, and n is the number of transportation equipment in the numbering group.

[0019] In an implementation of the first aspect, taking all transport times as weights and determining a transport adjacency matrix based on the initial transport data includes:

[0020] All transportation times are used as weights, and a directed weighted graph G = (V, E) is established based on the number groups;

[0021] The transport adjacency matrix A[i][j] is established according to the following formula and the directed weighted graph:

[0022]

[0023] Where A[i][j] is the transport adjacency matrix, V i is the i-th transport equipment, V j is the jth transport equipment, V is the number group, E is the edge set of the directed weighted graph, A ij The transportation time is as stated above.

[0024] In an implementation manner of the first aspect, processing the transport adjacency matrix according to the current availability status to determine the available route adjacency matrix includes:

[0025] Determine the availability status of each transport equipment;

[0026] When the available state is available, the adjacent transport path of the transport equipment is available, and A[i][j]=A in the transport adjacency matrix is ​​updated. ij ;

[0027] When the available state is unavailable, the adjacent transport path of the transport equipment is available, and A[i][j]=∞ in the transport adjacency matrix is ​​updated;

[0028] All updated A[i][j] are determined as the available line adjacency matrix.

[0029] In an implementation manner of the first aspect, calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time path tracking matrix between all transportation equipment includes:

[0030] Calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time matrix between all transport equipment;

[0031] Determine the minimum time between the starting site and the end site according to the minimum time matrix;

[0032] The minimum time path tracking matrix is ​​determined according to the minimum time.

[0033] In an implementation manner of the first aspect, calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time matrix between all transportation devices includes:

[0034] The minimum time matrix is ​​obtained according to the following formula:

[0035]

[0036] Wherein, T[i][j] is the minimum time matrix, T ij is the minimum time weight, and E is the edge set of the directed weighted graph.

[0037] In an implementation manner of the first aspect, determining the minimum time path tracking matrix according to the minimum time includes:

[0038] The minimum time path tracking matrix is ​​determined according to the following formula:

[0039] P[i][j]={P ij ,P ij ∈V,

[0040] Wherein, P[i][j] is the minimum time path tracking matrix, V is the number group, P ij is the serial number of the numbering group.

[0041] In an implementation of the first aspect, determining the optimal raw material transportation path between the starting site and the end site according to the minimum time path tracking matrix includes:

[0042] According to the plurality of transport equipment v adjacent to the starting site m , the multiple end sites v n , compared with T mn The minimum time value in the starting device v w , the end site v y

[0043] Define the starting device v w and the finish line v y The variable transport equipment group K[i] between the starting sites and the first transport equipment v w Add K[i] to the variable transport equipment group;

[0044] Set the minimum time path to x, and the initial value of x is P wy Among them, P wy The transport equipment v adjacent to the starting site w , and the terminal stockpile v of the terminal site y The minimum time path between

[0045] Performing cyclic judgment on each item in the minimum time path tracking matrix;

[0046] If x!=y, then the rth transport device v r Added to the variable transport equipment group K[i], and x=P xy ;

[0047] The terminal stockpile v y Add K[i] to the variable transport equipment group;

[0048] The variable transport equipment group K[i] is determined as the optimal raw material transport path.

[0049] In an implementation manner of the first aspect, the selection method further includes:

[0050] After determining the optimal raw material transportation path, the three-way distributor is controlled in forward and reverse directions according to the following steps:

[0051] Read the three-way distributor group F=[f0,f1,…f h-1 ], where h is the array length of the three-way distributor group;

[0052] According to the three-way distributor group F, the upstream number group R of the upstream transportation equipment is obtained = [r0, r1, ... r h-1 ];

[0053] Establish a downstream optional equipment matrix B[i][j], where i corresponds to the sequence number in the upstream numbering group, and j represents the direction of the three-way distributor, including reverse and forward;

[0054] Taking each item in the upstream transport equipment group R as a condition, traverse the variable transport equipment group K[i], query the transport equipment V, obtain the serial number i of the transport equipment, and the downstream optional equipment K i+1 ;

[0055] Query the downstream optional equipment matrix B[i][j] and K i+1 Match the item and get the value of j;

[0056] If j=0, the three-way distributor is set to reverse direction;

[0057] If j=1, the three-way distributor is set to forward.

[0058] In a second aspect, the present application provides a system for selecting an optimal raw material transportation path, configured to execute the method for selecting an optimal raw material transportation path in the first aspect and any one of various possible implementations, the selection system comprising:

[0059] A site determining module is configured to determine a starting point receiving hopper and an ending point stockpile for raw material transportation;

[0060] An initial data obtaining module is configured to obtain initial transportation data; the initial transportation data includes a number group of the starting point receiving hopper, all transportation devices and the ending point stockpile, and initial available states of the starting point receiving hopper, all transportation devices and the ending point stockpile; wherein the transportation devices include the belt conveyor, the three-way distributor and the stocker arranged between the starting point receiving hopper and the ending point stockpile;

[0061] A belt length and belt speed obtaining module is configured to obtain a belt length and a belt speed of each belt conveyor;

[0062] A transportation time determining module is configured to determine a transportation time of each belt conveyor for completing one transportation according to the length and the belt speed of each belt conveyor;

[0063] A transportation adjacency matrix establishing module is configured to take all transportation times as weights, and to determine a transportation adjacency matrix according to the initial transportation data;

[0064] An available route adjacency matrix determining module is configured to process the transportation adjacency matrix according to the current available states, and to determine an available route adjacency matrix;

[0065] A minimum time path tracking matrix obtaining module is configured to calculate the available route adjacency matrix by a minimum path algorithm, and to obtain a minimum time path tracking matrix between all transportation devices;

[0066] An optimal raw material transportation path determining module is configured to determine an optimal raw material transportation path between the starting point site and the ending point site according to the minimum time path tracking matrix.

[0067] The present application provides a method and system for selecting an optimal raw material transportation path, the selection method comprising determining a starting material receiving trough and a terminal material pile for raw material transportation; obtaining initial transportation data; the initial transportation data comprising a number group of the starting material receiving trough, all transportation equipment and the terminal material pile, as well as an initial usable state of the starting material receiving trough, all transportation equipment and the terminal material pile; wherein the transportation equipment comprises the belt conveyor, three-way distributor and stacker arranged between the starting material receiving trough and the terminal material pile; obtaining the belt length and belt speed of each belt conveyor; and determining the belt length and belt speed of each belt conveyor according to the length and speed of each belt conveyor. The belt speed determines the transport time required for each belt conveyor to complete a transport; all transport times are used as weights, and a transport adjacency matrix is ​​determined based on the initial transport data; the current availability status of each transport device and the destination stockpile is obtained; the transport adjacency matrix is ​​processed based on the current availability status to determine an available route adjacency matrix; the available route adjacency matrix is ​​calculated using a minimum path algorithm to obtain a minimum time path tracking matrix between all transport devices; and the optimal raw material transport path between the starting site and the destination site is determined based on the minimum time path tracking matrix. In this way, a transport adjacency matrix is ​​established based on the initial transport data, the number group, and the transport time, and then the transport adjacency matrix is ​​updated based on the obtained current availability status to obtain an available route adjacency matrix, thereby selecting the optimal raw material transport path, achieving dynamic selection of the optimal raw material transport path and improving raw material transportation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] In order to more clearly illustrate the technical solution of the present application, the following is a brief introduction to the drawings required for use in the embodiments. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0069] Figure 1 This is a top view of the existing raw material transportation system;

[0070] Figure 2 A schematic diagram of the overall process of a method for selecting an optimal raw material transportation route provided in this application;

[0071] Figure 3 A schematic diagram of the selection results of a method for selecting an optimal raw material transportation route provided in this application. DETAILED DESCRIPTION

[0072] In order to make the objectives, technical solutions and advantages of this application clearer, the implementation methods of this application will be further described in detail below with reference to the accompanying drawings.

[0073] The terms used in the following embodiments are only for the purpose of describing specific embodiments and are not intended to be limiting of the present application. As used in the specification and appended claims of this application, the singular expressions "a", "an", "said", "above", "the" and "this" are intended to also include expressions such as "one or more", unless there is a clear contrary indication in the context. It should also be understood that in the following embodiments of the present application, "at least one", "one or more" refer to one, two or more, and "a plurality" refers to two or more. The term "and / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist; for example, A and / or B can represent: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship.

[0074] References to "one embodiment" or "some embodiments" in this specification mean that a particular feature, structure, or characteristic described in conjunction with that embodiment is included in one or more embodiments of the present application. Thus, phrases such as "in one embodiment," "in some embodiments," "in other embodiments," and "in yet other embodiments" appearing in various places in this specification do not necessarily refer to the same embodiment, but rather mean "one or more but not all embodiments," unless otherwise specifically emphasized. The terms "including," "comprising," "having," and variations thereof mean "including but not limited to," unless otherwise specifically emphasized.

[0075] The first embodiment of the present application discloses a method for selecting an optimal raw material transportation path. The following is a detailed description of the method for selecting an optimal raw material transportation path disclosed in the first embodiment of the present application with reference to the accompanying drawings.

[0076] See also Figure 2 , a schematic diagram of the overall process of a method for selecting an optimal raw material transportation route provided by this application;

[0077] Depend on Figure 2 It can be seen that the method for selecting an optimal raw material transportation route provided in the first embodiment of the present application includes:

[0078] Step 101, determining the starting material receiving trough and the ending material pile for raw material transportation;

[0079] In the embodiment of the present application, the starting material receiving trough is set in the raw material yard, and the terminal material pile is set in the primary material yard. It should be noted that there are multiple terminal material piles in the primary material pile, and each terminal material pile only stores one type of raw material, but one type of raw material can be stored in one or more terminal material piles.

[0080] Step 102, obtaining initial transportation data; the initial transportation data includes a number set V[i] = [v0, v1, …v n-1 ] of the starting point receiving hopper, all transportation devices and the ending point stockpile, and initial available states S[i] = [s0, s1, …s n-1 ] of the starting point receiving hopper, all transportation devices and the ending point stockpile; wherein the transportation devices include the belt conveyor, the three-way distributor and the stacker arranged between the starting point receiving hopper and the ending point stockpile;

[0081] In the embodiment of the present application, the initial available state of each transportation device includes an available state and an unavailable state. Wherein the situations causing the transportation device to be unavailable include that the transportation device has been occupied, there is a fault, or it will be shut down for maintenance or repair.

[0082] Step 103, obtaining the transportation time of each transportation device for completing one transportation; wherein the transportation time of the belt conveyor is determined according to the length L[i] = [l0, l1, …l n-1 ] and the belt speed M[i] = [m0, m1, …m n-1 ] of each belt conveyor;

[0083] In the embodiment of the present application, the time of different transportation devices is different, and how to combine different transportation devices together to make the final total time length shortest is an important standard for selecting the optimal raw material transportation path.

[0084] In the embodiment of the present application, the transportation time of the belt conveyor is determined according to the following formula:

[0085]

[0086] Wherein T[i] is the transportation time of the belt conveyor, i is each belt conveyor, l is the length of each belt conveyor, m is the belt speed of each belt conveyor, and n is the number of transportation devices in the number set.

[0087] Step 104, taking all transportation times as weights, and determining a transportation adjacency matrix according to the initial transportation data;

[0088] In the embodiment of the present application, the step 104 includes:

[0089] Step 401, taking all transportation times as weights, and establishing a directed weighted graph G = (V, E) according to the number set;

[0090] Step 402, establishing the transportation adjacency matrix A[i][j] according to the following formula and the directed weighted graph:

[0091]

[0092] wherein A[i][j] is the transport adjacency matrix, V i is the ith transport device, V j is the jth transport device, V is the number set, E is the edge set of the directed weighted graph, A ij is the transport time.

[0093] Step 105, obtaining the current available state of each transport device and the terminal pile;

[0094] In the embodiments of the present application, the obtaining of the current available state mainly includes the following cases: case one, obtaining according to a preset time interval, which is mainly used for daily monitoring of each transport device and the terminal pile; case two, obtaining the current available state immediately when there is an emergency of each transport device and the terminal pile, instead of waiting for the obtaining of case one. The monitoring of each transport device and the terminal pile and the obtaining of the current available state can be obtained by installing sensors or other common technical means in the art.

[0095] Step 106, processing the transport adjacency matrix according to the current available state to determine the available line adjacency matrix;

[0096] In the embodiments of the present application, the step 106 includes:

[0097] Step 601, judging the available state of each transport device;

[0098] Step 602, when the available state is available, the adjacent transport path of the transport device is available, and A[i][j] in the transport adjacency matrix is updated to A ij ;

[0099] Step 603, when the available state is unavailable, the adjacent transport path of the transport device is available, and A[i][j] in the transport adjacency matrix is updated to ∞;

[0100] Step 604, determining all updated A[i][j] as the available line adjacency matrix.

[0101] Step 107, calculating the available line adjacency matrix by a minimum path algorithm to obtain the minimum time path tracking matrix between all transport devices;

[0102] In the embodiments of the present application, the step 107 includes:

[0103] Step 701, calculating the available line adjacency matrix by a minimum path algorithm to obtain the minimum time matrix between all transport devices;

[0104] In some embodiments of the present application, the minimum time matrix is obtained according to the following formula:

[0105]

[0106] wherein T[i][j] is the minimum time matrix, T ij is the minimum time weight, and E is the edge set of the directed weighted graph.

[0107] Step 702, determining the minimum time between the start site and the end site according to the minimum time matrix;

[0108] Step 703, determining the minimum time path tracking matrix according to the minimum time.

[0109] The determining of the minimum time path tracking matrix according to the minimum time comprises:

[0110] In some embodiments of the present application, the minimum time path tracking matrix is determined according to the following formula:

[0111] P[i][j] = {P ij , P ij ∈ V,

[0112] wherein P[i][j] is the minimum time path tracking matrix, V is the numbering group, and P ij is the numbering group serial number.

[0113] Step 108, determining the optimal raw material transportation path between the start site and the end site according to the minimum time path tracking matrix.

[0114] In embodiments of the present application, the step 108 comprises:

[0115] Step 801, comparing the minimum time values in T m to obtain the start device v n and the end site v mn according to the start site adjacent to a plurality of transportation devices v w and the plurality of end sites v y ;

[0116] Step 802, defining a variable transportation device group K[i] between the start device v w and the end site v y , and adding the first transportation device v w adjacent to the start site into the variable transportation device group K[i];

[0117] Step 803, setting the minimum time path as x, and the initial value of x is Pwv Among them, P wv The transport equipment v adjacent to the starting site w , and the terminal stockpile v of the terminal site n The minimum time path between

[0118] Step 804, performing a cyclic judgment on each item in the minimum time path tracking matrix;

[0119] Step 805: If x!=y, then move the rth transport device v r Added to the variable transport equipment group K[i], and x=P xv ;

[0120] Step 806: the terminal pile v w Add K[i] to the variable transportation equipment group, and determine the variable transportation equipment group K[i] as the optimal raw material transportation path.

[0121] In an embodiment of the present application, the selection method further includes:

[0122] Step 109: After determining the optimal raw material transportation path, the three-way distributor is controlled in forward and reverse directions according to the following steps:

[0123] Step 901, read the three-way distributor group F = [f0, f1, ... f h-1 ], where h is the array length of the three-way distributor group;

[0124] Step 902: Obtain the upstream serial number group R of the upstream transport equipment according to the three-way distributor group F = [r0, r1, ... r h-1 ];

[0125] Step 903: Establish a downstream optional equipment matrix B[i][j], where i corresponds to the sequence number in the upstream numbering group, and j represents the direction of the three-way distributor, including reverse and forward directions;

[0126] Step 904: traverse the variable transport equipment group K[i] based on each item in the upstream transport equipment group R, query the transport equipment V, obtain the serial number i of the transport equipment, and the downstream optional equipment K i+1 ;

[0127] Step 905: query the downstream optional device matrix B[i][j] and K i+1 Match the item and get the value of j;

[0128] Step 906: if j=0, set the three-way distributor to reverse direction;

[0129] Step 907: If j=1, set the three-way distributor to forward.

[0130] In the embodiment of the present application, after the optimal raw material transportation path is selected, it is also necessary to complete the transportation of the raw materials by controlling the forward and reverse directions of the three-way distributor.

[0131] To better understand this solution, Figure 1 Based on the top view of the existing raw material transportation system, a specific embodiment is described by taking the transportation path of pelletized ore as an example:

[0132] See also Figure 3 , which is a schematic diagram of the selection results of a method for selecting an optimal raw material transportation route provided in this application;

[0133] Depend on Figure 3 It can be seen that:

[0134] Determine the starting receiving troughs as receiving trough 1 and receiving trough 2, and the end pile as pellet pile C;

[0135] Obtain initial transportation data, including a number group V = [102a, 102b, 103a, 103b, 105, 106, 108, 109, 110, 111a, 111b, C] of all transportation equipment and the terminal stockpile, with an array length of n = 12; and an initial usable state M = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] of each transportation equipment and the terminal stockpile;

[0136] Get the length of all tape machines L = [180, 195, 330, 600, 300, 300, 240, 210, 570, 30, 45];

[0137] Get the belt speed M of all belt conveyors to be 3m / s;

[0138] Get the transportation time T required for each transport device to complete one transport operation = [60, 65, 110, 200, 100, 100, 100, 80, 70, 190, 10, 15];

[0139] All transportation times are used as weights, and the transportation adjacency matrix is ​​determined based on the initial transportation data:

[0140]

[0141] Obtain the current availability status of each transport device and the terminal stockpile, assuming that all states are available;

[0142] The transport adjacency matrix is ​​processed according to the current available state to determine an available route adjacency matrix:

[0143]

[0144] The available line adjacency matrix is ​​calculated using the minimum path algorithm to obtain the minimum time matrix T[i][j] and the minimum time path tracking matrix P[i][j] between all transportation devices:

[0145]

[0146]

[0147] The adjacent equipment at the starting site is the belt conveyor 102a, the belt conveyor 102b, and the belt conveyor 103b, and the destination site is pellet pile C. The minimum time from the belt conveyor 102a to pellet pile C is 530, the minimum time from the belt conveyor 102b to pellet pile C is 535, and the minimum time from the belt conveyor 102b to pellet pile C is 560. The minimum time from the starting site to the destination site is the minimum time from the belt conveyor 102a to pellet pile C, which is 530. Therefore, the minimum time path is K = [102a, 103a, 105, 106, 108, 109, 111a, C].

[0148] After determining the optimal raw material transportation path, the three-way distributor is controlled in the forward and reverse directions according to the following steps:

[0149] Three-way distributor F =

[107] ;

[0150] The three-way distributor F obtains the upstream conveying equipment R =

[106] ;

[0151] Matrix of optional equipment downstream of the three-way distributor;

[0152] Downstream optional equipment is =108;

[0153] In the minimum time transport path, the 107 three-way distributor is set to forward.

[0154] It can be seen from the above technical solution that the present application provides a method for selecting an optimal raw material transportation route, the selection method comprising determining the starting site and the end site of the raw material transportation; wherein the starting site comprises a starting material receiving trough, a starting material distribution bin and a starting material pile, and the end site comprises an end material distribution bin and an end material pile; obtaining initial transportation data; the initial transportation data comprises all transportation equipment between the starting site and the end site and the end site, as well as the numbering group of the transportation equipment and the end site, and the initial available status of the transportation equipment and the end site; wherein the transportation equipment comprises a material reclaimer, a belt conveyor, a three-way distributor and a material piler The method comprises the following steps: obtaining the transport time required for each transport device to complete a transport; obtaining the transport time required for each transport device to complete a transport; wherein the transport time of each belt conveyor is determined based on the length and belt speed of each belt conveyor; using all transport times as weights, and determining a transport adjacency matrix based on the initial transport data; obtaining the current availability status of each transport device; processing the transport adjacency matrix based on the current availability status to determine an available route adjacency matrix; calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time path tracking matrix between all transport devices; and calculating the minimum time path tracking matrix to obtain an optimal raw material transport path between the starting site and the ending site. In this manner, a transport adjacency matrix is ​​established based on the initial transport data, the number group, and the transport time; the transport adjacency matrix is ​​then updated based on the obtained current availability status to obtain an available route adjacency matrix, thereby selecting the optimal raw material transport path, achieving dynamic selection of the optimal raw material transport path, and improving raw material transport efficiency.

[0155] Corresponding to the method for selecting an optimal raw material transportation path provided in the first embodiment of the present application, the second embodiment of the present application provides a system for selecting an optimal raw material transportation path, the selection system comprising:

[0156] A site determination module is used to determine the starting site and the end site of the raw material transportation; wherein the starting site includes the starting material receiving trough, the starting material distribution bin and the starting material pile, and the end site includes the end material distribution bin and the end material pile;

[0157] An initial data acquisition module is used to acquire initial transportation data; the initial transportation data includes all transportation equipment between the starting site and the ending site, the ending site, the number groups of the transportation equipment and the ending site, and the initial availability status of the transportation equipment and the ending site; wherein the transportation equipment includes a reclaimer, a belt conveyor, a three-way distributor, and a stacker;

[0158] A transport time determination module is used to obtain the transport time required for each transport device to complete one transport; wherein the transport time of the belt conveyor is determined based on the length and belt speed of each belt conveyor;

[0159] A transport adjacency matrix establishing module is configured to take all transport times as weights and determine a transport adjacency matrix according to the initial transport data;

[0160] A transport device available state obtaining module is configured to obtain current available states of the transport devices;

[0161] An available line adjacency matrix determining module is configured to process the transport adjacency matrix according to the current available states to determine an available line adjacency matrix;

[0162] A minimum time path tracking matrix obtaining module is configured to calculate the available line adjacency matrix by a minimum path algorithm to obtain a minimum time path tracking matrix between all the transport devices;

[0163] An optimal raw material transport path determining module is configured to calculate the minimum time path tracking matrix to obtain an optimal raw material transport path between the start point site and the end point site.

[0164] The above device has the effects of the above method, which will not be repeated here.

[0165] Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. Variations and modifications of the embodiments described herein can be effected including the substitution of known equivalents for any aspect of the application relating to composition of matter or method of operation by those skilled in the art, from the consideration of this disclosure, which is intended to be illustrative and not limiting. Features described in the specification and embodiments are intended to be combined in any combination unless otherwise expressly excluded. Specifically, any feature described with respect to one embodiment can be combined with any other feature described with respect to any other embodiment. The true scope of the application is defined by the claims, and it will be understood by those skilled in the art that various modifications can be made to the application without departing from its scope.

[0166] It should be understood that the application is not limited to the precise construction that has been described above and illustrated in the accompanying drawings and that various modifications and changes can be made by those skilled in the art without departing from the scope of the application; the scope of which is to be limited only by the appended claims.

Claims

1. A method for selecting an optimal raw material transportation route, characterized in that: The selection method includes: Determine the starting site and the end site for raw material transportation; wherein the starting site includes the starting material receiving trough, the starting material distribution bin and the starting material pile, and the end site includes the end material distribution bin and the end material pile; Acquire initial transportation data; the initial transportation data includes all transportation equipment between the starting site and the ending site, the ending site, the number groups of the transportation equipment and the ending site, and the initial availability status of the transportation equipment and the ending site; wherein the transportation equipment includes a reclaimer, a belt conveyor, a three-way distributor, and a stacker; Obtaining the transport time required for each transport device to complete one transport; wherein the transport time of the belt conveyor is determined based on the length and belt speed of each belt conveyor; Taking all transportation times as weights and determining a transportation adjacency matrix based on the initial transportation data; Get the current availability status of each transport device; Processing the transport adjacency matrix according to the current availability status to determine an available route adjacency matrix; Calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time path tracking matrix between all transport equipment; Obtaining an optimal raw material transportation path between the starting site and the end site by calculating the minimum time path tracking matrix; The determining of the optimal raw material transportation path between the starting site and the end site according to the minimum time path tracking matrix includes: According to the plurality of transport equipment adjacent to the starting site , multiple finish sites ,Compare The minimum time value in the start device , the finish line ; Define the starting point device and the said terminal venue The variable transport equipment group K[i] between them; The selection method further includes: After determining the optimal raw material transportation path, the three-way distributor is controlled in forward and reverse directions according to the following steps: Read the three-way distributor group F=[ , , … ], where h is the array length of the three-way distributor group; According to the three-way distributor group F, the upstream number group R of the upstream transportation equipment is obtained = [ , , … ]; Establish a downstream optional equipment matrix , where i corresponds to the serial number in the upstream numbering group, and j represents the direction of the three-way distributor, including reverse and forward; Taking each item in the upstream number group R as a condition, traverse the variable transport equipment group K[i], query the transport equipment V, obtain the serial number i of the transport equipment, and the downstream optional equipment ; Query the downstream optional equipment matrix B[i][j] and Match the item and get the value of j; If j=0, the three-way distributor is set to reverse direction; If j=1, the three-way distributor is set to forward.

2. The method for selecting an optimal raw material transportation route according to claim 1, characterized in that: The transportation time of the tape conveyor is determined according to the following formula: ， in, is the transportation time of the tape machine, For each tape dispenser, For each tape dispenser's stated length, For the belt speed of each belt conveyor, is the number of transport equipment in the numbered group.

3. The method for selecting an optimal raw material transportation route according to claim 1, characterized in that: The method of using all transport times as weights and determining a transport adjacency matrix based on the initial transport data includes: All transportation times are used as weights, and a directed weighted graph G=(V, E) is established based on the number groups; The transport adjacency matrix A[i][j] is established according to the following formula and the directed weighted graph: ， Where A[i][j] is the transport adjacency matrix, V i is the i-th transport equipment, V j is the jth transport equipment, V is the number group, E is the edge set of the directed weighted graph, A ij The transportation time is as stated above.

4. The method for selecting an optimal raw material transportation route according to claim 3, characterized in that: The processing of the transport adjacency matrix according to the current availability status to determine an available route adjacency matrix includes: Determine the availability status of each transport equipment; When the available state is available, the adjacent transport path of the transport equipment is available, and A[i][j]=A in the transport adjacency matrix is ​​updated. ij ; When the available state is unavailable, the adjacent transport path of the transport equipment is available, and then A[i][j]= ; All updated A[i][j] are determined as the available line adjacency matrix.

5. The method for selecting an optimal raw material transportation route according to claim 4, characterized in that: Calculating the available line adjacency matrix using the minimum path algorithm to obtain a minimum time path tracking matrix between all transportation equipment includes: Calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time matrix between all transport equipment; Determine the minimum time between all transportation equipment and the terminal site according to the minimum time matrix; The minimum time path tracking matrix is ​​determined according to the minimum time.

6. The method for selecting an optimal raw material transportation route according to claim 5, characterized in that: The method of calculating the available route adjacency matrix using a minimum path algorithm to obtain a minimum time matrix between all transport equipment includes: The minimum time matrix is ​​obtained according to the following formula: ， Wherein, T[i][j] is the minimum time matrix, is the minimum time weight, and E is the edge set of the directed weighted graph.

7. The method for selecting an optimal raw material transportation route according to claim 5, characterized in that: Determining the minimum time path tracking matrix according to the minimum time includes: The minimum time path tracking matrix is ​​determined according to the following formula: , ， in, is the minimum time path tracking matrix, For the numbered group, is the serial number of the numbering group.

8. The method for selecting an optimal raw material transportation route according to claim 7, characterized in that: The determining of the optimal raw material transportation path between the starting site and the end site according to the minimum time path tracking matrix further includes: The first transport equipment adjacent to the starting site Add K[i] to the variable transport equipment group; Set the minimum time path to x, and the initial value of x is ;in, Transport equipment adjacent to the starting point , and the terminal stockpile at the terminal site The minimum time path between Performing cyclic judgment on each item in the minimum time path tracking matrix; If x!=y, then the rth transport device Added to the variable transport device group In the middle, and x= ; The terminal stockpile Add K[i] to the variable transportation equipment group, and determine the variable transportation equipment group K[i] as the optimal raw material transportation path.

9. A system for selecting an optimal raw material transportation route, characterized in that: A method for selecting an optimal raw material transportation path according to any one of claims 1 to 8, wherein the selection system comprises: A site determination module is used to determine the starting site and the end site of the raw material transportation; wherein the starting site includes the starting material receiving trough, the starting material distribution bin and the starting material pile, and the end site includes the end material distribution bin and the end material pile; An initial data acquisition module is used to acquire initial transportation data; the initial transportation data includes all transportation equipment between the starting site and the end site and the end site, as well as the number groups of the transportation equipment and the end site, and the initial availability status of the transportation equipment and the end site; wherein the transportation equipment includes a reclaimer, a belt conveyor, a three-way distributor, and a stacker; A transport time determination module is used to obtain the transport time required for each transport device to complete one transport; wherein the transport time of the belt conveyor is determined based on the length and belt speed of each belt conveyor; a transport adjacency matrix establishment module, configured to take all transport times as weights and determine a transport adjacency matrix based on the initial transport data; The transport equipment availability status acquisition module is used to obtain the current availability status of each transport equipment; An available route adjacency matrix determining module, configured to process the transport adjacency matrix according to the current available state to determine an available route adjacency matrix; A minimum time path tracking matrix acquisition module is used to calculate the available line adjacency matrix using a minimum path algorithm to obtain the minimum time path tracking matrix between all transportation equipment; The optimal raw material transportation path determination module is used to obtain the optimal raw material transportation path between the starting site and the end site by calculating the minimum time path tracking matrix.

Images