gscienceMining Science and Technology (Russia)Горные науки и технологии2500-0632The National University of Science and Technology MISiIS (NUST MISIS)10.17073/2500-0632-2023-09-156gscience-760Research ArticleMINERAL RESOURCES EXPLOITATIONРАЗРАБОТКА МЕСТОРОЖДЕНИЙ ПОЛЕЗНЫХ ИСКОПАЕМЫХEnhancing the performance of integer models for addressing the long-term production planning problem in open pit mines by decision variable fixation based on parametric analysis of the final pit limitПовышение эффективности целочисленных моделей для решения задачи долгосрочного планирования добычи на открытых горных работах путем установления переменных решений на основе параметрического анализа конечного контура карьераhttps://orcid.org/0000-0002-2710-9562ХасоздемирК.HasozdemirK.

Курсат Хасоздемир – аспирант, cтажер-исследователь, факультет горного дела

г. Стамбул

Kursat Hasozdemir – PhD-Student, Research Assistant, Mining Engineering Department

Istanbul

hasozdemir@itu.edu.trhttps://orcid.org/0000-0001-8744-885XЭрчелебиС. Г.ErçelebiS. G.

Селамет Гюрбюз Эрчелеби – доктор наук, профессор, факультет горного дела

г. Стамбул

Selamet Gürbüz Erçelebi – Dr. Sci., Professor, Mining Engineering Department

Istanbul

ercelebi@itu.edu.trСтамбульский технический университетТурцияIstanbul Technical UniversityTurkey20240108202492Online First7484Copyright © Hasozdemir K., Erçelebi S., 20232023Хасоздемир К., Эрчелеби С.Hasozdemir K., Erçelebi S.This work is licensed under a Creative Commons Attribution 4.0 License.https://mst.misis.ru/jour/article/view/760

The importance of strategic mine planning to ensure the long-term viability of mining projects has increased significantly because of the limited availability of high-grade ore deposits. Given its high-dimensional and combinatorial nature, developing a precise mathematical optimization technique to solve the entire problem remains challenging, particularly for real-size block models. The primary objective of this study was to propose a method that combines a nested pit strategy with integer programming (IP) models to overcome computational limitations by reducing the problem’s complexity, decreasing solution times, and providing insights into alternative production schedules for large-scale open-pit mines. The proposed algorithm strategically fixes the decision variables based on parametric analysis of the ultimate pit limit to simplify the IP model. The approach was applied to various block models from MineLib, and the results were compared with standard IP solutions and findings from related studies using alternative algorithms. Applying the proposed method demonstrated significant reductions in the solution time (up to 95%) and the ability to solve intractable models.

Важность стратегического планирования горных работ для обеспечения долгосрочной жизнеспособности горных проектов значительно возросла из-за сокращения числа месторождений богатых руд. Учитывая его многомерную и комбинаторную природу, разработка точного метода математической оптимизации для решения всей задачи остается сложной проблемой, особенно для блочных моделей в натуральную величину. Основная цель данного исследования заключалась в том, чтобы предложить метод, сочетающий стратегию вложенных контуров карьера с моделями целочисленного программирования (ЦП / ЦЛП) для преодоления вычислительных ограничений за счет снижения сложности задачи, сокращения времени решения и предоставления информации об альтернативных графиках добычи для крупномасштабных открытых разработок. Предложенный алгоритм стратегически устанавливает переменные решения на основе параметрического анализа конечного (проектного) контура карьера для упрощения ЦП-модели. Этот подход был применен к различным блочным моделям из MineLib, а результаты были сопоставлены со стандартными ЦП-решениями и результатами соответствующих исследований с использованием альтернативных алгоритмов. Применение предложенного метода продемонстрировало существенное сокращение времени решения (на величину до 95 %) и возможность решения трудноразрешимых моделей.

