Stope Boundary Optimization using Discrete Imperialist Competitive 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.

Hemasian Etefagh Amir Arsalan; Khademi Hamidi Jafar; Mousavi Amin

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

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF MINING ENGINEERING (IRJME) Year:2024 | Volume:19 | Issue:63 Page(s): 95-116

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Stope Boundary Optimization using Discrete Imperialist Competitive Algorithm

Author(s)

Hemasian Etefagh Amir Arsalan | Khademi Hamidi Jafar | Mousavi Amin | Issue Writer Certificate

Keywords

Stope boundary optimization

Optimization algorithm

Metaheuristic algorithm

Abstract

Determination of stope boundary is a critical step in underground mine design, directly impacting project profitability and operational plans. Developing efficient and accurate algorithms for solving the Stope boundary optimization (SBO) problem has been a challenging task. In this study, a metaheuristic Discrete Imperialist Competitive Algorithm (DICA) was introduced for the SBO problem. The DICA algorithm, following a simulation-based approach, provides initial solutions in the search space and identifies the optimal solution after evaluating each one. Tested with different operators such as assimilation and revolution, and various initial populations, the suggested algorithm was applied to a 5*5*5 m block model of a copper deposit comprising 15,945 blocks. The results demonstrated the algorithm’s capability to determine stope boundaries within a reasonable computational time. For validity check, the results were compared with those obtained from the Maximum Value Neighborhood (MVN) and floating stope algorithms. The comparison revealed that DICA outperformed both algorithms.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans