Stope mining design is a very important and complicated task in daily production design and technical management of an underground mine.Based on workface technology and human-computer interaction technology,this study...Stope mining design is a very important and complicated task in daily production design and technical management of an underground mine.Based on workface technology and human-computer interaction technology,this study introduces a method of 3D parametric design for the irregular structure of stope bottoms,and focuses on solving technical problems in surface modeling of stope bottom structure.Optimization of the minimum span length algorithm(MSLA) and the shortest path search algorithm(SPSA) is conducted to solve the problem of contour-line based instant modeling of stope bottom structures,which makes possible the 3D parametric design for irregular structure of stope bottom.Implementation process and relevant methods of the proposed algorithms are also presented.Feasibility and reliability of the proposed modeling method are testified in a case study.In practice,the proposed 3 D parameterization design method for irregular structure stope bottom proves to be very helpful to precise 3D parametric design.This method is capable of contributing to improved efficiency and precision of stope design,and is worthy of promotion.展开更多
Two dimensional irregular polygons packing problem is very difficult to be solved in traditional optimal way.Simulated annealing(SA)algorithm is a stochastic optimization technique that can be used to solve packing pr...Two dimensional irregular polygons packing problem is very difficult to be solved in traditional optimal way.Simulated annealing(SA)algorithm is a stochastic optimization technique that can be used to solve packing problems.The whole process of SA is introduced firstly in this paper. An extended neighborhood searching method in SA is mainly analyzed. A general module of SA algorithm is given and used to lay out the irregular polygons. The judgment of intersection and other constrains of irregular polygons are analyzed. Then an example that was used in the paper of Stefan Jakobs is listed.Results show that this SA algorithm shortens the computation time and improves the solution.展开更多
基金Supported by the National High Technology Research and Development Programme of China(No.2011AA060407)Yunnan Province Science and Technology Innovation Platform Construction Plans,China(No.2010DH005)
文摘Stope mining design is a very important and complicated task in daily production design and technical management of an underground mine.Based on workface technology and human-computer interaction technology,this study introduces a method of 3D parametric design for the irregular structure of stope bottoms,and focuses on solving technical problems in surface modeling of stope bottom structure.Optimization of the minimum span length algorithm(MSLA) and the shortest path search algorithm(SPSA) is conducted to solve the problem of contour-line based instant modeling of stope bottom structures,which makes possible the 3D parametric design for irregular structure of stope bottom.Implementation process and relevant methods of the proposed algorithms are also presented.Feasibility and reliability of the proposed modeling method are testified in a case study.In practice,the proposed 3 D parameterization design method for irregular structure stope bottom proves to be very helpful to precise 3D parametric design.This method is capable of contributing to improved efficiency and precision of stope design,and is worthy of promotion.
文摘Two dimensional irregular polygons packing problem is very difficult to be solved in traditional optimal way.Simulated annealing(SA)algorithm is a stochastic optimization technique that can be used to solve packing problems.The whole process of SA is introduced firstly in this paper. An extended neighborhood searching method in SA is mainly analyzed. A general module of SA algorithm is given and used to lay out the irregular polygons. The judgment of intersection and other constrains of irregular polygons are analyzed. Then an example that was used in the paper of Stefan Jakobs is listed.Results show that this SA algorithm shortens the computation time and improves the solution.
