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

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JALALI S.E.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: PROCEEDING OF IRANIAN MINING ENGINEERING CONFERENCE
Year:2005 | Issue:1

Download Full-Text

View:

157

Download:

Information Seminar Paper

Title

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

Author(s)

JALALI S.E.

Keywords

OPEN PIT

OPTIMISATION

ULTIMATE PIT LIMIT

PIT SLOPE

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

JALALI, S.E.,. (2005). PIT LIMIT OPTIMISATION FOR SLOPES LESS THAN 1:1 USING DYNAMIC PROGRAMMING ALGORITHM. PROCEEDING OF IRANIAN MINING ENGINEERING CONFERENC. SID. https://sid.ir/paper/902650/en

Vancouver: Copy

JALALI S.E.. PIT LIMIT OPTIMISATION FOR SLOPES LESS THAN 1:1 USING DYNAMIC PROGRAMMING ALGORITHM. 2005. Available from: https://sid.ir/paper/902650/en

IEEE: Copy

S.E. JALALI, an, “PIT LIMIT OPTIMISATION FOR SLOPES LESS THAN 1:1 USING DYNAMIC PROGRAMMING ALGORITHM,” presented at the PROCEEDING OF IRANIAN MINING ENGINEERING CONFERENC. 2005, [Online]. Available: https://sid.ir/paper/902650/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops