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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Riff, M. C., Moossen, M., & Bonnaire, X. (2005). Miner ants colony: A new approach to solve a mine planning problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3646 LNCS, pp. 328–338). Springer Verlag. https://doi.org/10.1007/11552253_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
