Annals of Operations Research

, Volume 222, Issue 1, pp 419–438 | Cite as

Tailored Lagrangian Relaxation for the open pit block sequencing problem

Article

Abstract

A common strategic and tactical decision in open pit mining is to determine the sequence of extraction for notional three-dimensional production blocks so as to maximize the net present value of the extracted orebody while adhering to precedence and resource constraints. This problem is commonly formulated as an integer program with a binary variable representing if and when a block is extracted. In practical applications, the number of blocks can be large and the time horizon can be long, and therefore, instances of this NP-hard precedence-constrained knapsack problem can be difficult to solve using an exact approach. The problem is even more challenging to solve when it includes explicit minimum resource constraints. We employ three methodologies to reduce solution times: (i) we eliminate variables which must assume a value of 0 in the optimal solution; (ii) we use heuristics to generate an initial integer feasible solution for use by the branch-and-bound algorithm; and (iii) we employ Lagrangian relaxation, using information obtained while generating the initial solution to select a dualization scheme for the resource constraints. The combination of these techniques allows us to determine near-optimal solutions more quickly than solving the monolith, i.e., the original problem. We demonstrate our techniques to solve instances containing 25,000 blocks and 10 time periods, and 10,000 blocks and 15 time periods, to near-optimality.

Keywords

Mining Production scheduling Integer programming 

References

  1. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: theory, algorithms, and applications. Upper Saddle River: Prentice-Hall Google Scholar
  2. Altner, D., & Ergun, O. (2011). Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems. Annals of Operations Research, 184, 3–26. CrossRefGoogle Scholar
  3. Amaya, J., Espinoza, D., Goycoolea, M., Moreno, E., Prevost, T., & Rubio, E. (2009). A scalable approach to optimal block scheduling. In 35th internat. appl. comput. oper. res. in mineral indust. (APCOM) sympos. proc. (pp. 567–571). Vancouver, Canada: CIM. Google Scholar
  4. AMPL (2009). AMPL optimization LLC. Google Scholar
  5. Askari-Nasab, H., Awuah-Offei, K., & Eivazy, H. (2010). Large-scale open pit production scheduling using mixed integer linear programming. International Journal of Mining and Mineral Engineering, 2, 185–214. CrossRefGoogle Scholar
  6. Bienstock, D., & Zuckerberg, M. (2010). Solving LP relaxations of large-scale precedence constrained problems. In F. Eisenbrand & F. B. Shepherd (Eds.), Lecture notes in computer science: Vol. 6080. Integer programming and combinatorial optimization, 14th international conference, IPCO 2010, Proceedings (pp. 1–14). Lausanne, Switzerland, June 9–11, 2010. Berlin: Springer. Google Scholar
  7. Bley, A., Boland, N., Fricke, C., & Froyland, G. (2010). A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Computers & Operations Research, 37(9), 1641–1647. CrossRefGoogle Scholar
  8. Boland, N., Dumitrescu, I., Froyland, G., & Gleixner, A. (2009). LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Computers & Operations Research, 36(4), 1064–1089. CrossRefGoogle Scholar
  9. Brickey, A. (2012). Personal communication. Google Scholar
  10. Caccetta, L., & Hill, S. (2003). An application of branch and cut to open pit mine scheduling. Journal of Global Optimization, 27(2), 349–365. CrossRefGoogle Scholar
  11. Chicoisne, R., Espinoza, D., Goycoolea, M., Moreno, E., & Rubio, E. (2012). A new algorithm for the open-pit mine scheduling problem. Operations Research, 60(3), 517–528. CrossRefGoogle Scholar
  12. Cullenbine, C., Wood, R., & Newman, A. (2011). A sliding time window heuristic for open pit mine block sequencing. Optimization Letters, 5(3), 365–377. CrossRefGoogle Scholar
  13. Dagdelen, K. (1985). Optimum multi period open pit mine production scheduling. PhD thesis, Colorado School of Mines, Golden, CO. Google Scholar
  14. Dagdelen, K., & Johnson, T. (1986). Optimum open pit mine production scheduling by Lagrangian parameterization. In 19th internat. appl. comput. oper. res. in mineral indust. (APCOM) sympos. proc. (pp. 127–141). University Park: Society of Mining Engineers. Google Scholar
  15. Espinoza, D., Goycoolea, M., Moreno, E., & Newman, A. (to appear). MineLib: a library of open pit mining problems. Annals of Operations Research. Google Scholar
  16. Fisher, M. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1), 1–18. CrossRefGoogle Scholar
  17. Gaupp, M. (2008). Methods for improving the tractability of the block sequencing problem for open pit mining. PhD thesis, Colorado School of Mines, Golden, CO. Google Scholar
  18. Gleixner, A. (2008). Solving large-scale open pit mining production scheduling problems by integer programming. Master’s thesis, Technische Universität Berlin. Google Scholar
  19. Hochbaum, D., & Chen, A. (2000). Performance analysis and best implementations of old and new algorithms for the open-pit mining problem. Operations Research, 48(6), 894–914. CrossRefGoogle Scholar
  20. IBM (2009). ILOG CPLEX, Incline Village, NV. Google Scholar
  21. IBM (2010). IBM ILOG AMPL version 12.2 user’s guide. Incline Village, NV. Google Scholar
  22. Johnson, D., & Niemi, K. (1983). On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1), 1–14. CrossRefGoogle Scholar
  23. Johnson, T. (1968). Optimum open pit mine production scheduling. PhD thesis, University of California, Berkeley, CA. Google Scholar
  24. Kawahata, K. (2006). A new algorithm to solve large scale mine production scheduling problems by using the Lagrangian relaxation method. PhD thesis, Colorado School of Mines, Golden, CO. Google Scholar
  25. Klotz, E., & Newman, A. (to appear). Practical guidelines for solving difficult mixed integer programs. Surveys in Operations Research and Management Science. Google Scholar
  26. Lambert, W., Brickey, A., Newman, A., & Eurek, K. (to appear). Open pit block sequencing formulations: a tutorial. Interfaces. Google Scholar
  27. Lerchs, H., & Grossmann, I. (1965). Optimum design of open-pit mines. Canadian Mining and Metallurgical Bulletin, 58(633), 47–54. Google Scholar
  28. Martinez, M., & Newman, A. (2011). Using decomposition to optimize long- and short-term production scheduling at LKAB’s Kiruna mine. European Journal of Operational Research, 211(1), 184–197. CrossRefGoogle Scholar
  29. Moreno, E., Espinoza, D., & Goycoolea, M. (2010). Large-scale multi-period precedence constrained knapsack problem: a mining application. In M. Haouari & A. Mahjoub (Eds.), Electronic notes in discrete mathematics: Vol36. Internat. sympos. on combinatorial optimization (ISCO) (pp. 407–414). Hammamet, Tunisia Google Scholar
  30. Newman, A., Rubio, E., Caro, R., Weintraub, A., & Eurek, K. (2010). A review of operations research in mine planning. Interfaces, 40(3), 222–245. CrossRefGoogle Scholar
  31. Pochet, Y., & Wolsey, L. (2006). Production planning by mixed integer programming. New York: Springer. Google Scholar
  32. Ramazan, S. (2007). The new fundamental tree algorithm for production scheduling of open pit mines. European Journal of Operational Research, 177(2), 1153–1166. CrossRefGoogle Scholar
  33. Underwood, R., & Tolwinski, B. (1998). A mathematical programming viewpoint for solving the ultimate pit problem. European Journal of Operational Research, 107(1), 96–107. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Division of Economics and BusinessColorado School of MinesGoldenUSA

Personalised recommendations