Strip mine sprinkler scheduling method

Abstract

The invention discloses a strip mine watering cart scheduling method, and belongs to the technical field of strip mine flying dust monitoring. The server side obtains position information of all dust raising points; reading a mining area map, and calculating the shortest path between each watering cart and the dust raising point and the shortest path between the watering carts; and the positions of dust raising points are sequenced, so that the shortest total route of operation is ensured. The distance between dust raising points is automatically calculated through the shortest circuit algorithm, the sprinkler scheduling problem is converted into a traveling salesman problem to be solved, and the operation efficiency of the sprinkler is improved. Compared with a traditional scheduling method, the method automatically generates the operation route of the watering cart, can effectively reduce the scheduling difficulty of the watering operation, and improves the operation efficiency of the watering cart.

Description

Technical Field

[0001] The invention belongs to the technical field of open-pit mine dust monitoring, and in particular relates to an open-pit mine sprinkler truck dispatching method. Background Art

[0002] The definition of dust varies slightly in different industries, but in general it refers to tiny particulate matter suspended in the air for a period of time, with a particle size usually less than 75 microns. Dust pollution in open-pit mines is affected by many factors, including the mining process, mining scale, meteorological climate, and topography of open-pit mines. According to the chronological order of open-pit mine operations, dust mainly comes from drilling, blasting, mining, transportation, and soil discharge. The dust generated in these links not only pollutes the environment around the mining area, but also has a serious impact on the health of miners. The watering operation of the sprinkler truck is the main means of dust reduction in the mining, transportation, and soil discharge stages of open-pit mines, and the dispatch efficiency of the sprinkler truck has a huge impact on the dust reduction effect.

[0003] At present, the dispatch of sprinkler trucks often adopts manual experience. When dust appears somewhere on the operation site, the dispatch room temporarily decides the dust point where the sprinkler truck should go and informs the sprinkler truck driver through the intercom. This dispatch method relies heavily on the dispatcher's on-site experience. When there are many dust points on the site, the dispatcher often finds it difficult to cope with it, and the sprinkler truck's operating efficiency is naturally affected. It is difficult to rush to the dust point in time, and the dust reduction effect is also difficult to show. Summary of the invention

[0004] In view of the shortcomings of the prior art, the present invention aims to provide a method for dispatching open-pit mine sprinkler trucks.

[0005] The technical solution adopted by the invention is: a method for dispatching open-pit mine sprinkler trucks, and its technical key points are, including the following steps: the server obtains the location information of all dust points; reads the mining area map, calculates the shortest path between each sprinkler truck and the dust point, and between sprinkler trucks; sorts the locations of the dust points to ensure that the total route of the operation is the shortest; the sprinkler truck performs the operation according to the operation sequence issued by the server, and if completed, it goes to the next dust point, otherwise continues the operation until all dust points are completed.

[0006] Furthermore, the water sprinkler truck is equipped with an on-board computer and a positioning module, and is loaded with an electronic map to provide an operation plan to the driver.

[0007] Furthermore, when a new dust point is reported, the sprinkler truck continues to operate, and the server starts the open-pit mine sprinkler truck scheduling method to reacquire the operation order.

[0008] The beneficial effect of the present invention is that the open-pit mine sprinkler truck scheduling method automatically calculates the distance between dust points through the shortest path algorithm, transforms the sprinkler truck scheduling problem into a traveling salesman problem for solution, and aims to improve the sprinkler truck operation efficiency. Compared with the traditional scheduling method, the present method automatically generates the sprinkler truck operation route, which can effectively reduce the difficulty of sprinkler operation scheduling and improve the sprinkler truck operation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0010] Figure 1 It is a flow chart of the watering truck dispatching of the present invention;

[0011] Figure 2 It is a schematic diagram of the iteration of the genetic algorithm of the present invention. DETAILED DESCRIPTION

[0012] To make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the following is a brief description of the present invention in conjunction with the attached Figure 1-Figure 2 The present invention is further described in detail with reference to the accompanying drawings and specific embodiments.

[0013] The present embodiment adopts an open-pit mine sprinkler truck dispatching method, the steps are as follows:

[0014] Step (1) The sprinkler truck is equipped with an onboard computer, a positioning module, and an electronic map, which can provide the driver with an operation plan;

[0015] Step (2) The server obtains the location information of all dust generating points;

[0016] Step (3) reads the mining area map and calculates the shortest path between each sprinkler truck and the dust point, and between sprinklers. It is recommended to use the Floyd shortest path algorithm to solve it;

[0017] Step (4) sorting the dust point locations to ensure that the total route of the operation is the shortest. It is recommended to use a genetic algorithm for sorting.

[0018] Step (5) The server sends the operation sequence to the sprinkler truck;

[0019] Step (6) The sprinkler truck goes to the first dust generating point according to the operation sequence and starts operation;

[0020] If step (7) is completed, go to the next dust generating point, otherwise continue the operation;

[0021] Step (8) When a new dust point is reported, the sprinkler truck continues to operate and the server starts step (1).

[0022] Unlike watering operations in urban areas, dust points in open-pit mines are relatively random. The pressure and vibration caused by trucks driving on the road will cause dust, and open-pit mine roads are mostly temporary roads with frequent changes. This makes it difficult to schedule open-pit mine watering operations through advance predictions, and real-time scheduling becomes the most realistic option. Every time a new dust point is reported, the watering truck operation plan needs to be adjusted.

[0023] The new watering operation plan should include the operation sequence, that is, which dust point to go to first, and the driving path of each watering truck between dust points. The operation sequence of the watering trucks needs to take into account the distance between dust points. This means that the optimal driving path between dust points should be found first, and the operation sequence of the watering trucks should be determined on this basis.

[0024] When new dust points appear, the number of dust points is relatively fixed. The shortest path between each dust point can be calculated based on the open-pit mine road information. The open-pit mine road information includes the location, length, and topological relationship of each road section. Road information is the basis for open-pit mine transportation operation management. All mines generally have complete and timely road information, so there is no need to study the acquisition method additionally. The shortest path of each dust point can be solved by the shortest path algorithm. Common shortest path algorithms are shown in Table 1.

[0025] Table 1 Comparison of shortest path algorithms

[0026]

[0027] Given that the open-pit mine road structure is relatively simple, all of the above methods can complete the shortest path calculation of dust points. The following only uses the Floyd algorithm to illustrate the shortest path calculation process.

[0028] The basic idea of ​​Floyd's shortest path algorithm is to use the idea of ​​graph in data structure to filter other attributes in the road, retain only the information of points and edges, and construct the adjacency matrix S between points. This matrix stores the initial shortest distance between points in the graph. Build a matrix P to record the insertion point between two points, and traverse the loop three times to find out whether there is another insertion point between the points, so that the distance through this insertion point is less than the shortest distance between the points. If there is, record it in the matrix P and update the shortest distance of the S matrix. Combine the starting point and the end point to find the insertion point in the matrix P to form a set of points passed by the path.

[0029] If there are M dust points in total, the distances between the dust points can form a distance matrix

[0030]

[0031] In particular, d M，M+1 is the distance from the sprinkler truck to the Mth dust point. On this basis, we can find the sprinkler truck operation sequence with the shortest total route. In this way, the problem of determining the sprinkler truck operation sequence becomes a classic traveling salesman problem.

[0032] The traveling salesman problem (TSP) is one of the famous NP-hard problems in the field of combinatorial optimization. The classic formulation of the problem is: "A traveling salesman wants to go to various cities to sell goods. He starts from city 1, passes through the remaining cities at least once, and finally returns to city 1. How to plan the route so that the total journey is the shortest?" Different algorithms such as exhaustive method, genetic algorithm, ant colony algorithm, etc. can be used to solve the traveling salesman problem. The present invention recommends using genetic algorithm to solve it.

[0033] Take an open-pit mine as an example. The mine has two mining areas. Mining area II is equipped with a sprinkler. At a certain time on a certain day in July 2023, the dispatch center received a request for watering operations at five dust points in mining area II. In the past, the watering order was usually determined by the order of receiving dust reports, and the report order was used as the dust point ID. Using this method, according to the mine map, the Floyd shortest path algorithm was used to calculate the distances between the five dust points and the distance between the sprinkler and the dust point, as shown in Table 2.

[0034] Table 2 shows the distance between dust generating points and the distance between the sprinkler truck and the dust generating point.

[0035]

[0036] The genetic algorithm was used, with the population size set to 100, the crossover rate to 0.6, the mutation rate to 0.05, the roulette operator, and 500 iterations. The iteration process is as follows: Figure 2 As shown in the figure, after 5 seconds, the sequence of the shortest total route is "water truck->dust point 1->dust point 2->dust point 4->dust point 3->dust point 5", with a total distance of 5.3 kilometers, which is 0.8 kilometers less than the planned route, confirming the effectiveness of this method.

[0037] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A method for dispatching an open-pit mine sprinkler, characterized in that: The following steps are involved: The server obtains the location information of all dust generating points; reads the mining area map, and calculates the shortest path between each sprinkler truck and the dust generating point, and between sprinkler trucks; The dust-generating point locations are sorted to ensure that the total operation route is the shortest; the sprinkler truck performs operations according to the operation sequence issued by the server. If completed, it will go to the next dust-generating point, otherwise it will continue to operate until all dust-generating points are completed.

2. The method for dispatching open-pit mine sprinkler trucks according to claim 1, characterized in that: The water sprinkler is equipped with an on-board computer and a positioning module, and loaded with an electronic map to provide an operation plan to the driver.

3. The method for dispatching open-pit mine sprinkler trucks according to claim 1, characterized in that: When a new dust point is reported, the sprinkler truck continues to operate, and the server starts the open-pit mine sprinkler truck scheduling method to re-acquire the operation order.

Images