Pattern search method for accelerating Stope boundary optimization problem in underground mining operations release_og2qwnzdojf3bibvn7ptxmqqka

by Vahid Nikbin, Elham Mardaneh, Mohammad Waqar Ali Asad, Erkan Topal

Published in figshare.com by Taylor & Francis.

2021  

Abstract

The Stope Boundary Optimization (SBO) problem refers to the layout design of production areas (stopes) in an underground mining operation. It falls within the domain of strategic mine planning and a model that addresses this problem aims to maximize profitability, offers optimal management of mineral resources and facilitates decision making around capital investments. The SBO problem is computationally complex and a method that offers solution within a reasonable computation time does not exist. In this article, a combination of a new greedy algorithm and a pattern search technique with an integer programming model is proposed. An implementation of the proposed method on three realistic case studies confirms its efficiency in generating robust solutions with a better optimality gap and considerably less computational effort.
In text/plain format

Archived Files and Locations

application/pdf  993.8 kB
file_sgbuv6tsy5bujimk5pzr5rbbwe
tandf.figshare.com (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2021-06-07
Version   v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 1343fbe6-acab-4551-b102-d3a3d7b7ef6d
API URL: JSON