открытые горные работыдолгосрочное планирование добычипланирование добычиоптимизацияцелочисленное программированиеустановка переменных решенияпсевдопотокopen-pit mininglong-term production schedulingproduction schedulingoptimizationinteger programmingfixing decision variablespseudoflowНастоящее исследование является составной частью кандидатской диссертации, посвященной теме долгосрочного планирования добычи на открытых горных работах. Финансовую поддержку этому исследованию оказал Отдел научно-исследовательских проектов Стамбульского технического университета.The present study is a component of a PhD dissertation focusing on the subject of long-term production planning in open-pit mines. Financial support for this research has been provided by the Scientific Research Projects Unit of Istanbul Technical University.ReferencesCaccetta L., Hill S. An application of branch and cut to open pit mine scheduling. Journal of Global Optimization. 2003;27:349–365. https://doi.org/10.1023/A:1024835022186Caccetta L., Hill S. An application of branch and cut to open pit mine scheduling. Journal of Global Optimization. 2003;27:349–365. https://doi.org/10.1023/A:1024835022186Lerchs H., Grossmann I. F. Optimum design of open-pit mines. Transactions, C.I.M. 1965;LXVIII:17–24.Lerchs H., Grossmann I. F. Optimum design of open-pit mines. Transactions, C.I.M. 1965;LXVIII:17–24.Dagdelen K., Johnson T. B. Optimum open-pit mine production scheduling by Lagrangian parameterization. In: Proceedings of the 19th APCOM. 1984;127–142.Dagdelen K., Johnson T. B. Optimum open-pit mine production scheduling by Lagrangian parameterization. In: Proceedings of the 19th APCOM. 1984;127–142.Elkington T., Durham R. Integrated open pit pushback selection and production capacity optimization. Journal of Mining Science. 2011;47:177–190. https://doi.org/10.1134/S1062739147020055Elkington T., Durham R. Integrated open pit pushback selection and production capacity optimization. Journal of Mining Science. 2011;47:177–190. https://doi.org/10.1134/S1062739147020055Kumral M. Production planning of mines: optimization of block sequencing and destination. International Journal of Mining, Reclamation, and Environment. 2012;26(2):93–103. https://doi.org/10.1080/17480930.2011.644474Kumral M. Production planning of mines: optimization of block sequencing and destination. International Journal of Mining, Reclamation, and Environment. 2012;26(2):93–103. https://doi.org/10.1080/17480930.2011.644474Jélvez E., Morales N., Askari-Nasab H. A new model for automated pushback selection. Computers & Operations Research. 2020;115:104456. https://doi.org/10.1016/j.cor.2018.04.015Jélvez E., Morales N., Askari-Nasab H. A new model for automated pushback selection. Computers & Operations Research. 2020;115:104456. https://doi.org/10.1016/j.cor.2018.04.015Tolwinski B., Underwood R. An algorithm to estimate the optimal evaluation of an open-pit mine. In: Proceedings of the 23rd International Symposium on the Application of Computers and Operations Research in the Mineral Industries. 1992;399–409.Tolwinski B., Underwood R. An algorithm to estimate the optimal evaluation of an open-pit mine. In: Proceedings of the 23rd International Symposium on the Application of Computers and Operations Research in the Mineral Industries. 1992;399–409.Picard J. C. Maximal closure of a graph and applications to combinatorial problems. Management Science. 1976;22(11):1268–1272. https://doi.org/10.1287/mnsc.22.11.1268Picard J. C. Maximal closure of a graph and applications to combinatorial problems. Management Science. 1976;22(11):1268–1272. https://doi.org/10.1287/mnsc.22.11.1268Tachefine B., Soumis F. Maximal closure on a graph with resource constraints. Computers & Operations Research. 1997;24(10):981–990. https://doi.org/10.1016/S0305-0548(97)00008-7Tachefine B., Soumis F. Maximal closure on a graph with resource constraints. Computers & Operations Research. 1997;24(10):981–990. https://doi.org/10.1016/S0305-0548(97)00008-7Chandran B. G., Hochbaum D. S. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations Research. 2009;57(2):358–376. https://doi.org/10.1287/opre.1080.0572Chandran B. G., Hochbaum D. S. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations Research. 2009;57(2):358–376. https://doi.org/10.1287/opre.1080.0572Hochbaum D. S. The pseudoflow algorithm: A new algorithm for the maximum-flow problem Operations Research. 2008;56(4):992–1009. https://doi.org/10.1287/opre.1080.0524Hochbaum D. S. The pseudoflow algorithm: A new algorithm for the maximum-flow problem Operations Research. 2008;56(4):992–1009. https://doi.org/10.1287/opre.1080.0524Hochbaum D. S., Chen A. Performance analysis and best implementations of old and new algorithms for the open- pit mining problem. Operations Research. 2000;48(6):894–914. https://doi.org/10.1287/opre.48.6.894.12392Hochbaum D. S., Chen A. Performance analysis and best implementations of old and new algorithms for the open- pit mining problem. Operations Research. 2000;48(6):894–914. https://doi.org/10.1287/opre.48.6.894.12392Muoz G., Espinoza D., Goycoolea M. et al. A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource-constrained project scheduling. Computational Optimization and Applications. 2018;69(2):501–534. https://doi.org/10.1007/s10589-017-9946-1Muoz G., Espinoza D., Goycoolea M. et al. A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource-constrained project scheduling. Computational Optimization and Applications. 2018;69(2):501–534. https://doi.org/10.1007/s10589-017-9946-1Paithankar A., Chatterjee S. Open-pit mine production schedule optimization using a hybrid of maximum-flow and genetic algorithms. Applied Soft Computing. 2019;81:105507. https://doi.org/10.1016/j.asoc.2019.105507Paithankar A., Chatterjee S. Open-pit mine production schedule optimization using a hybrid of maximum-flow and genetic algorithms. Applied Soft Computing. 2019;81:105507. https://doi.org/10.1016/j.asoc.2019.105507Ramazan S., Dimitrakopoulos R. Stochastic optimisation of long-term production scheduling for open pit mines with a new integer programming formulation. İn: Dimitrakopoulos R. (ed.) Advances in Applied Strategic Mine Planning. Springer, Cham; 2018. Pp. 139–153. https://doi.org/10.1007/978-3-319-69320-0_11Ramazan S., Dimitrakopoulos R. Stochastic optimisation of long-term production scheduling for open pit mines with a new integer programming formulation. İn: Dimitrakopoulos R. (ed.) Advances in Applied Strategic Mine Planning. Springer, Cham; 2018. Pp. 139–153. https://doi.org/10.1007/978-3-319-69320-0_11Montiel L., Dimitrakopoulos R. Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach. European Journal of Operational Research. 2015;247(1):166–178. https://doi.org/10.1016/j.ejor.2015.05.002Montiel L., Dimitrakopoulos R. Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach. European Journal of Operational Research. 2015;247(1):166–178. https://doi.org/10.1016/j.ejor.2015.05.002Alipour A., Khodaiari A. A., Jafari A., Tavakkoli-Moghaddam R. Production scheduling of open-pit mines using genetic algorithms: a case study. International Journal of Management Science and Engineering Management. 2020;15(3):176–183. https://doi.org/10.1080/17509653.2019.1683090Alipour A., Khodaiari A. A., Jafari A., Tavakkoli-Moghaddam R. Production scheduling of open-pit mines using genetic algorithms: a case study. International Journal of Management Science and Engineering Management. 2020;15(3):176–183. https://doi.org/10.1080/17509653.2019.1683090Elsayed S., Sarker R., Essam D., Coello C. C. Evolutionary approach for large-scale mine scheduling. Information Sciences. 2020;523:77–90. https://doi.org/10.1016/j.ins.2020.02.074Elsayed S., Sarker R., Essam D., Coello C. C. Evolutionary approach for large-scale mine scheduling. Information Sciences. 2020;523:77–90. https://doi.org/10.1016/j.ins.2020.02.074Senécal R., Dimitrakopoulos R. Long-term mine production scheduling with multiple processing destinations under mineral supply uncertainty, based on a multi-neighborhood Tabu search. International Journal of Mining, Reclamation, and Environment. 2020;34(7):459–475. https://doi.org/10.1080/17480930.2019.1595902Senécal R., Dimitrakopoulos R. Long-term mine production scheduling with multiple processing destinations under mineral supply uncertainty, based on a multi-neighborhood Tabu search. International Journal of Mining, Reclamation, and Environment. 2020;34(7):459–475. https://doi.org/10.1080/17480930.2019.1595902Tolouei K., Moosavi E., Tabrizi A. H. B. et al. Improving performance of open-pit mine production scheduling problems under grade uncertainty by hybrid algorithms. Journal of Central South University. 2020;27(9):2479–2493. https://doi.org/10.1007/s11771-020-4474-zTolouei K., Moosavi E., Tabrizi A. H. B. et al. Improving performance of open-pit mine production scheduling problems under grade uncertainty by hybrid algorithms. Journal of Central South University. 2020;27(9):2479–2493. https://doi.org/10.1007/s11771-020-4474-zBienstock D., Zuckerberg M. Solving L. P. relaxations of large-scale precedence constrained problems. In: Eisenbrand F., Shepherd F. B. (eds.) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science. Vol. 6080. Springer, Berlin, Heidelberg; 2010. https://doi.org/10.1007/978-3-642-13036-6_1Bienstock D., Zuckerberg M. Solving L. P. relaxations of large-scale precedence constrained problems. In: Eisenbrand F., Shepherd F. B. (eds.) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science. Vol. 6080. Springer, Berlin, Heidelberg; 2010. https://doi.org/10.1007/978-3-642-13036-6_1Espinoza D., Goycoolea M., Moreno E., Newman A. N. MineLib: a library of open pit problems. Annals of Operations Research. 2013;206:93–114. https://doi.org/10.1007/s10479-012-1258-3Espinoza D., Goycoolea M., Moreno E., Newman A. N. MineLib: a library of open pit problems. Annals of Operations Research. 2013;206:93–114. https://doi.org/10.1007/s10479-012-1258-3

The authors declare that there are no conflicts of interest present.