English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

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