Publication | Closed Access
Optimisation of stope limits using a heuristic approach
20
Citations
2
References
2004
Year
Mathematical ProgrammingNumerical AnalysisLarge-scale Global OptimizationMaximum Value NeighbourhoodEngineeringOperations ResearchSystems EngineeringCombinatorial OptimizationAbstractabstracta Heuristic AlgorithmComputational GeometryApproximation TheoryContinuous OptimizationComputer ScienceUnderground ConstructionMvn AlgorithmVariable Neighborhood SearchMine DesignOptimization ProblemStope Limits
AbstractAbstractA heuristic algorithm, termed the maximum value neighbourhood (MVN), is proposed to optimise stope boundaries. The MVN algorithm uses a 3-D fixed economic block model to locate the best neighbourhood of a block, which guarantees the maximum net value. Neighbourhoods are restricted by the mine geometry constraints. The neighbourhood concept is based on the number of mining blocks equivalent to the minimum stope size. Since several neighbourhoods are available for each block, the one that provides the maximum net value is located for inclusion in the final stope. The MVN algorithm benefits from its simplicity in both concept and implementation. It provides a 3-D analysis and can be applied to any underground mining method, although it does not guarantee the true 'optimum' stope layout.
| Year | Citations | |
|---|---|---|
Page 1
Page 1