首页 | 本学科首页   官方微博 | 高级检索  
     


A mathematical programming viewpoint for solving the ultimate pit problem
Affiliation:1. Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401-1887, USA;2. Operations Research Experts, Golden, CO, USA;1. Faculty of Engineering, Tarbiat Modares University, Tehran, Iran;2. W.H. Bryan Geology and Mining Research Centre, Sustainable Minerals Institute, University of Queensland, 4068, Australia;1. Department of Mathematics and Operational Research, Faculté Polytechnique, Université de Mons, Rue de Houdain 9, 7000 Mons, Belgium;2. Université catholique de Louvain, CORE and ICTEAM Institute, B-1348 Louvain-la-Neuve, Belgium;1. Vale Ltd., New Caledonia;2. COSMO-Stochastic Mine Planning Laboratory, Department of Mining and Materials Engineering, McGill University, Montreal, Canada;1. MathWorks Consulting Services, Germany;2. ISyE, Georgia Institute of Technology, Atlanta, USA
Abstract:In 1965 Helmut Lerchs and Ingo Grossmann presented to the mining community an algorithm to find the optimum design for an open pit mine. In their words, “the objective is to design the contour of a pit so as to maximize the difference between total mine value of the ore extracted and the total extraction cost of ore and waste”. They modeled the problem in graph theoretic terms and showed that an optimal solution of the ultimate pit problem is equivalent to finding the maximum closure of their graph based model. In this paper, we develop a network flow algorithm based on the dual to solve the same problem. We show how this algorithm is closely related to Lerchs and Grossmann's and how the steps in their algorithm can be viewed in mathematical programming terms. This analysis adds insight to the algorithm of Lerchs and Grossmann and shows where it can be made more efficient. As in the case Lerchs and Grossmann, our algorithm allows us to use very efficient data structures based on graphs that represent the data and constraints.. 1782 1528 V 3
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号