Optimal layout of underground mining levels

"A mathematical procedure for determining the underground mining level layout which minimizes the total costs of excavation and haulage is described. This procedure has the advantage over previous graphical procedures of being easily amenable to microcomputers. The paper demonstrates through examples how the procedure can be applied to minimizing discounted costs of level layout as well as providing the optimal location of a production shaft.IntroductionIn recent years there have been numerous publications in mining journals concerning the minimization of mine haulage costs. With the rapid escalation of energy costs during the last decade it is not surprising that several studies applying queuing theory, simulation and mathematical programming to mining related transportation problems have been successfully undertaken. Because of the increasing availability of various sizes of computers these techniques have gained considerable popularity as evidenced by the numerous commercial packages presently being marketed.The publications concerned with haulage cost minimization are generally concluded along the lines of ' ... haulage costs at production rate x will be minimized by assigning y units to location z...'. Details about the route followed and whether it guarantees a minimization of costs are seldom considered. Route data has to date been manually resolved and used for input to developed programs. It would appear that no program has been developed to date which simultaneously minimizes costs by both fleet assignment and routing network resolution.Another important factor in transportation problems is the investment cost associated with the routes; road construction costs or, in the case of underground levels, drift excavation costs. Except for special cases the transport network which minimizes haulage costs only will not provide a minimum excavation cost solution.Zarnbo(1) illustrates by graphical and mathematical procedures how central 'facilities' can be located to simultaneously minimize investment in the transport network and haulage costs. Unfortunately these procedures and others recently applied to mine haulage problems do not provide solutions to the generalized problem. Also because these procedures are geared to graphical solutions and hand computations whereby certain possibilities can be 'visually' eliminated, they can be tedious to program and present storage capacity constraints with current microcomputers."