Shortest path optimization of haul road design in underground mines using an evolutionary algorithm

Date

2019-10-01

Author

Yardımcı, Ahmet Güneş
Karpuz, Celal

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

139
views

0
downloads

All types of underground mine access serve as permanent openings to transfer men and extracted material throughout the life of an operation. Development and operating costs are predominantly controlled by the haul road length. However, the most common method to design the main haul road is to rely on the empirical knowledge of skilled mine design experts. This is sufficient for simple mine layouts. However, determination of the optimum path without violating navigation constraints in complex underground networks may be challenging even for the leading design specialists. Therefore, a new methodology is required to obtain the optimal haul road path considering kinematic constraints like minimum turning radius and maximum grade. It is also important that the method can avoid structural defect zones (faults, joints) or any kind of undesired regions. This study aims to provide an algorithmic solution to this major design problem. Investigating the shortest path for a haul road using evolutionary optimization, a novel contribution was made in underground mine planning. Genetic algorithm was explored as an efficient alternative compared to the global optimizers due to its computational advantages. Another original contribution was the new mutation operators specifically developed for underground mining. They distinguish the algorithm from similar studies in other disciplines. The algorithm was confirmed to be superior compared to the human-made plans based on a case study that involves six real underground mines. Although global optimization provides the best path, exponential time solutions make it infeasible as the problem scale grows. The genetic algorithm provides a suboptimal path with no considerable loss in quality and yet ensures the constraints even for the large-scale underground operations.

Subject Keywords

Software

URI

https://hdl.handle.net/11511/47617

Journal

APPLIED SOFT COMPUTING

DOI

https://doi.org/10.1016/j.asoc.2019.105668

Collections

Department of Mining Engineering, Article

Suggestions

OpenMETU
Core

Model-based code generation for HLA federates Adak, Mehmet; Topcu, Okan; Oğuztüzün, Mehmet Halit S. (Wiley, 2010-02-01) This paper addresses the problem of automated code generation for a High Level Architecture compliant federate application given its behavior model. The behavior model is a part of the architectural model of a federation that the federate can participate in. The federate behavior model is based on Live Sequence Charts, adopted as the behavioral specification formalism in the Federation Architecture Metamodel (FAMM). FAMM serves as a formal language for describing federation architectures. An objective is to...
Local search versus Path Relinking in metaheuristics: Redesigning Meta-RaPS with application to the multidimensional knapsack problem Arin, Arif; Rabadi, Ghaith (Elsevier BV, 2016-09-01) Most heuristics for discrete optimization problems consist of two phases: a greedy-based construction phase followed by an improvement (local search) phase. Although the best solutions are usually generated after the improvement phase, there is usually a high computational cost for employing a local search algorithm. This paper seeks another alternative to reduce the computational burden of a local search while keeping solution quality by embedding intelligence in metaheuristics. A modified version of Path ...
Analyzing the Effects of Inventory Cost Setting Rules in a Disassembly and Recovery Environment Akcali, Elif; Bayındır, Zeynep Pelin (null; 2005-10-15) We consider a salvaging facility that satisfies the demand for remanufactured parts that can be recovered from the end-of-life products. One of the difficulties faced in planning for such a system is the determination of the opportunity cost associated with carrying recovered parts inventory. In this study we investigate the effect of different rules to determine this opportunity cost on the performance of the system. The performance of several different rules is assessed by a computational study under a pr...
Special index and retrieval mechanism for ontology based medical domain search engines Kubilay, Mustafa; Baykal, Nazife; Department of Information Systems (2005) This thesis focuses on index and retrieval mechanism of an ontology based medical domain search engine. First, indexing techniques and retrieval methods are reviewed. Then, a special indexing and retrieval mechanism are introduced. This thesis also specifies the functional requirements of these mechanisms. Finally, an evaluation is given by indicating the positive and negative aspects of mechanisms.
Coordinate systems for a naval virtual environment Kılıç, Aslı; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2005) The purpose of this thesis is implementing World Geodetic System (WGS) for Naval Surface Tactical Maneuvering Simulation System (NSTMSS), a High Level Architecture (HLA) based naval simulation, and also implementing body coordinate system for the ships of NSTMSS and its combination with WGS so that NSTMSS can be more accurate, and new ship dynamics models can be integrated to the NSTMSS environment more easily. To improve the coordinate system of NSTMSS these methods were used; World Geodetic System - 1984 ...

Citation Formats

A. G. Yardımcı and C. Karpuz, “Shortest path optimization of haul road design in underground mines using an evolutionary algorithm,” APPLIED SOFT COMPUTING, pp. 0–0, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47617.