نشریه مهندسی معدن

نشریه مهندسی معدن

تعیین محدوده نهایی کارگاه استخراج زیرزمینی با استفاده از الگوریتم رقابت استعماری گسسته

نوع مقاله : علمی - پژوهشی

نویسندگان
1 دانشجوی دکتری، بخش مهندسی معدن، دانشکده فنی و مهندسی، دانشگاه تربیت مدرس، تهران
2 دانشیار، بخش مهندسی معدن، دانشکده فنی و مهندسی، دانشگاه تربیت مدرس، تهران،
3 استادیار، بخش مهندسی معدن، دانشکده فنی و مهندسی، دانشگاه تربیت مدرس، تهران
چکیده
تعیین محدوده نهایی کارگاه استخراج زیرزمینی، مرحله‌ای کلیدی در طراحی معادن زیرزمینی است که به طور مستقیم بر طرح‌های تولید عملیاتی تاثیر می‌گذارد. توسعه الگوریتم‌های کارآمد و دقیق برای بهینه‌سازی مساله تعیین محدوده نهایی کارگاه استخراج زیرزمینی (USBO)، چالش‌برانگیز است. در این مطالعه، الگوریتم فراابتکاری رقابت استعماری گسسته (DICA) برای تعیین محدوده نهایی کارگاه استخراج معدن زیرزمینی پیشنهاد شده است. الگوریتم DICA همانند نسخه استاندارد الگوریتم و با اعمال تغییراتی در روند اجرایی آن، از یک رویکرد مبتنی بر شبیه‌سازی در جهت تولید راه‌حل‌های اولیه در فضای جستجو اقدام می‌کند و سپس با ارزیابی هر یک از پاسخ‌ها، بهترین راه‌حل را انتخاب می‌کند. با تغییر عملگرها و بخش‌های وابسته به الگوریتم شامل ایجاد جمعیت اولیه، عملگرهای جذب و انقلاب، الگوریتم پیشنهادی توسعه و بر روی یک مدل بلوکی متشکل از 945/15 بلوک (ابعاد هر بلوک 5×5×5 متر) از یک مطالعه موردی کانسار مس در مقیاس کوچک اجرا شد. نتایج حاصل از الگوریتم پیشنهادی DICA نشان داد که این الگوریتم می‌تواند محدوده نهایی کارگاه استخراج زیرزمینی را در زمان قابل قبولی تعیین کند. همچنین این الگوریتم توانست محدوده نهایی تعیین شده را با ارزش اقتصادی بالاتری نسبت به الگوریتم‌های کارگاه شناور و با ارزش‌ترین همسایگی ارایه دهد.
کلیدواژه‌ها

موضوعات


عنوان مقاله English

Stope Boundary Optimization using Discrete Imperialist Competitive Algorithm

نویسندگان English

AmirArsalan Hemasian Etefagh 1
Jafar Khademi Hamidi 2
Amin alah Mousavi 3
1 Mining Engineering Department, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
2 Mining Engineering, Department, Faculty of Engineering, Tarbiat Modares University
3 Mining Engineering Department, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
چکیده English

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.

کلیدواژه‌ها English

