STOPE BOUNDARIES OPTIMISATION USING A 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.M.E.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2005 | Volume:16 | Issue:62-C Page(s): 37-48

Download Full-Text

Persian Verion

View:

2,067

Download:

Cites:

Information Journal Paper

Title

STOPE BOUNDARIES OPTIMISATION USING A DYNAMIC PROGRAMMING ALGORITHM

Author(s)

JALALI S.M.E. | Issue Writer Certificate

Keywords

UNDERGROUND MININGQ4

STOPE BOUNDARIESQ4

OPTIMISATIONQ2

DYNAMIC PROGRAMMINGQ4

Abstract

A large number of algorithms have been developed for optimization of mining limits in open pit boundaries, however, little amount of research is available for underground cases. This is mostly due to variability of the UNDERGROUND MINING methods, complexity of economic factors in underground mines and lack of acceptability of computer algorithms among the underground mine design practitioners. This paper presents a new algorithm to optimize ultimate stope geometry, using the DYNAMIC PROGRAMMING technique. The algorithm employs a conventional 20 economic block model, called the "primary model". The minimum stope height and length are imposed to the primary to construct intermediate and final models. The DYNAMIC PROGRAMMING algorithm is then applied on the final model to maximize the stope total net value. The task is performed through a recursive formula, which consists of two criteria. The proposed DYNAMIC PROGRAMMING algorithm is best suited for vein type orebodies using any type of UNDERGROUND MINING methods.

Cites

No record.

References

No record.

Cite

APA: Copy

JALALI, S.M.E.,. (2005). STOPE BOUNDARIES OPTIMISATION USING A DYNAMIC PROGRAMMING ALGORITHM. AMIRKABIR, 16(62-C), 37-48. SID. https://sid.ir/paper/937/en

Vancouver: Copy

JALALI S.M.E.. STOPE BOUNDARIES OPTIMISATION USING A DYNAMIC PROGRAMMING ALGORITHM. AMIRKABIR[Internet]. 2005;16(62-C):37-48. Available from: https://sid.ir/paper/937/en

IEEE: Copy

S.M.E. JALALI, an, “STOPE BOUNDARIES OPTIMISATION USING A DYNAMIC PROGRAMMING ALGORITHM,” AMIRKABIR, vol. 16, no. 62-C, pp. 37–48, 2005, [Online]. Available: https://sid.ir/paper/937/en

Related Journal Papers