An intelligent editing method and system for large-scale metal mine stripping planning
By constructing an intelligent editing method for large-scale metal mine stripping planning and utilizing an improved ant colony algorithm to optimize the block mining sequence, the problem of speed and accuracy in large-scale metal mine stripping planning has been solved, thereby extending mine life and achieving efficient resource utilization.
Patent Information
- Application Number
- CN202411146889.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-21
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-08-21
AI Technical Summary
Existing technologies suffer from slow optimization speed and low accuracy in large-scale metal mine mining and stripping planning, especially when the mine has complex lithology and a variety of data types. This makes the editing process cumbersome and error-prone, making it difficult to achieve fast and accurate planning.
An intelligent editing method for large-scale metal mine stripping planning is adopted. By acquiring basic ore mining data and centroid data of 3D models, a net present value objective function and mining constraint model are constructed. An improved ant colony algorithm is used in combination with incremental ore and rock volume data to optimize the block mining sequence and form incremental stripping volumes to achieve the optimal mining sequence.
It enables the rapid and accurate editing of mining and stripping plans for large metal mines, extends the lifespan of mining enterprises, improves resource utilization and economic benefits, and meets the scientific mining needs of mining enterprises.
Smart Images

Figure CN118657626B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of data processing, and in particular to an intelligent editing method and system for large-scale metal mine stripping planning. Background Art
[0002] Extending the service life is crucial to mining companies. Increasing the service life can minimize the risks and uncertainties in the mining production process. Since mine development requires a lot of money and resources, if the service life is too short, the mine will not be able to recover the investment, resulting in economic losses; on the other hand, a longer service life can improve the profitability and competitiveness of the mine. With the depletion of ore resources and the increase in mining costs, mines often need to rely on longer production time to support the development of the business. Only mining companies with longer service lives can achieve stable production capacity and sustainable profitability. In addition, extending the service life of mines will also help solve local labor problems and obtain more social benefits.
[0003] To extend the service life of mines, mining companies must formulate scientific mining plans and management plans. By rationally arranging the mining sequence and optimizing mineral collection and processing, ore resources can be utilized to the maximum extent and resource waste and environmental damage can be minimized. In the past, in the process of optimizing mine mining plans, the traditional block mining sequence optimization method had poor results in terms of optimization speed and volume. For some large-volume mines, not only was the optimization time long, but the optimization process was also interrupted due to the large volume. Therefore, how to quickly and accurately edit the mining and stripping plan of large metal mines is an urgent problem to be solved. Summary of the invention
[0004] In view of the shortcomings of existing methods and the needs of practical applications, in order to avoid the difficulty, tediousness and error-proneness of data processing caused by the complex lithology and multiple types of data of metal mines when editing the mining and stripping plans of large metal mines, the problem of quickly and accurately editing the mining and stripping plans of large metal mines is solved. On the one hand, the present invention provides an intelligent editing method for the mining and stripping plans of large metal mines, comprising the following steps: obtaining the basic ore mining data and the centroid point data of the three-dimensional model of the large metal mine; constructing the net present value objective function of the metal mine and the mining constraint model of the metal mine according to the basic ore mining data; obtaining the incremental body ore and rock quantity data by using the centroid point data of the three-dimensional model; based on the improved ant colony algorithm, combining the net present value objective function of the metal mine, the mining constraint model of the metal mine and the incremental body ore and rock quantity data, obtaining the optimal mining sequence of the metal mine blocks; obtaining the metal mine mining and stripping plan according to the optimal mining sequence of the metal mine blocks and the centroid point data of the three-dimensional model. The present invention constructs mining increment bodies, takes the formed series of mining increment bodies as optimization units, adopts an improved optimization algorithm to optimize the block mining sequence, and solves the problem of quickly and accurately editing the mining and stripping plan of large metal mines by determining the optimal mining sequence according to the complex linkage relationship between mineral ore grade and ore reserves, mining depletion rate, mining loss rate and mineral processing recovery rate, thereby achieving the goals of extending the life of mining enterprises, making full use of resources and achieving better economic benefits.
[0005] Optionally, the basic ore mining data includes ore grade, ore reserves, mining depletion rate, mining loss rate, mineral processing recovery rate, ore specific gravity, mining unit cost, ore unit price, mining area geological data and mine block properties. The basic ore mining data obtained by the present invention takes into account many factors and is conducive to improving the accuracy and practicality of large-scale metal mine mining planning.
[0006] Optionally, based on the ore mining basic data, a metal mine net present value objective function is constructed to satisfy the following formula:
[0007]
[0008] in, represents the net present value objective function value of the metal mine, represents the discount rate, Indicates the maximum service life of the mine, Indicates the mining time year, Indicates The total amount of ore mined each year, It represents the mineral processing recovery rate, Indicates Annual ore price, represents the unit mining cost, is the comprehensive processing cost, Indicates Annual rock stripping volume, The net present value objective function of the metal mine constructed by the present invention can quickly and intuitively evaluate the stripping plan, which is conducive to improving the editing speed of the stripping plan of large metal mines.
[0009] Optionally, a metal mine mining constraint model is constructed based on the ore mining basic data, satisfying the following formula:
[0010] , , , ,
[0011] in, Indicates the maximum service life of the mine, Indicates the minimum service life of the mine, Indicates the upper limit of the mine service life, represents the minimum annual mining volume of ore, Indicates the maximum annual mining volume of ore, Indicates The total amount of ore mined each year, Indicates the annual maximum stripping volume, Indicates Annual rock stripping volume, Indicates the mining time year, The constraint model constructed by the present invention conforms to the actual production situation and further ensures the adaptability of the mining and stripping planning of large metal mines.
[0012] Optionally, the method of obtaining incremental volume ore and rock data by using the centroid data of the three-dimensional model comprises the following steps:
[0013] The centroid of the metal mine block is taken as the cone top, and a cone shell is formed from the cone top according to the working slope angle, and a cone is constructed with all the metal mine blocks contained in the shell, and the effective cone is included in the cone series; in the cone series, the metal mine blocks contained in the effective cone are numbered to obtain a first numbering sequence; the cones in the cone series are arranged in ascending order according to the amount of metal in the cone, and the weight of the metal mine blocks is accumulated according to the first numbering sequence, so that the sum of the block weights is approximately equal to 0.1 times the periodic stripping amount, and an incremental body is obtained; the incremental body is numbered in reverse order to obtain the incremental body ore and rock quantity data. The present invention constructs an incremental body through the centroid point data of the three-dimensional model, and the data is accurate, which is further conducive to improving the accuracy of the optimal mining sequence obtained through the incremental body.
[0014] Optionally, the improved ant colony algorithm includes improving the pheromone update mechanism of the ant colony algorithm, and the improved pheromone update mechanism satisfies the following formula:
[0015]
[0016] in, represents the concentration of pheromones released by ants from point i to point j at the next moment, represents the maximum pheromone concentration released by ants from point i to point j, and when point i to point j is the optimal path, , otherwise 0, represents the pheromone concentration of the optimal path, represents the optimal path length of the ant, represents the minimum pheromone concentration released by ants from point i to point j, and when point i to point j is the worst path, , otherwise 0, represents the pheromone concentration with the worst path, represents the worst path length that ants have walked, and ants represent the parameter combination formed by the mining sequence of metal mine blocks. represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the number of ants, Indicates The concentration of pheromones released by an ant from point i to point j at the current moment, The present invention is further applicable to the editing of mining and stripping plans of large metal mines through the improvement of the pheromone update mechanism, thereby improving the reliability and editing speed of mining and stripping plans of large metal mines.
[0017] Optionally, the improved ant colony algorithm further includes improving an iterative convergence condition, and the improved iterative convergence condition satisfies the following formula:
[0018]
[0019] in, represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the maximum pheromone concentration, The invention improves the iterative convergence condition, speeds up the iterative convergence speed, and further improves the editing efficiency of the stripping plan of large metal mines.
[0020] Optionally, the improved ant colony algorithm further includes introducing a direction guidance operator to improve the ant path selection probability, and the introduction of the direction guidance operator to improve the ant path selection probability satisfies the following formula: , ,in, represents the direction guiding operator, represents the probability that ant n moves from location i to the next location j at time k, Indicated in The concentration of pheromones released by ants from point i to point j at time, represents the information heuristic factor, represents the expected heuristic factor, represents the heuristic value from location i to location j, the heuristic value is the inverse of the Euclidean distance from location j to the end point, x represents any location, and U represents the set of locations that ant n has not visited. The present invention improves the probability of ant path selection by introducing a direction guidance operator, thereby further improving the reliability of mining and stripping planning in large metal mines.
[0021] Optionally, obtaining the mining plan of the metal mine according to the optimal mining sequence of the metal mine block and the centroid data of the three-dimensional model comprises the following steps:
[0022] Combine the centroid point data of the three-dimensional model and the optimal mining sequence of the metal mine block to obtain the optimal mining sequence centroid point database; determine the row and column names of the mining schedule according to the optimal mining sequence centroid point database; obtain the mining amount of each type of ore at each step height and the total amount of ore mined at each mining time according to the optimal mining sequence centroid point database; obtain the total amount of each type of ore mined at each mining time according to the optimal mining sequence centroid point database; obtain the stripping ratio according to the optimal mining sequence centroid point database; combine the mining amount of each type of ore at the same step height and the total amount of ore mined at each mining time, the total amount of each type of ore mined at the same mining time and the stripping ratio to obtain the mining schedule of the metal mine. The present invention is conducive to quickly and accurately obtaining the mining and stripping plan of large metal mines by statistically editing the amount of data required for the mining schedule.
[0023] In the second aspect, in order to be able to efficiently execute the intelligent editing method for mining and stripping planning of a large metal mine provided by the present invention, the present invention also provides an intelligent editing system for mining and stripping planning of a large metal mine, including a processor, an input device, an output device and a memory, wherein the processor, the input device, the output device and the memory are interconnected, wherein the memory is used to store a computer program, the computer program includes program instructions, and the processor is configured to call the program instructions to execute the intelligent editing method for mining and stripping planning of a large metal mine as described in the first aspect of the present invention. The intelligent editing system for mining and stripping planning of a large metal mine of the present invention has a compact structure and stable performance, and can stably execute the intelligent editing method for mining and stripping planning of a large metal mine provided by the present invention, further improving the overall applicability and practical application capabilities of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] Figure 1 A flow chart of an intelligent editing method for large-scale metal mine stripping planning according to the present invention;
[0025] Figure 2 This is a comparison diagram of the effects of the improved ant colony algorithm of the present invention;
[0026] Figure 3 A short-term mining and stripping planning diagram for a large metal mine according to the present invention;
[0027] Figure 4 A mid-term mining and stripping planning diagram for a large metal mine according to the present invention;
[0028] Figure 5 A long-term mining and stripping planning diagram for a large metal mine according to the present invention;
[0029] Figure 6 This is a framework diagram of an intelligent editing system for large-scale metal mine stripping planning according to the present invention;
[0030] Figure 7 A schematic diagram of the structure of an intelligent editing device for large-scale metal mine stripping planning is provided as an embodiment. DETAILED DESCRIPTION
[0031] The specific embodiments of the present invention will be described in detail below. It should be noted that the embodiments described herein are only for illustration and are not intended to limit the present invention. In the following description, a large number of specific details are set forth in order to provide a thorough understanding of the present invention. However, it is obvious to those of ordinary skill in the art that these specific details do not need to be adopted to implement the present invention. In other examples, in order to avoid confusing the present invention, known circuits, software or methods are not specifically described.
[0032] Throughout the specification, references to "one embodiment," "an embodiment," "an example," or "an example" mean that a particular feature, structure, or characteristic described in conjunction with the embodiment or example is included in at least one embodiment of the present invention. Therefore, the phrases "in one embodiment," "in an embodiment," "an example," or "an example" appearing in various places throughout the specification do not necessarily all refer to the same embodiment or example. In addition, particular features, structures, or characteristics may be combined in one or more embodiments or examples in any suitable combination and / or subcombination. In addition, it should be understood by those of ordinary skill in the art that the figures provided herein are for illustrative purposes and that the figures are not necessarily drawn to scale.
[0033] See also Figure 1 , Figure 1This is a flow chart of an intelligent editing method for large-scale metal mine stripping planning of the present invention. In order to solve the problem of quickly and accurately editing large-scale metal mine stripping planning, the present invention provides an intelligent editing method for large-scale metal mine stripping planning, such as Figure 1 As shown, the method comprises the following steps:
[0034] S1. Obtain the basic data of ore mining and the centroid data of the three-dimensional model of large metal mines.
[0035] Specifically, the basic data of ore mining of the large metal mine described in step S1 is obtained through market research data, including ore grade, ore reserves, mining depletion rate, mining loss rate, mineral processing recovery rate, ore specific gravity, unit cost of stripping, unit price of ore, geological data of the mining area and properties of the mine block. The centroid data of the three-dimensional model includes the spatial coordinates, topography, geological structure and other three-dimensional model information of the mine, which can be obtained by technical means such as laser radar scanning and drone photogrammetry; further, the centroid data includes the three-dimensional coordinates (X, Y, Z) of the centroid point obtained after constructing the three-dimensional model of the large metal mine using CAD or UG three-dimensional model.
[0036] S2. Constructing a metal mine net present value objective function and a metal mine mining constraint model based on the ore mining basic data.
[0037] In the embodiment, the metal mine net present value objective function constructed in step S2 satisfies the following formula:
[0038]
[0039] in, represents the net present value objective function value of the metal mine, represents the discount rate, Indicates the maximum service life of the mine, Indicates the mining time year, Indicates The total amount of ore mined each year, It represents the mineral processing recovery rate, Indicates Annual ore price, represents the unit mining cost, is the comprehensive processing cost, Indicates Annual rock stripping volume, To strip unit costs.
[0040] The metal mining constraint model constructed in step S2 satisfies the following formula:
[0041] , , , ,
[0042] in, Indicates the maximum service life of the mine, Indicates the minimum service life of the mine, Indicates the upper limit of the mine service life, represents the minimum annual mining volume of ore, Indicates the maximum annual mining volume of ore, Indicates The total amount of ore mined each year, Indicates the annual maximum stripping volume, Indicates Annual rock stripping volume, Indicates the mining time year, Indicates the annual production capacity of the mine.
[0043] S3. Obtain incremental volume ore and rock data using the centroid data of the three-dimensional model.
[0044] In the embodiment, the step S3 of using the centroid data of the three-dimensional model to obtain the incremental volume ore and rock data includes the following steps:
[0045] The centroid of the metal mine block is taken as the cone top, a cone shell is formed from the cone top according to the working slope angle, a cone is constructed with all the metal mine blocks contained in the shell, and the effective cone is included in the cone series; in the cone series, the metal mine blocks contained in the effective cone are numbered to obtain a first numbering sequence; the cones in the cone series are arranged in ascending order according to the metal amount, and the weights of the metal mine blocks are accumulated according to the first numbering sequence so that the sum of the block weights is approximately equal to 0.1 times the periodic mining amount to obtain an incremental body; the incremental body is numbered in reverse order to obtain the incremental body ore and rock quantity data.
[0046] Specifically, a cone is constructed with the mass center of a specific block as the cone top. If it is a valid cone, that is, the weight of the block inside the cone is ≤ΔP mining body increment, it will be included in the cone series. In theory, each block in the boundary must participate in the construction of the cone as a block inside the cone more than once, and each block in each incremental body constructed can only appear once. The cone series expresses the possible mining bodies in the mining plan, and ΔP is the mining body increment, which is a weight value.
[0047] Secondly, the cone series is a 2D matrix, where each column represents a valid cone, and the number of columns represents the number of valid cones. The first row of each column in the cone series records the cumulative amount of metal in each block in the column, and the remaining rows mark the block number contained in the cone. The number of rows is ΔP / block weight + 1, and the weight of the ore blocks of the mine is 16,200 tons.
[0048] Furthermore, the row number of the centroid point is used as a unique number for each block, and the X, Y, and Z coordinates are in ascending order of Y under the same X coordinate axis and ascending order of Z under the same Y coordinate axis, so as to obtain the first numbering sequence.
[0049] After the cone series records the valid cones that traverse all blocks as cone items in columns, the metal content in the first row of the cone series is sorted in ascending order, that is, the cone containing the least metal content is placed in the first column, and so on. Taking the first column as the basis, the repeated block numbers in the first c columns are merged into the numbers of the first column, and the other non-repeated block numbers fill the blank rows of the first column in sequence until the first column is filled, that is, the sum of the block weights in this column ≈ΔP. The extra blocks are not marked and can be used to construct incremental bodies later. The first column of the merged and filled cone series is an incremental body, and it meets the following conditions: the metal content is the lowest, that is, the average grade is the lowest, and the sum of the block weights is approximately equal to ΔP.
[0050] The "incremental volume number" attribute of the block is numbered according to the order of constructing the incremental volume, that is, the incremental volume number obtained in the first cycle is 1, and the "incremental volume number" attribute of each block is recorded as 1; the second is 2, and the corresponding attribute of the contained block is 2. And so on. Calculate the sum of the ore content, the sum of the metal content, and the sum of the rock content of the incremental volume.
[0051] The data in the cone series is cleared to 0, and a new cycle of constructing the incremental body is started. However, unlike the previous cycle, any blocks that have been included in the constructed incremental body will no longer participate in the new cycle of constructing the incremental body.
[0052] Repeat until all blocks in the boundary are included in the corresponding incremental body or when the sum of the weights of all remaining blocks in the boundary that are not included in the incremental body is less than ΔP, the incremental body numbers are renumbered in reverse order. It can be understood that the incremental body obtained in the above steps is the incremental body with the least metal content among all valid cones in the boundary and is numbered first, that is, the incremental body numbered 1 is the poorest grade incremental body, and the largest number is the richest grade incremental body. In reality, the first incremental body to be mined is at the top of the boundary, and the richest part is selected for mining first. Therefore, the last constructed incremental body must be numbered 1, and the first constructed incremental body is numbered as the last number to achieve reverse renumbering.
[0053] In the embodiment, the incremental ore and rock volume data of a large metal mine is shown in Table 1.
[0054]
[0055] Table 1 Data on the incremental ore and rock volume of a large metal mine
[0056] S4. Based on the improved ant colony algorithm, combined with the net present value objective function of the metal mine, the mining constraint model of the metal mine and the incremental ore and rock volume data, the optimal mining sequence of the metal mine blocks is obtained.
[0057] In the embodiment, the improved ant colony algorithm in step S4 includes improving the pheromone update mechanism of the ant colony algorithm, and the improved pheromone update mechanism satisfies the following formula:
[0058]
[0059] in, represents the concentration of pheromones released by ants from point i to point j at the next moment, represents the maximum pheromone concentration released by ants from point i to point j, and when point i to point j is the optimal path, , otherwise 0, represents the pheromone concentration of the optimal path, represents the optimal path length of the ant, represents the minimum pheromone concentration released by ants from point i to point j, and when point i to point j is the worst path, , otherwise 0, represents the pheromone concentration with the worst path, represents the worst path length that ants have walked, and ants represent the parameter combination formed by the mining sequence of metal mine blocks. represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the number of ants, Indicates The concentration of pheromones released by an ant from point i to point j at the current moment, Represents the pheromone volatilization coefficient. Different locations represent the influencing parameters in the objective function. The pheromone concentration represents the labeling of the coefficient combination of its variables including ore reserves, mining depletion rate, mining loss rate, and mineral processing recovery rate in the process of solving the objective function. The higher the pheromone concentration, the better the result under the combination of variable coefficients. The path represents the combination of variable coefficients.
[0060] Furthermore, the improved ant colony algorithm further includes improving the iterative convergence condition, and the improved iterative convergence condition satisfies the following formula:
[0061] in, represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the maximum pheromone concentration, Indicates the minimum pheromone concentration.
[0062] Furthermore, the improved ant colony algorithm further includes introducing a direction guidance operator to improve the ant path selection probability, and the introduction of the direction guidance operator to improve the ant path selection probability satisfies the following formula:
[0063] , ,in, represents the direction guiding operator, represents the probability that ant n moves from location i to the next location j at time k, Indicated in The concentration of pheromones released by ants from point i to point j at time, represents the information heuristic factor, represents the expected heuristic factor, represents the heuristic value from location i to location j, which is the reciprocal of the Euclidean distance from location j to the end point, x represents any location, and U represents the set of locations that ant n has not visited.
[0064] See also Figure 2 , it can be seen that the improved ant colony algorithm has obvious optimization effect.
[0065] S5. Obtaining a mining plan for the metal mine based on the optimal mining sequence of the metal mine blocks and the centroid data of the three-dimensional model.
[0066] Specifically, the step S5 of obtaining the mining plan of the metal mine according to the optimal mining sequence of the metal mine block and the centroid data of the three-dimensional model includes the following steps:
[0067] In combination with the centroid point data of the three-dimensional model and the optimal mining sequence of the metal mine blocks, an optimal mining sequence centroid point database is obtained; based on the optimal mining sequence centroid point database, the row and column names of the mining schedule are determined; based on the optimal mining sequence centroid point database, the mining amount of each type of ore at each step height and the total amount of ore mined at each mining time are obtained; based on the optimal mining sequence centroid point database, the total amount of each type of ore mined at each mining time is obtained; based on the optimal mining sequence centroid point database, the stripping ratio is obtained; in combination with the mining amount of each type of ore at the same step height and the total amount of ore mined at each mining time, the total amount of each type of ore mined at the same mining time and the stripping ratio, a metal mine mining schedule is obtained.
[0068] In the embodiment, the optimal mining sequence centroid database of a large metal mine is shown in Table 2.
[0069]
[0070] Table 2 The centroid database of the optimal mining sequence of a large metal mine
[0071] The column names of the mining schedule are automatically identified and obtained from the first row of the optimal mining sequence centroid database. The row names are determined by the step height range. If the step height is greater than 260m, the step height is 10m, and if the step height is less than 260m, the step height is 15m.
[0072] The ore mining volume of each rock type at the same step height is obtained by adding up the single block volume of each rock type at the same step height according to the Z value of the single block coordinate. The total ore mining volume at each mining time at the same step height is obtained by adding up the block volume according to the mining time and block Z value of the centroid database. The total ore mining volume of each rock type at each mining time is obtained by adding up the block volume according to the mining time and rock type.
[0073] Furthermore, the total amount of ore mining is obtained, satisfying the following formula:
[0074]
[0075] in, Indicates The volume of the ore block, Indicates The length, width and height dimensions of the ore block. is the amount of ore mined, Indicates the number of ore blocks;
[0076] The stripping ratio is obtained, satisfying the following formula:
[0077]
[0078] in, represents the stripping ratio, The amount of rock mined, Indicates the total amount of poor and rich ore mining.
[0079] See also Figure 3-5 According to the method of the present invention, the short-term mining and stripping plan of a large metal mine, the medium-term mining and stripping plan of a large metal mine and the long-term mining and stripping plan of a large metal mine can be accurately and quickly obtained.
[0080] See also Figure 6In an embodiment, in order to efficiently execute the intelligent editing method of a large-scale metal mine stripping plan provided by the present invention, the present invention also provides an intelligent editing system of a large-scale metal mine stripping plan, including: an input device, an output device, a processor, and a memory, wherein the input device, the output device, the processor, and the memory are interconnected, and the memory contains program instructions, and the program instructions are used for the steps of the intelligent editing method of the large-scale metal mine stripping plan. The intelligent editing system of a large-scale metal mine stripping plan of the present invention has a compact structure and stable performance, and can stably execute the intelligent editing method of a large-scale metal mine stripping plan of the present invention, further improving the overall applicability and practical application ability of the present invention.
[0081] In an embodiment, the processor may be a central processing unit (CPU), which may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc. An input device may be used to obtain data information. An output device may be used to output the results obtained by storing program instructions contained in a computer program in a memory provided by the present invention. The memory may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory may also store information about the type of device.
[0082] In yet another alternative embodiment, see Figure 7 In order to efficiently execute the intelligent editing method of a large-scale metal mine stripping plan provided by the present invention, this embodiment also provides an intelligent editing device for a large-scale metal mine stripping plan, such as Figure 7 As shown, including:
[0083] The memory 10 is used to store computer programs; the processor 20 is used to execute the computer programs to implement the above-mentioned intelligent editing method for large-scale metal mine stripping planning.
[0084] Memory 10 , processor 20 , communication interface 31 and communication bus 32 . Memory 10 , processor 20 , communication interface 31 all communicate with each other via communication bus 32 .
[0085] In an embodiment, the memory 10 is used to store one or more program instructions, and the memory 10 may store program instructions for implementing the following functions: obtaining basic ore mining data and three-dimensional model centroid data of a large metal mine; constructing a metal mine net present value objective function and a metal mine mining constraint model based on the basic ore mining data; using the three-dimensional model centroid data to obtain incremental body ore and rock quantity data; based on an improved ant colony algorithm, combined with the metal mine net present value objective function, the metal mine mining constraint model and the incremental body ore and rock quantity data, obtaining the optimal mining sequence of metal mine blocks; obtaining a metal mine stripping plan based on the optimal mining sequence of metal mine blocks and the three-dimensional model centroid data.
[0086] In a possible implementation, the memory 10 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function, etc.; the data storage area may store data created during use.
[0087] In addition, the memory 10 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include an NVRAM. The memory stores an operating system and operating instructions, executable modules or data structures, or a subset thereof, or an extended set thereof, wherein the operating instructions may include various operating instructions for implementing various operations. The operating system may include various system programs for implementing various basic tasks and processing hardware-based tasks.
[0088] The processor 20 may be a central processing unit (CPU), an application specific integrated circuit, a digital signal processor, a field programmable gate array or other programmable logic device, a microprocessor or any conventional processor, etc. The processor 20 may call a program stored in the memory 10 .
[0089] The communication interface 31 may be an interface of a communication module, and is used to connect to other devices or systems.
[0090] Of course, it should be noted that Figure 7 The structure shown does not constitute a limitation on the intelligent editing device for large-scale metal mine stripping planning in this embodiment. In actual applications, the intelligent editing device for large-scale metal mine stripping planning may include Figure 7 More or fewer components than shown, or combinations of certain components.
[0091] The embodiment also provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of the intelligent editing method for large-scale metal mine stripping planning are implemented.
[0092] The storage medium may include: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and other media that can store program codes.
[0093] In summary, the present invention constructs a stripping increment body, takes a series of stripping increment bodies formed as optimization units, and uses an improved optimization algorithm to optimize the block mining sequence. According to the complex linkage relationship between the mineral ore grade and ore reserves, mining depletion rate, mining loss rate, and mineral processing recovery rate, the optimal mining sequence is determined to solve the problem of quickly and accurately editing the stripping plan of large metal mines, and achieve the goals of extending the life of mining enterprises, making full use of resources, and achieving better economic benefits. Therefore, the present invention effectively overcomes various shortcomings in the prior art and has a high industrial utilization value.
[0094] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein by equivalents. These modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present invention, and they should all be included in the scope of the claims and specification of the present invention.
Claims
1. An intelligent editing method for large-scale metal mine stripping planning, characterized in that: The following steps are involved: Obtain basic ore mining data and 3D model centroid data of large metal mines; According to the basic data of ore mining, a net present value objective function of a metal mine and a constraint model of metal mine mining are constructed; Using the centroid data of the three-dimensional model, obtaining incremental ore and rock volume data; Based on the improved ant colony algorithm, combined with the metal mine net present value objective function, the metal mine mining constraint model and the incremental body ore and rock volume data, the optimal mining sequence of the metal mine block is obtained; Obtaining a mining plan for the metal mine based on the optimal mining sequence of the metal mine blocks and the centroid data of the three-dimensional model; According to the basic data of ore mining, the net present value objective function of metal mines is constructed to meet the following formula: in, represents the net present value objective function value of the metal mine, represents the discount rate, Indicates the maximum service life of the mine, Indicates the mining time year, Indicates The total amount of ore mined each year, It represents the mineral processing recovery rate, Indicates Annual ore price, represents the unit mining cost, is the comprehensive processing cost, Indicates Annual rock stripping volume, To strip unit costs; The improved ant colony algorithm includes improving the pheromone update mechanism of the ant colony algorithm. The improved pheromone update mechanism satisfies the following formula: in, represents the concentration of pheromones released by ants from point i to point j at the next moment, represents the maximum pheromone concentration released by ants from point i to point j, and when point i to point j is the optimal path, , otherwise 0, represents the pheromone concentration of the optimal path, represents the optimal path length of the ant. represents the minimum pheromone concentration released by ants from point i to point j, and when point i to point j is the worst path, , otherwise 0, represents the pheromone concentration with the worst path, represents the worst path length that ants have walked, and ants represent the parameter combination formed by the mining sequence of metal mine blocks. represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the number of ants, Indicates The concentration of pheromone released by an ant from point i to point j at time k is: represents the pheromone volatility coefficient; The improved ant colony algorithm further includes improving the iterative convergence condition, and the improved iterative convergence condition satisfies the following formula: in, represents the concentration of pheromones released by ants from point i to point j at the current moment, represents the maximum pheromone concentration, represents the minimum pheromone concentration; The improved ant colony algorithm further includes introducing a direction guidance operator to improve the ant path selection probability, wherein the introduction of the direction guidance operator to improve the ant path selection probability satisfies the following formula: in, represents the direction guiding operator, represents the probability that ant n moves from location i to the next location j at time k, Indicated in The concentration of pheromones released by ants from point i to point j at time, represents the information heuristic factor, represents the expected heuristic factor, represents the heuristic value from location i to location j, which is the reciprocal of the Euclidean distance from location j to the end point, x represents any location, and U represents the set of locations that ant n has not visited.
2. The intelligent editing method for large-scale metal mine stripping planning according to claim 1 is characterized in that: The basic data of ore mining include ore grade, ore reserves, mining depletion rate, mining loss rate, mineral processing recovery rate, ore density, unit cost of mining and stripping, unit price of ore, geological data of the mining area and properties of the mine blocks.
3. The intelligent editing method for large-scale metal mine stripping planning according to claim 1 is characterized in that: According to the basic data of ore mining, a metal mine mining constraint model is constructed to meet the following formula: in, Indicates the maximum service life of the mine, Indicates the minimum service life of the mine, Indicates the upper limit of the mine service life, represents the minimum annual mining volume of ore, Indicates the maximum annual mining volume of ore, Indicates The total amount of ore mined each year, Indicates the annual maximum stripping volume, Indicates Annual rock stripping volume, Indicates the mining time year, Indicates the annual production capacity of the mine.
4. The intelligent editing method for large-scale metal mine stripping planning according to claim 1 is characterized in that: The method of obtaining incremental ore and rock volume data by using the centroid data of the three-dimensional model comprises the following steps: Taking the mass center of the metal mine block as the cone top, forming a cone shell from the cone top according to the working slope angle, constructing the cone with all the metal mine blocks contained in the shell, and listing the effective cone into the cone series; In the cone series, the metal mine blocks contained in the effective cone are numbered to obtain a first numbering sequence; Arrange the cones in the cone series in ascending order according to the metal content, and add up the weights of the metal mine blocks in the first numbering order so that the sum of the block weights is approximately equal to 0.1 times the periodic stripping volume to obtain an incremental body; The incremental bodies are numbered in reverse order to obtain the incremental body ore and rock quantity data.
5. The intelligent editing method for large-scale metal mine stripping planning according to claim 1 is characterized in that: The method of obtaining a metal mine stripping plan based on the optimal mining sequence of the metal mine block and the centroid data of the three-dimensional model includes the following steps: Combining the centroid data of the three-dimensional model with the optimal mining sequence of the metal mine block, obtaining a centroid database of the optimal mining sequence; Determine the row and column names of the mining schedule according to the optimal mining sequence centroid database; According to the optimal mining sequence centroid database, the mining amount of each type of ore at each step height and the total amount of ore mining at each mining time are obtained; According to the optimal mining sequence centroid database, the total amount of each type of ore mined at each mining time is obtained; Obtaining a stripping ratio according to the optimal mining sequence centroid database; The mining schedule of the metal mine is obtained by combining the mining volume of various types of ores at the same step height and the total amount of ore mined at each mining time, the total amount of various types of ores mined at the same mining time and the stripping ratio.
6. An intelligent editing system for large-scale metal mine stripping planning, characterized in that: The intelligent editing system for large-scale metal mine stripping planning includes: an input device, an output device, a processor, and a memory. The input device, output device, processor, and memory are interconnected. The memory includes program instructions, and the program instructions are used to execute the intelligent editing method for large-scale metal mine stripping planning as described in any one of claims 1-5.