Stope boundary optimization
Optimization algorithm
Metaheuristic algorithm
J. M. Riddle, 1977, "A dynamic programming solution of a block-caving mine layout," in Proceedings The 14th APCOM Symposium, Society of Mining Engineers-American Institute of Mining, Metallurgy, and Petroleum Engineers, New York, pp. 767-780.## J. Deraisme, C. De Fouquet, and H. Fraisse, 1984, "Geostatistical orebody model computer optimization of profits from different underground mining methods," in Application of Computers and Mathematics in the Minerals Industries. International symposium. 18, pp. 583-590. ## J. Ovanic, 1998, Economic optimization of stope geometry. Michigan Technological University,Book. ## S. Jalali and M. Ataee-Pour, 2004, "A 2D dynamic programming algorithm to optimize stope boundaries," in Proceedings of the 13th Symposium on Mine Planning and Equipment Selection, Rotterdam, Balkema, pp. 45-52. ## N. Grieco and R. Dimitrakopoulos, 2007, "Managing grade risk in stope design optimisation: probabilistic mathematical programming model and application in sublevel stoping," Mining technology, vol. 116, no. 2, pp. 49-57. ## X. Bai, D. Marcotte, and R. Simon, 2013, "Underground stope optimization with network flow method," Computers & geosciences, vol. 52, pp. 361-371. ## V. Nikbin, M. Ataee-pour, K. Shahriar, Y. Pourrahimian, and S. MirHassani, 2019, "Stope boundary optimization: A mathematical model and efficient heuristics," Resources Policy, vol. 62, pp. 515-526. ## S. Foroughi, J. K. Hamidi, M. Monjezi, and M. Nehring, 2019, "The integrated optimization of underground stope layout designing and production scheduling incorporating a non-dominated sorting genetic algorithm (NSGA-II)," Resources Policy, vol. 63, p. 101408. ## Y. A. Sari and M. Kumral, 2020, "A planning approach for polymetallic mines using a sublevel stoping technique with pillars and ultimate stope limits," Engineering Optimization, vol. 52, no. 6, pp. 932-944. ## N. Cheimanoff, E. Deliac, and J. Mallet, 1989, "GEOCAD: an alternative CAD and artificial intelligence tool that helps moving from geological resources to mineable reserves," in 21st International Symposium on the Application of Computers and Operations Research in the Mineral Industry, pp. 471-478: SME Colorado, USA. ## C. Alford, 1996, "Optimisation in underground mine design," in International Journal of Rock Mechanics and Mining Sciences and Geomechanics Abstracts, vol. 5, no. 33, p. 220A. ## M. Ataee-Pour, 1997, "A new heuristic algorithm to optimise stope boundaries," in Proceeding of the 2nd Regional APCOM Symposium on Computer Applications in the Mineral Industry, Moscow, Russia. ## M. Jalali and S. Hoseinie, 2009, "Optimization of Stope Boundaries Using Greedy Algorithm," Journal of Mining Engineering, vol. 4, no. 7, pp. 1-11. ## E. Topal and J. Sens, 2010, "A new algorithm for stope boundary optimization," Journal of Coal Science and Engineering (China), vol. 16, pp. 113-119. ## D. S. S. Sandanayake, E. Topal, and M. W. A. Asad, 2015, "Designing an optimal stope layout for underground mining based on a heuristic algorithm," International Journal of Mining Science and Technology, vol. 25, no. 5, pp. 767-772. ## V. Nikbin, M. Ataee-Pour, K. Shahriar, and Y. Pourrahimian, 2020, "A 3D approximate hybrid algorithm for stope boundary optimization," Computers & Operations Research, vol. 115, p. 104475. ## V. Nikbin, E. Mardaneh, M. W. A. Asad, and E. Topal, 2022, "Pattern search method for accelerating Stope boundary optimization problem in underground mining operations," Engineering Optimization, vol. 54, no. 5, pp. 881-893. ## A. Esmaeili, J. K. Hamidi, and A. Mousavi, 2023, "Determination of sublevel stoping layout using a network flow algorithm and the MRMR classification system," Resources Policy, vol. 80, p. 103265. ## D. Oliva, E. H. Houssein, and S. Hinojosa, 2021, Metaheuristics in machine learning: theory and applications. Springer,Book. ## S. Javadzadeh, M. Ataee-pour, and V. Hosseinpour, 2019, "Modeling optimum mining limits with imperialist competitive algorithm," in Proceedings of the 27th international symposium on mine planning and equipment selection-MPES 2018, pp. 197-211: Springer. ## E. Atashpaz-Gargari and C. Lucas, 2007, "Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition," in 2007 IEEE congress on evolutionary computation, pp. 4661-4667: Ieee. ## R. Enayatifar, A. H. Abdullah, and M. Lee, 2013, "A weighted discrete imperialist competitive algorithm (WDICA) combined with chaotic map for image encryption," Optics and Lasers in Engineering, vol. 51, no. 9, pp. 1066-1077. ## M. Ataee-Pour, 2005, "A critical survey of the existing stope layout optimization techniques," Journal of Mining Science, vol. 41, pp. 447-466. ##
دوره 19، شماره 63
تابستان 1403
صفحه 95-116

  • تاریخ دریافت 05 دی 1402
  • تاریخ بازنگری 27 اسفند 1402
  • تاریخ پذیرش 31 شهریور 1403