FINDING AND SORTING THE THREE-DIMENSIONAL PUSH BACK EXTRACTION SCENARIOS FROM MAXIMUM TO MINIMUM NET PRESENT VALUE BY INTEGER PROGRAMMING IN OPEN PIT MINING

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.

ESFANDIARI B.; ABRISHAMIFAR S.A.; GOSHTASBI K.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH) Year:2004 | Volume:15 | Issue:2 Page(s): 107-118

Download Full-Text

Persian Verion

View:

1,290

Download:

Cites:

Information Journal Paper

Title

FINDING AND SORTING THE THREE-DIMENSIONAL PUSH BACK EXTRACTION SCENARIOS FROM MAXIMUM TO MINIMUM NET PRESENT VALUE BY INTEGER PROGRAMMING IN OPEN PIT MINING

Author(s)

ESFANDIARI B. | ABRISHAMIFAR S.A. | GOSHTASBI K. | Issue Writer Certificate

Keywords

THREE-DIMENSIONAL PUSH BACKSQ4

MINING SCENARIOSQ4

OPTIMIZED NET PRESENT VALUEQ4

INTEGER PROGRAMMINGQ4

OPEN PIT MININGQ4

BLOCK SEQUENCEQ4

Abstract

Economical forecasting in mining field and mathematical expectation of probability of reaching production goals has a high degree of uncertainty. Economical concepts have the imperative to develop mine scheduling. They are robust under some economical scenarios. The scenarios of blocks exploitation have the net present value that it is corresponding to the "way" and order in which the "block" is removed. There are infinite numbers of possible scenarios and each scenario has its own net present value. The "best" scenario is defined as a scenario having the maximum net present value, and the "worst" scenario has the minimum value. In real and actual cases, mine designers and decision makers sometimes need to change the exploitation scenario for an incremental pit because of prevailing conditions, which are effective and important factors in mining. Such effective factors as slope failures, presence of faults, joints, subsidence, and existence of mine water must be considered. This paper explains how the "next" scenario, between the best and the worst, can be chosen for an incremental pit to attain possible maximum net present value by using INTEGER PROGRAMMING in a three-dimensional case.

Cites

No record.

References

No record.

Cite

APA: Copy

ESFANDIARI, B., ABRISHAMIFAR, S.A., & GOSHTASBI, K.. (2004). FINDING AND SORTING THE THREE-DIMENSIONAL PUSH BACK EXTRACTION SCENARIOS FROM MAXIMUM TO MINIMUM NET PRESENT VALUE BY INTEGER PROGRAMMING IN OPEN PIT MINING. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), 15(2), 107-118. SID. https://sid.ir/paper/52598/en

Vancouver: Copy

ESFANDIARI B., ABRISHAMIFAR S.A., GOSHTASBI K.. FINDING AND SORTING THE THREE-DIMENSIONAL PUSH BACK EXTRACTION SCENARIOS FROM MAXIMUM TO MINIMUM NET PRESENT VALUE BY INTEGER PROGRAMMING IN OPEN PIT MINING. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH)[Internet]. 2004;15(2):107-118. Available from: https://sid.ir/paper/52598/en

IEEE: Copy

B. ESFANDIARI, S.A. ABRISHAMIFAR, and K. GOSHTASBI, “FINDING AND SORTING THE THREE-DIMENSIONAL PUSH BACK EXTRACTION SCENARIOS FROM MAXIMUM TO MINIMUM NET PRESENT VALUE BY INTEGER PROGRAMMING IN OPEN PIT MINING,” INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), vol. 15, no. 2, pp. 107–118, 2004, [Online]. Available: https://sid.ir/paper/52598/en

Related Journal Papers