سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات158
تعداد شماره‌ها6,230
تعداد مقالات67,757
تعداد مشاهده مقاله115,112,239
تعداد دریافت فایل اصل مقاله89,874,666
Najafi, Mehdi, Rafiee, Ramin, jalali, Seyed Mohammad Esmaeil. (1399). Open pit limit optimization using dijkstra’s algorithm. , 54(1), 39-43. doi: 10.22059/ijmge.2019.252822.594718
Mehdi Najafi; Ramin Rafiee; Seyed Mohammad Esmaeil jalali. "Open pit limit optimization using dijkstra’s algorithm". , 54, 1, 1399, 39-43. doi: 10.22059/ijmge.2019.252822.594718
Najafi, Mehdi, Rafiee, Ramin, jalali, Seyed Mohammad Esmaeil. (1399). 'Open pit limit optimization using dijkstra’s algorithm', , 54(1), pp. 39-43. doi: 10.22059/ijmge.2019.252822.594718
Najafi, Mehdi, Rafiee, Ramin, jalali, Seyed Mohammad Esmaeil. Open pit limit optimization using dijkstra’s algorithm. , 1399; 54(1): 39-43. doi: 10.22059/ijmge.2019.252822.594718

Open pit limit optimization using dijkstra’s algorithm

International Journal of Mining and Geo-Engineering
مقاله 5، دوره 54، شماره 1، شهریور 2020، صفحه 39-43    اصل مقاله (532.56 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/ijmge.2019.252822.594718
نویسندگان
Mehdi Najafi1؛ Ramin Rafiee* 2؛ Seyed Mohammad Esmaeil jalali2
1Department of Mining and Metallurgical Eng., Yazd University, Yazd, Iran
2Faculty of Mining Engineering, Petroleum and Geophysics, Shahrood University of Technology, Iran
چکیده
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the pit limit, which influences the stripping ratio, damp locations, ore processing site and access routes, should be designed. So far, a large number of algorithms have been developed to optimize the pit limits. These algorithms are categorized into two groups: heuristic and rigorous. In this paper, a new approach is presented to optimize the pit limit based on Dijkstra’s algorithm which is based on mathematical relations. This algorithm was implemented on a 2D economic graph model and can find the true optimal solution. The results were compared with those from the dynamic programming (DP) algorithm. This algorithm showed to have less time complexity compared to the dynamic programming algorithm and to be easier to write dynamic computer programs.
کلیدواژه‌ها
Graph Theory؛ Open Pit؛ Dijkstra Algorithm؛ Optimization. Dynamic Programing
آمار
تعداد مشاهده مقاله: 498
تعداد دریافت فایل اصل مقاله: 561


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب