A hybrid heuristic algorithm for the open-pit-mining operational planning problem

This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NP-hard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search. The proposed algorithm was tested using a set of real-data problems and the results were validated by running the CPLEX optimizer with the same data. This solver used a mixed integer programming model also developed in this work. The computational experiments show that the proposed algorithm is very competitive, finding near optimal solutions (with a gap of less than 1%) in most instances, demanding short computing times.

[1]  Ambros M. Gleixner,et al.  LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity , 2009, Comput. Oper. Res..

[2]  Denis Bouyssou,et al.  4OR Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 2004 .

[3]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[4]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[5]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[6]  Carlos Alberto Zaffari.  PROGRAMA DE PÓS-GRADUAÇÃO EM ENGENHARIA ELÉTRICA , 2006 .

[7]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[8]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[9]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[10]  J. W. White,et al.  Computer-based dispatching in mines with concurrent operating objectives , 1986 .

[11]  Pierre Hansen,et al.  Variable Neighborhood Search : Methods and Applications , 2008 .

[12]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[13]  Kadri Dagdelen,et al.  Optimal blending of mine production using goal programming and interactive graphics systems , 1995 .

[14]  FroylandGary,et al.  LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity , 2009 .

[15]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[16]  R. Dimitrakopoulos,et al.  Managing risk and waste mining in long-term production scheduling of open-pit mines , 2004 .

[17]  Carlos Romero,et al.  A general structure of achievement function for a goal programming model , 2004, Eur. J. Oper. Res..

[18]  Vassil Sgurev,et al.  TRASY -- An automated system for real-time control of the industrial truck haulage in open-pit mines , 1989 .

[19]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .