Open pit limit optimization using dijkstra’s algorithm

Authors

  • Mehdi Najafi Department of Mining and Metallurgical Eng., Yazd University, Yazd, Iran
  • Ramin Rafiee Faculty of Mining Engineering, Petroleum and Geophysics, Shahrood University of Technology, Iran
Abstract:

In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the pit limit, which influences the stripping ratio, damp locations, ore processing site and access routes, should be designed. So far, a large number of algorithms have been developed to optimize the pit limits. These algorithms are categorized into two groups: heuristic and rigorous. In this paper, a new approach is presented to optimize the pit limit based on Dijkstra’s algorithm which is based on mathematical relations. This algorithm was implemented on a 2D economic graph model and can find the true optimal solution. The results were compared with those from the dynamic programming (DP) algorithm. This algorithm showed to have less time complexity compared to the dynamic programming algorithm and to be easier to write dynamic computer programs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

On The Optimization of Dijkstras Algorithm

In this paper, we propose some amendment on Dijkstra’s algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra’s algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra’s algorithm is less than the ...

full text

A genetic algorithm approach for open-pit mine production scheduling

In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...

full text

Comparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl

Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra’s algorithm is compared on dense gra...

full text

Mathematical Optimization Models and Methods for Open-Pit Mining

Amankwah, H. (2011). Mathematical Optimization Models and Methods for Open-Pit Mining. Doctoral dissertation. ISBN 978-91-7393-073-4. ISSN 0345-7524. Open-pit mining is an operation in which blocks from the ground are dug to extract the ore contained in them, and in this process a deeper and deeper pit is formed until the mining operation ends. Mining is often a highly complex industrial operat...

full text

A new algorithm for the open-pit mine scheduling problem

For the purpose of production scheduling, open pit mines are discretized into threedimensional arrays known as block models. Production scheduling consists in deciding which blocks should be extracted, when they should be extracted and how each extracted block should be processed. Blocks which are on top should be extracted first, and capacity constraints limit the production each time period. ...

full text

A new algorithm for optimum open pit design: Floating cone method III

Ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. A number of algorithms such as floating or moving cone method, floating cone method II and the corrected forms of this method, the Korobov algorithm and the corrected form of this method, dynamic programming and the Lerchs and Grossmann algorithm based on grap...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 54  issue 1

pages  39- 43

publication date 2020-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023