Skip to main content
Log in

Comparative analysis of three metaheuristics for short-term open pit block sequencing

Journal of Heuristics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

References

  • Blum, C., Roli, A.: Hybrid metaheuristics: an introduction. In: Blum, C., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, pp. 1–30. Springer-Verlag, Berlin (2008)

    Chapter  Google Scholar 

  • Caccetta, L., Hill, S.P.: An application of branch and cut to open pit mine scheduling. J. Glob. Optim. 27, 349–365 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Chicoisne, R., Espinoza, D., Goycoolea, M., Moreno, E., Rubio, E.: A new algorithm for the open-pit mine production scheduling problem. Oper. Res. 60(3), 517–528 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Cullenbine, C., Wood, R.K., Newman, A.: A sliding time window heuristic for open pit mine block sequencing. Optim. Lett. 5, 365–377 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  • Eivazy, H., Askari-Nasab, H.: A mixed integer linear programming model for short-term open pit mine production scheduling. Min. Technol. 121(2), 97–108 (2012)

    Article  Google Scholar 

  • Espinoza, D., Goycoolea, M., Moreno, E., Newman, A.: MineLib: a library of open pit mining problems. Ann. Oper. Res. 206(1), 93–114 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  • Ferland, J.A., Amaya, J., Djuimo, M.S.: Application of a particle swarm algorithm to the capacitated open pit mining problem. In: Mukhopadhyay, S.C., Gupta, G.S. (eds.) Autonomous Robots and Agents Studies in Computational Intelligence, vol. 76, pp. 127–133. Springer-Verlag, Berlin (2007)

    Chapter  Google Scholar 

  • Glover, F.: Tabu search–part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Article  MATH  Google Scholar 

  • Glover, F.: Tabu search–part II. ORSA J. Comput. 2(1), 4–32 (1990)

    Article  MATH  Google Scholar 

  • Jélvez, E., Morales, N., Nancel-Penard, P., Peypouquet, J., Reyes, P.: Aggregation heuristic for the open-pit block scheduling problem. Eur. J. Oper. Res. 249(3), 1169–1177 (2016)

    Article  MathSciNet  Google Scholar 

  • Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  • Kozan, E., Liu, S.Q.: Operations research for mining: a classification and literature review. ASOR Bull. 30(1), 2–23 (2011)

    Google Scholar 

  • Kozan, E., Liu, S.Q.: A demand-responsive decision support system for coal transportation. Decis. Support. Syst. 54(1), 665–680 (2012)

    Article  Google Scholar 

  • Kozan, E., Liu, S.Q.: An open pit multistage mine production scheduling model for drilling, blasting and excavating operations. Orebody Model. Strat. Mine Plan. 2014, 329–334 (2014)

    Google Scholar 

  • Kozan, E., Liu, S.Q.: A new open-pit multi-stage mine production timetabling model for drilling, blasting and excavating operations. Min. Technol. 1743286315Y-0000000031 (2015)

  • Kozan, E., Liu, S.Q., Wolff, R.: A short-term production scheduling methodology for open-pit mines. In: International Symposium on the 36th Applications of Computers and Operations Research in the Mineral Industry (36th APCOM), Porto Alegre, Brazil (2013), pp. 465–469. Fundaco Luiz Englert, Porto Alegre

  • Kumral, M., Dowd, P.A.: A simulated annealing approach to mine production scheduling. J. Oper. Res. Soc. 56(8), 922–930 (2004)

    Article  MATH  Google Scholar 

  • L’Heureux, G., Gamache, M., Soumis, F.: Mixed integer programming model for short term planning in open-pit mines. Min. Technol. 122(2), 101–109 (2013)

    Article  Google Scholar 

  • Lambert, W.B., Brickey, A., Newman, A.M., Eurek, K.: Open-pit block-sequencing formulations: a tutorial. Interfaces 44(2), 127–142 (2014)

    Article  Google Scholar 

  • Lerchs, H., Grossmann, I.: Optimum design of open pit mines. Trans. CIM 68, 17–24 (1965)

    Google Scholar 

  • Liu, S.Q., Kozan, E.: Optimising a coal rail network under capacity constraints. Flex. Serv. Manuf. J. 23(2), 90–110 (2011a)

    Article  MATH  Google Scholar 

  • Liu, S.Q., Kozan, E.: Scheduling trains with priorities: a no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45(2), 175–198 (2011b)

    Article  Google Scholar 

  • Liu, S.Q., Kozan, E.: A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem. J. Oper. Res. Soc. 63(2), 168–182 (2012)

    Article  Google Scholar 

  • Liu, S.Q., Kozan, E.: New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems. Expert Syst. Appl. 43, 59–65 (2016)

    Article  Google Scholar 

  • Moreno, E., Espinoza, D., Goycoolea, M.: Large-scale multi-period precedence constrained knapsack problem: a mining application. Electr. Notes Discret. Math. 36, 407–414 (2010)

    Article  MATH  Google Scholar 

  • Mousavi, A., Kozan, E., Liu, S.Q.: Integrated approach to optimize open-pit mine block sequencing. In: Bidanda, B., Sabuncuoglu, I., Kara, B.Y. (eds.) Industrial Engineering Non-Traditional Applications in International Settings, pp. 83–98. CRC Press, Boca Raton (2014)

    Google Scholar 

  • Mousavi, A., Kozan, E., Liu, S.Q.: Open-pit block sequencing optimization: a mathematical model and solution technique. Eng. Optim. 1–19 (2016)

  • Newman, A.M., Rubio, E., Caro, R., Eurek, K.: A review of operations research in mine planning. Interfaces 40(3), 222–245 (2010)

    Article  Google Scholar 

  • Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Mira, J., Álvarez, J.R. (eds.) Artificial intelligence and knowledge engineering applications: a bioinspired approach. Springer, Berlin (2005)

    Google Scholar 

  • Rodriguez-Tello, E., Hao, J.-K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331–3346 (2008)

    Article  MATH  Google Scholar 

  • Shishvan, M.S., Sattarvand, J.: Long term production planning of open pit mines by ant colony optimization. Eur. J. Oper. Res. 240(3), 825–836 (2015)

    Article  Google Scholar 

  • Smith, J.C., Cochran, J.J.: Introduction to Tabu Search. In: Cochran, J.J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, pp. 1–10. Wiley, New York (2010)

    Google Scholar 

  • Varanelli, J.M., Cohoon, J.P.: A two-stage simulated annealing methodology. In: VLSI, 1995. Proceedings of the Fifth Great Lakes Symposium on, Buffalo, NY, pp. 50–53. IEEE (1995)

  • Whittle, D.: Chapter 10.2: open-pit planning and design. In: Darling, P. (ed.) SME Mining Engineering Handbook (3rd Edition), pp. 877–901. Society for Mining, Metallurgy, and Exploration (SME), Englewood (2011)

    Google Scholar 

Download references

Acknowledgments

The authors would like to acknowledge the support of CRC ORE, established and supported by the Australian Government’s Cooperative Research Centres Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Erhan Kozan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mousavi, A., Kozan, E. & Liu, S.Q. Comparative analysis of three metaheuristics for short-term open pit block sequencing. J Heuristics 22, 301–329 (2016). https://doi.org/10.1007/s10732-016-9311-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-016-9311-z

Keywords

Navigation