Performance analysis and best implementations of old and new algorithms for the open-pit mining problem

Operations Research

Volumn 48, Issue 6, 2000, Pages 894-914

  Hochbaum, Dorit S ^a   Chen, Anna ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COST BENEFIT ANALYSIS; DATA PROCESSING; MATHEMATICAL MODELS; OPEN PIT MINING; ORE DEPOSIT GEOLOGY; SENSITIVITY ANALYSIS;

GEOLOGICAL PREDICTIONS; PUSH-RELABEL ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0034313704     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.6.894.12392     Document Type: Article

References (45)

1. Ahuja, R. K., J. B., Orlin. 1989. A fast and simple algorithm for the maximum flow problem. Oper. Res. 37(5) 748-759.
2. Alford, C. G., J. Whittle. 1986. Application of Lerchs-Grossmann pit optimization to the design of open pit mines. AusIMM/IE Aust Newman Combined Group, Large Open Pit Mining Conference. Oct., 201-207.
3. Anderson, R. J., J. C. Setubal. 1993. Goldberg's algorithm for maximum flow in perspective: A computational study. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12 1-18.
4. Badics, T., E. Boros. 1993. Implementing a maximum flow algorithm: experiments with dynamic trees. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12 43-63.
5. Balinski, M. L. 1970. On a selection problem. Management Sci. 17(3) 230-231.
6. Barnes, R. J., T. B. Johnson. 1982. Bounding techniques for the ultimate pit limit problem. Proc. 17th Internat. APCOM Symposium, 263-273.
7. Caccetta, L., L. M. Giannini. 1988. The generation of minimum search patterns in the optimum design of open pit mines. AusIMM Bull. Proc. 293(5) 57-61.
8. _, _. 1985. On bounding techniques for the optimum pit limit problem. Proc. AusIMM 290(4) 87-89.
9. Coleou, T. 1989. Technical parameterization of reserves for open pit design and mine planning. Proc. 21st Internat. APCOM Symposium, 485-494.
10. Dagdelen, K., D. Francois-Bongarcon. 1982. Towards the complete double parameterization of recovered reserves in open pit mining. Proc. 17th Internat. APCOM Symposium, 288-296.
11. _, T. B. Johnson. 1986. Optimum open pit mine production scheduling by Lagrangian parameterization. Proc. 19th Internat. APCOM Symposium, 127-142.
12. Derigs, U., W. Meier. 1989. Implementing Goldberg's max-flow algorithm - A computational investigation. ZOR - Methods Model Oper. Res. 33 383-403.
13. Dowd, P. A., A. H. Onur. 1992. Optimising open pit design and sequencing. Proc. 23rd Internat. APCOM Symposium, 411-422.
14. Ford, L. R., Jr., D. R. Fulkerson. 1957. A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canad. J. Math. 9 210-218.
15. Francois-Bongarcon, D., D. Guibal. 1984. Parameterization of optimal designs of an open pit - Beginning of a new phase of research. Trans. Soc. Mining Engineers of AIME 274 1801-1805.
16. _, _. 1982. Algorithms for parameterizing reserves under different geometrical constraints. Proc. 17th Internat. APCOM Symp., 297-309.
17. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1) 30-55.
18. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
19. _, _, L. Stockmeyer. 1976. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 237-267.
20. Giannini, L. M., L. Caccetta, P. Kelsey, S. Carras. 1991. PITOPTIM: A new high speed network flow technique for optimum pit design facilitating rapid sensitivity analysis. AusIMM Proc. 2 57-62.
21. Goldberg, A. V., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35 921-940.
22. _. 1987. Efficient graph algorithms for sequential and parallel computers. Ph.D. Thesis, MIT, Cambridge, MA.
23. Hochbaum, D. S. 1996. A new-old algorithm for minimum cut on closure graphs. Working paper.
24. Hochbaum, D. S. 1997. The pseudoflow algorithm: A new algorithm for the maximum flow problem. Working paper, May.
25. Huttagosol, P., R. Cameron. 1992. A computer design of ultimate pit limit by using transportation algorithm. Proc. 23rd Internat. APCOM Symp., 443-460.
26. Johnson, T. B. 1968. Optimum open pit mine production scheduling. Ph.D. Thesis, Dept. of IEOR, University of California, Berkeley, CA.
27. _, W. R. Sharp. 1971. A three-dimensional dynamic programming method for optimal ultimate open pit design. U.S. Bureau of Mines, Report of Investigation 7553.
28. Kim, Y. C. 1978. Ultimate pit limit design methodologies using computer models - The state of the art. Mining Engrg. 30 1454-1459.
29. Koborov, S. 1974. Method for determining optimal open pit limits. Rapport Technique ED 74-R-4, Dept. of Mineral Engineering, Ecole Polytechnique de Montreal, Canada, February.
30. Koenigsberg, E. 1982. The optimum contours of an open pit mine: An application of dynamic programming. Proc. 17th Internat. APCOM Symp. 274-287.
31. Lerchs, H., I. F. Grossmann. 1965. Optimum design of open-pit mines. Transactions, C.I.M. LXVIII 17-24.
32. Nguyen, Q. C., V. Venkateswaran. 1993. Implementations of the Goldberg-Tarjan maximum flow algorithm. DIMACS Series in Discrete Math. Theoret. Comput. Sci. 12 19-41.
33. Pana, M. T. 1965. The simulation approach to open pit design. Proc. 5th APCOM Symp. Tucson, AZ.
34. Picard, J. C. 1976. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22 1268-1272.
35. Rhys, J. M. W. 1970. A selection problem of shared fixed costs and network flows. Management Sci. 17(3) 200-207.
36. Robinson, R. H., N. B. Prenn. 1977. An open pit design model. Proc. 15th Internat. APCOM Symp. 1-9.
37. Seymour, F. 1994a. Pit limit parameterization from modified 3D Lerchs-Grossmann algorithm. Working paper.
38. _. 1994b. Finding the mining sequence and cutoff grade schedule that maximizes net present value. Working paper.
39. Vallet, R. 1976. Optimisation mathematique de l'exploitation d'une mine a ciel ouvert ou le problem de l'enveloppe. Ann. Mine de Belgique February 113-135.
40. Wang, Q., H. Sevim. 1993. An alternative to parameterization in finding a series of maximum-metal pits for production planning. Proc. 24th Internat. APCOM Symp. 168-175.
41. Whittle, J. 1989. The facts and fallacies of open pit optimization. Working paper.
42. _, L. I. Rozman. 1992. Open pit design in the 90s. Working paper.
43. Yegulalp, T. M., A. J. Arias. 1992. A fast algorithm to solve the ultimate pit limit problem. Proc. 23rd Internat. APCOM Symp. 391-397.
44. _, A. J. Arias, P. Muduli, Y. Xi. 1993. New development in ultimate pit limit problem solution methods. SME Trans. 294 1853-1857.
45. Zhao, Y., Y. C. Kim. 1992. A new optimum pit limit design algorithm. Proc. 23rd Internat. APCOM Symp., 423-434.