×

The new Fundamental Tree Algorithm for production scheduling of open pit mines. (English) Zbl 1110.90033

Summary: The problem of annual production scheduling in surface mining consists of determining an optimal sequence of extracting the mineralized material from the ground. The main objective of the optimization process is usually to maximize the total Net Present Value of the operation. Production scheduling is typically a mixed integer programming (MIP) type problem. However, the large number of integer variables required in formulating the problem makes it impossible to solve. To overcome this obstacle, a new algorithm termed “Fundamental Tree Algorithm” is developed based on linear programming to aggregate blocks of material and decrease the number of integer variables and the number of constraints required within the MIP formulation. This paper proposes the new Fundamental Tree Algorithm in optimizing production scheduling in surface mining. A case study on a large copper deposit summarized in the paper shows substantial economic benefit of the proposed algorithm compared to existing methods.

MSC:

90B30 Production models
90B35 Deterministic scheduling theory in operations research
90C06 Large-scale problems in mathematical programming
Full Text: DOI

References:

[1] Bernabe, D., 2001. Comparative analysis of open pit mine scheduling techniques for strategic mine planning of a copper mine in Southern Peru. M.Sc. Thesis, Colorado School of Mines, Golden CO.; Bernabe, D., 2001. Comparative analysis of open pit mine scheduling techniques for strategic mine planning of a copper mine in Southern Peru. M.Sc. Thesis, Colorado School of Mines, Golden CO.
[2] Dagdelen, K., 1985. Optimum multi-period open pit mine production scheduling by Lagrangian parameterization. Ph.D. Thesis, Colorado School of Mines, Golden, CO.; Dagdelen, K., 1985. Optimum multi-period open pit mine production scheduling by Lagrangian parameterization. Ph.D. Thesis, Colorado School of Mines, Golden, CO.
[3] Dantzig, G. B.; Wolfe, P., Decomposition principle for linear programs, Operations Research, 8, 1, 101-111 (1960) · Zbl 0093.32806
[4] Dimitrakopoulos, R.; Ramazan, S., Uncertainty based production scheduling in open pit mining, SME Transactions, 316 (2004)
[5] Gershon, M. E., Optimal mine production scheduling evaluation of large scale mathematical programming approaches, International Journal of Mining Engineering, 1, 315-329 (1983)
[6] Godoy, M.; Dimitrakopoulos, R., Managing risk and waste mining in long-term production scheduling, SME Transactions, 316 (2004)
[7] Hochbaum, D. S.; Chen, A., Performance analysis and best implementations of old and new algorithms for the open-pit mining problem, Operations Research, 48, 894-913 (2000)
[8] Johnson, T.B., 1968. Optimum open pit mine production scheduling. Ph.D. Dissertation, University of California, Berkeley, CA.; Johnson, T.B., 1968. Optimum open pit mine production scheduling. Ph.D. Dissertation, University of California, Berkeley, CA.
[9] Lemieux, M., 1979. Moving Cone Optimizing Algorithm. Computer methods for the 80’s in the mineral industry. In: Weiss A. (Ed.), SME-AIME, pp. 329-345.; Lemieux, M., 1979. Moving Cone Optimizing Algorithm. Computer methods for the 80’s in the mineral industry. In: Weiss A. (Ed.), SME-AIME, pp. 329-345.
[10] Lerchs, H.; Grossmann, I. F., Optimum design of open-pit mines, Transactions on CIM, LXVII, 47-54 (1965)
[11] Ramazan, S., 1996. A new push back design algorithm in open pit mining. M.Sc. Thesis, Colorado School of Mines, Golden, CO.; Ramazan, S., 1996. A new push back design algorithm in open pit mining. M.Sc. Thesis, Colorado School of Mines, Golden, CO.
[12] Ramazan, S., 2001. Open pit mine scheduling based on fundamental tree algorithm. Ph.D. Thesis, Colorado School of Mines, Golden, CO.; Ramazan, S., 2001. Open pit mine scheduling based on fundamental tree algorithm. Ph.D. Thesis, Colorado School of Mines, Golden, CO.
[13] Ramazan, S.; Dimitrakopoulos, R., Recent applications of operations research and efficient MIP formulations in open pit mining, SME Transactions, 316 (2004)
[14] Seymour, F., 1995. Pit limit parameterization from modified 3D Lerchs-Grossmann algorithm. SME Preprint Number: 95-96.; Seymour, F., 1995. Pit limit parameterization from modified 3D Lerchs-Grossmann algorithm. SME Preprint Number: 95-96.
[15] Tolwinski, B., 1998. Scheduling production for open pit mines. In: Proc. 27th Internat. APCOM Symp., pp. 651-662.; Tolwinski, B., 1998. Scheduling production for open pit mines. In: Proc. 27th Internat. APCOM Symp., pp. 651-662.
[16] Wang, Q., Sevim, H., 1993. An alternative to parameterization in finding a series of maximum-metal pits for production planning. In: Proc. 24th Internat. APCOM Symp., pp. 168-175.; Wang, Q., Sevim, H., 1993. An alternative to parameterization in finding a series of maximum-metal pits for production planning. In: Proc. 24th Internat. APCOM Symp., pp. 168-175.
[17] Warton, C., 2000. Add value to your mine through improved long term scheduling. In: Whittle North American Mine Planning Conference, CO.; Warton, C., 2000. Add value to your mine through improved long term scheduling. In: Whittle North American Mine Planning Conference, CO.
[18] Whittle, J., 1988. Beyond optimisation in open pit design. In: Proc. Canadian Conf. on Computer Applications in the Mineral Industries, Rotterdam, pp. 331-337.; Whittle, J., 1988. Beyond optimisation in open pit design. In: Proc. Canadian Conf. on Computer Applications in the Mineral Industries, Rotterdam, pp. 331-337.
[19] Whittle, D., 2000. Proteus environment: Sensitivity work made easy. In: Whittle North American Mine Planning Conference, CO.; Whittle, D., 2000. Proteus environment: Sensitivity work made easy. In: Whittle North American Mine Planning Conference, CO.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.