Highest-Level Implementation of Push–Relabel Algorithm to Solve Ultimate Pit Limit Problem
محل انتشار: مجله معدن و محیط زیست، دوره: 12، شماره: 2
سال انتشار: 1400
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 242
فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JMAE-12-2_011
تاریخ نمایه سازی: 20 تیر 1400
چکیده مقاله:
Nowadays due to the existence of the economic and geological uncertainties and the increasing use of scenario-based project evaluation in the design of open-pit mines, it is necessary to find an exact algorithm that can determine the ultimate pit limit in a short period of time. Determining the ultimate pit limit is an important optimization problem that is solved to define what will be eventually extracted from the ground, and directly impacts the mining costs, revenue, choosing mining equipment, and approximation of surface infrastructures outside the pit. This problem is solved in order to maximize the non-discounted profit under the precedence relation (access) constraints. In this paper, the Highest-Level Push-Relabel (HI-PR) implementation of the push–relabel algorithm is discussed and applied in order to solve the ultimate pit limit optimization problem. HI-PR uses the highest-label selection rule, global update, and gap heuristics to reduce the computations. The proposed algorithm is implemented to solve the ultimate pit limit for the nine real-life benchmark case study publicly available on the Minelib website. The results obtained show that the HI-PR algorithm can reach the optimum solution in a less computational time than the currently implemented algorithms. For the largest dataset, which includes ۱۱۲۶۸۷ blocks and ۳,۰۳۵,۴۸۳ constraints, the average solution time in ۱۰۰ runs of the algorithm is ۴ s, while IBM CPLEX, as an exact solver, could not find any feasible solution in ۲۴ hours. This speeding-up capability can significantly improve the current challenges in the real-time mine planning and reconciliation, where fast and reliable solutions are required.
کلیدواژه ها:
نویسندگان
M. Talaei
Department of Mining Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
A. Mousavi
Department of Mining Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
A. R. Sayadi
Department of Mining Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :