Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Title: 

PIT LIMIT OPTIMISATION FOR SLOPES LESS THAN 1:1 USING DYNAMIC PROGRAMMING ALGORITHM

Type: PAPER
Author(s): JALALI S.E.*,ATAEIPOUR M.
 
 *NO. 53, 8TH ST., GHASIR (BUKHAREST) AVE., ARGENTIN SQ., TEHRAN, IRAN
 
Name of Seminar: PROCEEDING OF IRANIAN MINING ENGINEERING CONFERENCE
Type of Seminar:  CONFERENCE
Sponsor:  IRANIAN SOCIETY OF MINING ENGINEERING
Date:  2005Volume 1
 
 
Abstract: 

The Dynamic Programming (DP) algorithm is a rigorous technique, developed for optimisation of open pit limits. This algorithm guarantees the true optimum solutions in 2D sections, but is may be used only for pit slope constraints of 1:1, 2:1 or more. In circumstances, where the geomechanical conditions impose less slopes such as 1:2, an adjustment of the block sizes and reconstruction of the block model is needed. A new DP algorithm is introduced in this paper to overcome this shortcoming. The conventional block model is transformed into an intermediate and a final block model to reflect the pit slope constraints. Then the modified DP algorithm consisting of a recursive formula with two criteria is implemented on the final model. Using this algorithm, there is no need for reconstruction of the block model.

 
Keyword(s): OPEN PIT, OPTIMISATION, ULTIMATE PIT LIMIT, PIT SLOPE
 
Yearly Visit 47   tarjomyar
 
Latest on Blog
Enter SID Blog