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.
|
Cite:
APA: Copy
JALALI, S., & 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. https://www.sid.ir/en/journal/ViewPaper.aspx?id=104315
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). 2006 [cited 2021April12];17(3):23-30. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=104315
IEEE: Copy
JALALI, S., 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), [online] 17(3), pp.23-30. Available at: <https://www.sid.ir/en/journal/ViewPaper.aspx?id=104315>.
|