The pit limit optimization is discussed, which is one of the most important problems in the combined min-ing method, on the basis of the economic model of ore-blocks. A new principle of the limit optimization is put f...The pit limit optimization is discussed, which is one of the most important problems in the combined min-ing method, on the basis of the economic model of ore-blocks. A new principle of the limit optimization is put for-ward through analyzing the limitations of moving cone method under such conditions. With a view to recovering asmuch mineral resource as possible and making the maximum profit from the whole deposit, the new principle is tomaximize the sum of gain from both open-pit and underground mining. The mathematical models along the horizon-tal and vertical directions and modules for software package (DM&MCAD) have been developed and tested inTonglushan Copper Mine. It has been proved to be rather effective in the mining practice.展开更多
In this research, we introduce a new heuristic approach using the concept of ant colony optimization （ACO） to extract patterns from the chromosomes generated by previous generations for solving the generalized trave...In this research, we introduce a new heuristic approach using the concept of ant colony optimization （ACO） to extract patterns from the chromosomes generated by previous generations for solving the generalized traveling salesman problem. The proposed heuristic is composed of two phases. In the first phase the ACO technique is adopted to establish an archive consisting of a set of non-overlapping blocks and of a set of remaining cities （nodes） to be visited. The second phase is a block recombination phase where the set of blocks and the rest of cities are combined to form an artificial chromosome. The generated artificial chromosomes （ACs） will then be injected into a standard genetic algorithm （SGA） to speed up the convergence. The proposed method is called ＂Puzzle-Based Genetic Algorithm＂ or ＂p-ACGA＂. We demonstrate that p-ACGA performs very well on all TSPLIB problems, which have been solved to optimality by other researchers. The proposed approach can prevent the early convergence of the genetic algorithm （GA） and lead the algorithm to explore and exploit the search space by taking advantage of the artificial chromosomes.展开更多
The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted i...The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.展开更多
基金Project (59704004) supported by the National Natural Science Foundation of ChinaProject (2000) supported by Foundation for University Key Teacher by the Ministry of Education
文摘The pit limit optimization is discussed, which is one of the most important problems in the combined min-ing method, on the basis of the economic model of ore-blocks. A new principle of the limit optimization is put for-ward through analyzing the limitations of moving cone method under such conditions. With a view to recovering asmuch mineral resource as possible and making the maximum profit from the whole deposit, the new principle is tomaximize the sum of gain from both open-pit and underground mining. The mathematical models along the horizon-tal and vertical directions and modules for software package (DM&MCAD) have been developed and tested inTonglushan Copper Mine. It has been proved to be rather effective in the mining practice.
文摘In this research, we introduce a new heuristic approach using the concept of ant colony optimization （ACO） to extract patterns from the chromosomes generated by previous generations for solving the generalized traveling salesman problem. The proposed heuristic is composed of two phases. In the first phase the ACO technique is adopted to establish an archive consisting of a set of non-overlapping blocks and of a set of remaining cities （nodes） to be visited. The second phase is a block recombination phase where the set of blocks and the rest of cities are combined to form an artificial chromosome. The generated artificial chromosomes （ACs） will then be injected into a standard genetic algorithm （SGA） to speed up the convergence. The proposed method is called ＂Puzzle-Based Genetic Algorithm＂ or ＂p-ACGA＂. We demonstrate that p-ACGA performs very well on all TSPLIB problems, which have been solved to optimality by other researchers. The proposed approach can prevent the early convergence of the genetic algorithm （GA） and lead the algorithm to explore and exploit the search space by taking advantage of the artificial chromosomes.
基金Project(2011AA060407) supported by the National High Technology Research and Development Program of ChinaProject(51074073) supported by the National Natural Science Foundation of China
文摘The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.
