A New Strategy Based on GRASP to Solve a Macro Mine Planning

Authors:
María-Cristina Riff;Eridan Otto;Xavier Bonnaire
Affiliations:
Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso, Chile;Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso, Chile;Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso, Chile
Venue:
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Year:
2009

Citing 4
Cited 0

Metaheuristics for High School Timetabling

Computational Optimization and Applications
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ants can solve constraint satisfaction problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a greedy randomized adaptive search procedure(GRASP) 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. Our mine planning problem is a large scale problem, thus in order to find an optimal solution using complete methods, the model was simplified by relaxing many constraints. We now present a Grasp algorithm which works with the complete model and it is able to find better feasible near-optimal solutions, than the complete approach that has been used until now.