Robustness price of open-pit mine production scheduling

Document Type : Research Paper

Authors

1 Department of Mining Engineering, Urmia University of Technology, Urmia, Iran.

2 School of Mining Engineering, College of Engineering, University of Tehran

3 School of Industrial Engineering & Engineering Optimization Research Group, College of Engineering, University of Tehran, Tehran, Iran.

Abstract

An Open-Pit Production Scheduling (OPPS) problem focuses on specifying block production scheduling to achieve the highest possible Net Present Value (NPV). This paper presents a new mathematical model for OPPS under uncertainty. To this end, a robust box and ellipsoidal counterpart approach was used. The proposed method was implemented in a hypothetical model. A Genetic Algorithm (GA) and an exact mathematical modeling approach were used to solve the model. It was shown that the scheduling of deterministic and robust models in various conditions is different. Considering the type of robust counterparts, different production plans under various conditions were scheduled. Furthermore, the price of robustness was determined for various levels of conservation.

Keywords


[1] Alipour, A., Khodaiari, A. A., Jafari, A., and TavakkoliMoghaddam, R., "Robust production scheduling in open-pit mining under uncertainty: a box counterpart approach," Journal of Mining and Environment, vol. 8, no. 2, pp. 255-267, 122 A. Alipour et al. / Int. J. Min. & Geo-Eng. (IJMGE), 54-2 (2020) 117-122 04/01 2017.
[2] Alipour, A., Khodaiari, A. A., Jafari, A., and TavakkoliMoghaddam, R., "Uncertain production scheduling optimization in open-pit mines and its ellipsoidal robust counterpart," International Journal of Management Science and Engineering Management, pp. 1-9, 2018.
[3] Averbakh, I., "Minmax regret solutions for minimax optimization problems with uncertainty," Operations Research Letters, vol. 27, no. 2, pp. 57-65, 2000.
[4] Soyster, A. L., "Technical note—convex programming with set-inclusive constraints and applications to inexact linear programming," Operations Research, vol. 21, no. 5, pp. 1154- 1157, 1973.
[5] Mulvey, J. M., Vanderbei, R. J., and Zenios, S. A., "Robust optimization of large-scale systems," Operations Research, vol. 43, no. 2, pp. 264-281, 1995.
[6] Yu, C.-S. and Li, H.-L., "A robust optimization model for stochastic logistic problems," International Journal of Production Economics, vol. 64, no. 1, pp. 385-397, 2000.
[7] Ben-Tal, A. and Nemirovski, A., "Robust convex optimization," Mathematics of Operations Research, vol. 23, no. 4, pp. 769-805, 1998.
[8] Ben-Tal, A. and Nemirovski, A., "Robust solutions of linear programming problems contaminated with uncertain data," Mathematical programming, vol. 88, no. 3, pp. 411-424, 2000.
[9] Ghaoui, L. E., Oks, M., and Oustry, F., "Worst-case value-atrisk and robust portfolio optimization: A conic programming approach," Operations Research, vol. 51, no. 4, pp. 543-556, 2003.
[10] Bertsimas, D. and Sim, M., "Robust discrete optimization and network flows," Mathematical programming, vol. 98, no. 1-3, pp. 49-71, 2003.
[11] Bertsimas, D. and Sim, M., "The price of robustness," Operations Research, vol. 52, no. 1, pp. 35-53, 2004.
[12] Verderame, P. M. and Floudas, C. A., "Operational planning of large-scale industrial batch plants under demand due date and amount uncertainty: II. Conditional value-at-risk framework," Industrial & engineering Chemistry Research, vol. 49, no. 1, pp. 260-275, 2009.
[13] Chen, W., Sim, M., Sun, J., and Teo, C.-P., "From CVaR to uncertainty set: Implications in joint chance-constrained optimization," Operations Research, vol. 58, no. 2, pp. 470- 485, 2010.
[14] Li, Z., Ding, R., and Floudas, C. A., "A comparative theoretical and computational study on robust counterpart optimization: I. Robust linear optimization and robust mixed integer linear optimization," Industrial & Engineering Chemistry Research, vol. 50, no. 18, pp. 10567-10603, 2011.
[15] Li, Z. and Floudas, C. A., "A comparative theoretical and computational study on robust counterpart optimization: III. Improving the quality of robust solutions," Industrial & Engineering Chemistry Research, vol. 53, no. 33, pp. 13112- 13124, 2014.
[16] Li, Z. and Li, Z., "Chance constrained planning and scheduling under uncertainty using robust optimization approximation," IFAC-PapersOnLine, vol. 48, no. 8, pp. 1156- 1161, 2015/01/01 2015.
[17] Li, Z. and Floudas, C. A., "Robust counterpart optimization: Uncertainty sets, formulations and probabilistic guarantees," in Proceedings of the 6th conference on Foundations of Computer-Aided Process Operations, Savannah (Georgia), 2012.
[18] Kumral, M., "Robust stochastic mine production scheduling," Engineering Optimization, vol. 42, no. 6, pp. 567-579, 2010/06/01 2010.
[19] Alipour, A., khodaiari, A. A., Jafari, A., and TavakkoliMoghaddam, R., "A genetic algorithm approach for open-pit mine production scheduling," Int. Journal of Mining & GeoEngineering, vol. 51, no. 1, pp. 47-52, 2017.