A Mathematical Model to Optimize Allocation Sequence in Dispatching Problem | ||
| Journal of Mining and Environment | ||
| مقاله 12، دوره 11، شماره 1، فروردین 2020، صفحه 185-192 اصل مقاله (1.09 M) | ||
| نوع مقاله: Original Research Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jme.2019.8721.1766 | ||
| نویسندگان | ||
| M. Ghobadi Samani؛ M. Monjezi* ؛ J. Khademi Hamidi؛ A. Mousavinogholi | ||
| Faculty of Engineering, Tarbiat Modares University, Iran. | ||
| چکیده | ||
| Truck-Shovel fleet, as the most common transportation system in open-pit mines, has a significant part of mining costs, for which optimal management can lead to substantial cost reductions. Among the available dispatch mathematical models, the multi-stage approach is well suited for allocating trucks to respected shovels in a dynamic dispatching program. However, with this kind of modeling sequencing of the allocated trucks is not possible though it is important to find out the best solution so that getting the minimum accrued cost. To comply with the shortcoming of the traditional model, in this paper, a new hybrid model is developed and applied in Copper Mine of Iran, in which for each truck an allocation matrix is considered as input to the genetic algorithm implemented to determine the best solution. According to the obtained results, the optimal sequencing of the trucks can result in a significant (31%) cost reduction in a shift. | ||
| کلیدواژهها | ||
| Dispatch؛ Dynamic allocation؛ Simulation؛ Genetic algorithm | ||
|
آمار تعداد مشاهده مقاله: 707 تعداد دریافت فایل اصل مقاله: 651 |
||