Paper Info
Title
A New Strategy Based on GRASP to Solve a Macro Mine Planning
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.
Year
DOI
Venue
2009
10.1007/978-3-642-04125-9_51
ISMIS
Keywords
Field
DocType
greedy randomized adaptive search procedure,copper,constraint programming,heuristic search
Mathematical optimization,Heuristic,GRASP,Computer science,Constraint programming,Greedy algorithm,Integer programming,Artificial intelligence,Macro,Greedy randomized adaptive search procedure,Machine learning
Conference
Volume
ISSN
Citations 
5722
0302-9743
0
PageRank 
References 
Authors
0.34
8
3
Name
Order
Citations
PageRank
María Cristina Riff120023.91
Eridan Otto251.19
Xavier Bonnaire38511.88