PIT LIMIT OPTIMISATION USING MARKOV CHAINS

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.; SHAHRIAR K.; ATAEIPOUR M.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2006 | Volume:17 | Issue:3 Page(s): 23-30

Download Full-Text

Persian Verion

View:

1,137

Download:

Cites:

Information Journal Paper

Title

PIT LIMIT OPTIMISATION USING MARKOV CHAINS

Author(s)

JALALI S.M.E. | SHAHRIAR K. | ATAEIPOUR M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

So far a large number of algorithms have been developed for optimisation of ultimate pit limits, most of which follow deterministic rules. In this paper a new algorithm is introduced, which follows a probabilistic logic using Markov chains. The algorithm is implemented on a transition matrix that correspond the 2D conventional economic block model of the orebody. Probability of mining a block is proportional to the profit it may produce. Applying this algorithm, probability of mining each block is obtained and finally the optimum pit is defined as the pit, which provides with the highest probability of mining. A 2D analysis of the problem is discussed in this paper; however, it is not difficult to expand the problem to 3D cases.

Cites

No record.

References

No record.

Cite

APA: Copy

JALALI, S.M.E., SHAHRIAR, K., & ATAEIPOUR, M.. (2006). PIT LIMIT OPTIMISATION USING MARKOV CHAINS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 17(3), 23-30. SID. https://sid.ir/paper/65753/en

Vancouver: Copy

JALALI S.M.E., SHAHRIAR K., ATAEIPOUR M.. PIT LIMIT OPTIMISATION USING MARKOV CHAINS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2006;17(3):23-30. Available from: https://sid.ir/paper/65753/en

IEEE: Copy

S.M.E. JALALI, K. SHAHRIAR, and M. ATAEIPOUR, “PIT LIMIT OPTIMISATION USING MARKOV CHAINS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 17, no. 3, pp. 23–30, 2006, [Online]. Available: https://sid.ir/paper/65753/en

Related Journal Papers