Name
Title | ||
|---|---|---|
Comparative analysis of three metaheuristics for short-term open pit block sequencing. |
Abstract | ||
|---|---|---|
This paper presents the application of simulated annealing (SA), Tabu search (TS) and hybrid TS–SA to solve a real-world mining optimisation problem called open pit block sequencing (OPBS). The OPBS seeks the optimum extraction sequences under a variety of geological and technical constraints over short-term horizons. As industry-scale OPBS instances are intractable for standard mixed integer programming (MIP) solvers, SA, TS and hybrid TS–SA are developed to solve the OPBS problem. MIP exact solution is also combined with the proposed metaheuristics to polish solutions in feasible neighbourhood moves. Extensive sensitivity analysis is conducted to analyse the characteristics and determine the optimum sets of values of the proposed metaheuristics algorithms’ parameters. Computational experiments show that the proposed algorithms are satisfactory for solving the OPBS problem. Additionally, this comparative study shows that the hybrid TS–SA is superior to SA or TS in solving the OPBS problem in several aspects. |
Year | DOI | Venue |
|---|---|---|
2016 | https://doi.org/10.1007/s10732-016-9311-z | J. Heuristics |
Keywords | Field | DocType |
Open pit mining,Short-term block sequencing,Mixed integer programming,Simulated annealing,Tabu search,Hybrid metaheuristic | Simulated annealing,Mathematical optimization,Algorithm,Open-pit mining,Integer programming,Artificial intelligence,Mathematics,Machine learning,Tabu search,Metaheuristic | Journal |
Volume | Issue | ISSN |
22 | 3 | 1381-1231 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amin Mousavi | 1 | 1 | 0.36 |
| Erhan Kozan | 2 | 315 | 32.28 |
| Shi Qiang Liu | 3 | 64 | 5.40 |