Premium
Network optimization for the design of underground mines
Author(s) -
Brazil M.,
Thomas D.A.
Publication year - 2007
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20140
Subject(s) - haulage , computer science , navigability , mathematical optimization , network planning and design , metric (unit) , optimization problem , obstacle , operations research , mathematics , engineering , algorithm , operations management , computer network , cartography , law , political science , rope , geography
Efficient methods to model and optimize the design of open‐cut mines have been known for many years. The design of the infrastructure of underground mines has a similar potential for optimization and strategic planning. In this article we discuss the use of network optimization to tackle this problem. The idea is to design a connected system of declines, ramps, drives, and possibly shafts, to minimize capital development and haulage costs over the lifetime of a mine. This can be modeled as a variation on the Steiner problem, with suitable metric and constraints. These constraints include: an upper bound on the absolute gradient of arcs in the embedded network (typically 1/7), turning circle restrictions for navigability, and obstacle avoidance. Here we give an overview of the literature, focussing on our published work. We investigate the way in which this design problem can be modeled as a network optimization problem that accurately reflects the real costs involved while remaining mathematically tractable. Our approach is to first establish a fundamental model, which principally captures the development costs of the mine, and to study its geometric properties. We then outline more complicated generalized models, which add extra costs and constraints to the fundamental model but are still solvable. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 40–50 2007