Abstract
The open pit mining problem aims at correctly identifying the set of blocks of a given mine to be extracted in order to maximize the net present value of the production. During the last years, different techniques have been proposed to solve mining problems, which range from the classic mathematical programming to more recent ones such as the metaheuristics. In this paper we illustrate how this problem can easily be solved by a relatively modern and declarative programming paradigm called constraint programming.
Chapter PDF
Similar content being viewed by others
References
Boland, N., Dumitrescu, I., Froyland, G., Gleixner, A.: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Computers & Operations Research 36(4), 1064–1089 (2009)
Caccetta, L., Hill, S.: An application of branch and cut to open pit mine scheduling. Journal of Global Optimization 27(2-3), 349–365 (2003)
Chenouard, R., Granvilliers, L., Soto, R.: Model-Driven Constraint Programming. In: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pp. 236–246 (2008)
Chicoisne, R., Espinoza, D., Goycoolea, M., Moreno, E., Rubio, E.: A New Algorithm for the Open-Pit Mine Production Scheduling Problem. Operations Research 60(3), 517–528 (2012)
Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: Dynamic Selection of Enumeration Strategies for Solving Constraint Satisfaction Problems. Romanian Journal of Information Science and Technology 15(2), 106–128 (2012)
Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-based autonomous search. In: Stephanidis, C. (ed.) Posters, Part I, HCII 2011. CCIS, vol. 173, pp. 561–565. Springer, Heidelberg (2011)
Crawford, B., Soto, R., Montecinos, M., Castro, C., Monfroy, E.: Monfroy, E.: A framework for autonomous search in the eclipse solver. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds.) IEA/AIE 2011, Part I. LNCS, vol. 6703, pp. 79–84. Springer, Heidelberg (2011)
Denby, B., Schofield, D.: Open-pit design and scheduling by use of genetic algorithms. Transactions of the Institution of Mining and Metallurgy, Section A: Mining Industry 26, A21–A26 (1994)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)
Ramazan, S.: The new Fundamental Tree Algorithm for production scheduling of open pit mines. European Journal of Operational Research 177(2), 1153–1166 (2007)
Soto, R.: Controlling search in constrained-object models. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol. 6433, pp. 582–591. Springer, Heidelberg (2010)
Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A hybrid ac3-tabu search algorithm for solving sudoku puzzles. Expert Syst. Appl. 40(15), 5817–5821 (2013)
Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A Pre-filtered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems. The Scientific World Journal, Article ID 465359 (2014)
Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 607–617. Springer, Heidelberg (2012)
Soto, R., Crawford, B., Monfroy, E., Palma, W., Paredes, F.: Nurse and Paramedic Rostering with Constraint Programming: A Case Study. Romanian Journal of Information Science and Technology 16(1), 52–64 (2013)
Soto, R., Crawford, B., Monfroy, E., Paredes, F.: Syntax Extensions for a Constrained-Object Language via Dynamic Parser Cooperation. Studies in Informatics and Control 21(1), 41–48 (2012)
Soto, R., Granvilliers, L.: The Design of COMMA: An Extensible Framework for Mapping Constrained Objects to Native Solver Models. In: Proceedings of IEEE ICTAI, pp. 243–250 (2007)
Soto, R., Kjellerstrand, H., Duran, O., Crawford, B., Monfroy, E., Paredes, F.: Cell formation in group technology using constraint programming and boolean satisfiability. Expert Syst. Appl. 39(13), 11423–11427 (2012)
Zhang, M.: Combining genetic algorithms and topological sort to optimize open-pit mine plans. In: Proceedings of the 15th Mine Planning and Equipment Selection, pp. 1234–1239 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Crawford, B., Soto, R., Zec, C., Monfroy, E., Paredes, F. (2014). Easy Modeling of Open Pit Mining Problems via Constraint Programming. In: Stephanidis, C. (eds) HCI International 2014 - Posters’ Extended Abstracts. HCI 2014. Communications in Computer and Information Science, vol 434. Springer, Cham. https://doi.org/10.1007/978-3-319-07857-1_91
Download citation
DOI: https://doi.org/10.1007/978-3-319-07857-1_91
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07856-4
Online ISBN: 978-3-319-07857-1
eBook Packages: Computer ScienceComputer Science (R0)