Abstract
In this paper we introduce a simple ant-based algorithm for solving a copper mine planning problem. In the last 10 years this real-world problem has been tackled using linear integer programming and constraint programming. However, because it is a large scale problem, the model must be simplified by relaxing many constraints in order to obtain a near-optimal solution in a reasonable time. We now present an algorithm which takes into account most of the problem constraints and it is able to find better feasible solutions than the approach that has been used until now.
She was supported by the FONDEF Project: Complex Systems, and the other authors were supported by the Fondecyt Project 1040364.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burke, E., Smith, A.: Hybrid Evolutionary Techniques for the Maintenance Scheduling Problem. IEEE Transactions on Power Systems 15(1), 122–128 (2000)
Casagrande, N., Gambardella, L.M., Rizzoli, A.E.: Solving the vehicle routing problem for heating oil distribution using Ant Colony Optimisation. In: ECCO XIV. Conference of the European Chapter on Combinatorial Optimisation (2001)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for High-School Timetabling. Computational Optimization and Applications 9(3), 277–298 (1998)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Eiben, A.E., Van Hemert, J.I., Marchiori, E., Steenbeek, A.G.: Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 196–205. Springer, Heidelberg (1998)
Freuder, E.: The Many Paths to Satisfaction. In: Meyer, M. (ed.) Constraint Processing. LNCS, vol. 923, pp. 103–119. Springer, Heidelberg (1995)
Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization. McGraw-Hill, New York (1999)
Gambardella, L.M., Mastrolilli, M., Rizzoli, A.E., Zaffalon, M.: An integrated approach to the optimisation of an intermodal terminal based on efficient resource allocation and scheduling. Journal of Intelligent Manufacturing 12(5/6), 521–534 (2001)
Gunn, E.A., Cunningham, B., Forrester, D.: Dynamic programming for mine capacity planning. In: Proceedings of the 23nd APCOM Symposium, vol. 1, pp. 529–536 (1993)
Karanta, I., Mikkola, T., Bounsaythip, C., Riff, M.-C.: ”Modeling Timber Collection for Wood Processing Industry. The case of ENSO”, ERCIM Technical Report, TTE1-2-98, VTT Information Technology, Finland, Octobre (1998)
Newall, J.P.: Hybrid Methods for Automated Timetabling. PhD Thesis, Department of Computer Science, University of Nottingham, UK (1999)
Maturana, J., Riff, M.-C.: An evolutionary algorithm to solve the Short-term Electrical Generation Scheduling Problem. In: Proceedings of the Congress on Evolutionary Computation (CEC 2003), pp. 1150–1156 (2003)
Ricciardi, J., Chanda, E.: Optimising Life of Mine Production Schedules in Multiple Open Pit Mining Operations: A Study of Effects of Production Constraints on NPV. Mineral Resources Engineering 10(3), 301–314 (2001)
Riff, M.-C.: A network-based adaptive evolutionary algorithm for CSP. In: The book Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation, Ch. 22, pp. 325–339. Kluwer Academic Publisher, Dordrecht (1998)
Solnon, C.: Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation 6(4), 347–357 (2002)
Taillard, E.: Heuristic Column Generation Method for the heterogenous VRP. Recherche-Operationnelle 33, 1–14 (1999)
Tsang, E.P.K., Wang, C.J., Davenport, A., Voudouris, C., Lau, T.L.: A family of stochastic methods for constraint satisfaction and optimization. In: The First International Conference on The Practical Application of Constraint Technologies and Logic Programming, London, pp. 359–383 (1999)
Waltham, T., Waltham, A.: Foundations of Engineering Geology, 2nd edn. Routledge mot E F & N Spon (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riff, MC., Moossen, M., Bonnaire, X. (2005). Miner Ants Colony: A New Approach to Solve a Mine Planning Problem. In: Famili, A.F., Kok, J.N., Peña, J.M., Siebes, A., Feelders, A. (eds) Advances in Intelligent Data Analysis VI. IDA 2005. Lecture Notes in Computer Science, vol 3646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552253_30
Download citation
DOI: https://doi.org/10.1007/11552253_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28795-7
Online ISBN: 978-3-540-31926-9
eBook Packages: Computer ScienceComputer Science (R0)