OPTIMIZATION OF STOPE BOUNDARIES USING GREEDY 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.; HOSEINIE S.H.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF MINING ENGINEERING (IRJME) Year:2009 | Volume:4 | Issue:7 Page(s): 1-11

Download Full-Text

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

Persian Verion

View:

2,095

Download:

Cites:

Information Journal Paper

Title

OPTIMIZATION OF STOPE BOUNDARIES USING GREEDY ALGORITHM

Author(s)

JALALI S.M.E. | HOSEINIE S.H. | Issue Writer Certificate

Keywords

UNDERGROUND MININGQ3

STOPEQ3

OPTIMIZATIONQ2

GREEDY ALGORITHMQ3

DIJIKSTRA APPROACHQ3

Abstract

Optimization of STOPE boundaries has received less attention than that in open pit mines. However, few algorithms are available for OPTIMIZATION of STOPE boundaries, which are either tailored for a specific mining method or lack some significant geometrical and technical constraints. A GREEDY ALGORITHM is described in this paper for OPTIMIZATION of STOPE boundaries in each level of an underground mine. The algorithm employs a graph of the 2D economic block model in which weight of edges indicate cumulative economic values of blocks. The proposed algorithm enjoys DIJIKSTRA APPROACH to find the maximum path length on the graph. Dijikstra method is one of the best methods for solving the GREEDY ALGORITHMs. Indeed, the path which is searched in model of mining area using this algorithm, defines limits of the optimized STOPEs which provide the highest economic value.

Cites

No record.

References

No record.

Cite

APA: Copy

JALALI, S.M.E., & HOSEINIE, S.H.. (2009). OPTIMIZATION OF STOPE BOUNDARIES USING GREEDY ALGORITHM. IRANIAN JOURNAL OF MINING ENGINEERING (IRJME), 4(7), 1-11. SID. https://sid.ir/paper/117044/en

Vancouver: Copy

JALALI S.M.E., HOSEINIE S.H.. OPTIMIZATION OF STOPE BOUNDARIES USING GREEDY ALGORITHM. IRANIAN JOURNAL OF MINING ENGINEERING (IRJME)[Internet]. 2009;4(7):1-11. Available from: https://sid.ir/paper/117044/en

IEEE: Copy

S.M.E. JALALI, and S.H. HOSEINIE, “OPTIMIZATION OF STOPE BOUNDARIES USING GREEDY ALGORITHM,” IRANIAN JOURNAL OF MINING ENGINEERING (IRJME), vol. 4, no. 7, pp. 1–11, 2009, [Online]. Available: https://sid.ir/paper/117044/en

Related Journal Papers