Author： Richmond A.J. Beasley J.E.
Publisher： Springer Publishing Company
ISSN： 1381-1231
Source： Journal of Heuristics, Vol.10, Iss.2, 2004-03, pp. : 153-167
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Access to resources
Recommend
A hybrid heuristic for the maximum clique problem
Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. :
A heuristic approach to the batch sizing problem
Production Planning and Control, Vol. 12, Iss. 4, 2001-06 ,pp. :