Improving performance of open-pit mine production scheduling problem under grade uncertainty by hybrid algorithms
Kamyar Tolouei , Ehsan Moosavi , Amir Hossein Bangian Tabrizi , Peyman Afzal , Abbas Aghajani Bazzazi
Journal of Central South University ›› 2020, Vol. 27 ›› Issue (9) : 2479 -2493.
One of the surface mining methods is open-pit mining, by which a pit is dug to extract ore or waste downwards from the earth’s surface. In the mining industry, one of the most significant difficulties is long-term production scheduling (LTPS) of the open-pit mines. Deterministic and uncertainty-based approaches are identified as the main strategies, which have been widely used to cope with this problem. Within the last few years, many researchers have highly considered a new computational type, which is less costly, i.e., meta-heuristic methods, so as to solve the mine design and production scheduling problem. Although the optimality of the final solution cannot be guaranteed, they are able to produce sufficiently good solutions with relatively less computational costs. In the present paper, two hybrid models between augmented Lagrangian relaxation (ALR) and a particle swarm optimization (PSO) and ALR and bat algorithm (BA) are suggested so that the LTPS problem is solved under the condition of grade uncertainty. It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence. Moreover, the Lagrangian coefficients are updated by using PSO and BA. The presented models have been compared with the outcomes of the ALR-genetic algorithm, the ALR-traditional sub-gradient method, and the conventional method without using the Lagrangian approach. The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution. Hence, it is more effectual than the conventional method. Furthermore, the time and cost of computation are diminished by the proposed hybrid strategies. The CPU time using the ALR-BA method is about 7.4% higher than the ALR-PSO approach.
open-pit mine / long-term production scheduling / grade uncertainty / augmented Lagrangian relaxation / particle swarm optimization algorithm / bat algorithm
| [1] |
JOHNSON T B. Optimum production scheduling [C]// Proceedings of 8th International Symposium on Computers and Operations research. Salt Lake City, 1969: 539–562. |
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
TOLWINSKI B. Scheduling production for open-pit mines [C]// Proceedings of APCOM’98. 1994: 19–23. |
| [10] |
AKAIKE A, DAGDELEN K. A strategic production scheduling method for an open-pit mine [C]// Proceedings of the 28th Application of Computers and Operation Research in the Mineral Industry. 1999: 729–738. |
| [11] |
WHITTLE D. Proteus environment: Sensitivity analysis made easy [C]// Whittle North American Strategic Mine Planning Conference. Colorado, 2000. |
| [12] |
JOHNSON T B, DAGDELEN K, RAMAZAN S. Open pit mine scheduling based on fundamental tree algorithm [C]// Proceeding of the 30th International Symposium on the Application of Computers and Operations Research in the Mineral Industry SME: Littleton. 2002: 147–159. |
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
GHOLAMNEJAD J, OSANLOO M. A chance constrained integer programming model for open pit long-term production planning [C]// Proceedings of the Sixteenth International Symposium on Mine Planning and Equipment Selection (MPES). 2007: 359–372. |
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
JELVEZ E, MORALES N, NANCEL-PENARD P. Open-pit mine production scheduling: Improvements to MineLib library problems [C]// Proceedings of the 27th International Symposium on Mine Planning and Equipment Selection (MPES). 2018: 223–232. |
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
|
| [53] |
RODRIGUES R N, da SILVA E L, FINARDI E C, TAKIGAWA F Y K T. Solving the short-term scheduling problem of hydrothermal systems via lagrangian relaxation and augmented Lagrangian [J]. Mathematical Problems in Engineering, 2012: 856178. |
| [54] |
|
| [55] |
|
| [56] |
ZHU B, ZHU W, LIU Z, DUAN Q, CAO L. A novel quantum-behaved bat algorithm with mean best position directed for numerical optimization [J]. Computational Intelligence and Neuroscience, 2016, Article ID 6097484. |
| [57] |
|
| [58] |
|
| [59] |
|
| [60] |
|
| [61] |
|
| [62] |
|
| [63] |
|
| [64] |
|
| [65] |
EBERHART R, KENNEDY J. A new optimizer using particle swarm theory [C]// Proceedings of the Sixth International Symposium on Micro Machine and Human Science. IEEE Service Center, 1995: 39–43. |
| [66] |
|
| [67] |
van DEN BERGH F, ENGELBRECHT A P. A new locally convergent particle swarm optimizer [C]// IEEE Conferences on Systems, 2002. |
| [68] |
|
| [69] |
|
| [70] |
|
| [71] |
|
| [72] |
|
| [73] |
|
/
| 〈 |
|
〉 |