An Iterative Construction Heuristic for the Ore Selection Problem

Authors:
A. J. Richmond;J. E. Beasley
Affiliations:
Earth Science and Engineering Department, Imperial College, London, SW7 2AZ, UK. a.richmond@imperial.ac.uk;The Management School, Imperial College, London, SW7 2AZ, UK. j.beasley@imperial.ac.uk
Venue:
Journal of Heuristics
Year:
2004

Citing 6
Cited 0

Systematic and nonsystematic search strategies

Proceedings of the first international conference on Artificial intelligence planning systems
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
The Slack Method: A New Method for Static Allocation ofHard Real-Time Tasks

Real-Time Systems
Automating planning and scheduling of shuttle payload operations

Artificial Intelligence - Special issue on applications of artificial intelligence
Heuristics for cardinality constrained portfolio optimisation

Computers and Operations Research
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ore selection problem involves choosing a processing option for a number of mining blocks that maximises the expected payoff for a given level of financial risk. An innovative neighbourhood search heuristic is proposed for the ore selection problem. This iterative construction heuristic employs a stochastic demolition and reconstruction strategy. Computational experiments with this heuristic for two ore selection problem instances, one involving 2,500 blocks and the other involving 78,000 blocks, are given. These problem instances are made publicly available for use by future workers. Our computational experiments indicate that the proposed heuristic produces better quality solutions faster than a relay hybrid (constructive-simulated annealing) heuristic.