Advertisement

Journal of Global Optimization

, Volume 64, Issue 3, pp 497–513 | Cite as

Gradient-constrained discounted Steiner trees I: optimal tree configurations

  • K. G. SirinandaEmail author
  • M. Brazil
  • P. A. Grossman
  • J. H. Rubinstein
  • D. A. Thomas
Article

Abstract

A gradient-constrained discounted Steiner tree T is a maximum Net Present Value (NPV) tree, spanning a given set N of nodes in space with edges whose gradients are all no more than an upper bound m which is the maximum gradient. The nodes in T but not in N are referred to as discounted Steiner points. Such a tree has costs associated with its edges and values associated with its nodes. In order to reach the nodes in the tree, the edges need to be constructed. The edges are constructed in a particular order and the costs of constructing the edges and the values at the nodes are discounted over time. In this paper, we study the optimal tree configurations so as to maximize the sum of all the discounted cash flows, known as the NPV. An application of this problem occurs in underground mining, where we want to optimally locate a junction point in the underground access network to maximize the NPV in the presence of the gradient constraint. This constraint defines the navigability conditions on mining vehicles along the underground tunnels. Labellings are essential for defining a tree configuration and indicate gradients on the edges of the network. An edge in a gradient-constrained discounted Steiner tree is labelled as an f edge, an m edge or a b edge, if the gradient is less, equal or greater than m respectively. Each tree configuration is identified by the labellings of its edges. In this paper the non-optimal sets of labellings of edges that are incident with the discounted Steiner point in a gradient-constrained discounted Steiner network are classified. This reduces the number of configurations that need to be considered when optimizing. In addition, the gradient-constrained discounted Steiner point algorithm is outlined.

Keywords

Gradient constraint Network optimisation Optimal mine design Net Present Value Steiner points 

References

  1. 1.
    Sirinanda, K.G., Brazil, M., Grossman, P.A., Rubinstein, J.H., Thomas, D.A.: Optimally locating a junction point for an underground mine to maximise the net present value. ANZIAM J. 55, C315–C328 (2014)Google Scholar
  2. 2.
    Sirinanda, K.G., Brazil, M., Grossman, P.A., Rubinstein, J.H., Thomas, D.A.: Maximizing the net present value of a steiner tree. J. Glob. Optim. 62(2), 391–407 (2015)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Sirinanda, K.G., Brazil, M., Grossman, P.A., Rubinstein, J.H., Thomas, D.A.: Strategic underground mine access design to maximise the Net Present Value. Orebody modelling and strategic mine planning, pp. 235–242 (2014)Google Scholar
  4. 4.
    Trout, L.P.: Underground mine production scheduling using mixed integer programming. In: 25th International APCOM Symposium, Melbourne, Australia, pp. 395–400 (1995)Google Scholar
  5. 5.
    Smith, M., Sheppard, I., Karunatillake, G.: Using MIP for strategic life-of-mine planning of the lead/zinc stream at Mount Isa Mines. In: Proceedings of the 31st International APCOM Symposium, Cape Town, South Africa, pp. 465–474 (2003)Google Scholar
  6. 6.
    Rahal, D., Smith, M., Van Hout, G., Von Johannides, A.: The use of mixed integer linear programming for long-term scheduling in block caving mines. In: Proceedings of the 31st International APCOM Symposium, Cape Town, South Africa, pp. 123–131 (2003)Google Scholar
  7. 7.
    Nehring, M., Topal, E.: Production schedule optimisation in underground hard rock mining using mixed integer programming. Proj. Eval. Conf. AusIMM 2007(4), 169–175 (2007)Google Scholar
  8. 8.
    Newman, A.M., Rubio, E., Caro, R., Weintraub, A., Eurek, K.: A review of operations research in mine planning. Interfaces 40(3), 222–245 (2010)CrossRefGoogle Scholar
  9. 9.
    Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Elsevier, Amsterdam (1992)zbMATHGoogle Scholar
  10. 10.
    Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Gradient-constrained minimum networks (I). Fundamentals. J. Glob. Optim. 21(2), 139–155 (2001)CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Brazil, M., Thomas, D.A.: Network optimisation for the design of underground mines. Networks 49(1), 40–50 (2007)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Sirinanda, K.G., Brazil, M., Grossman, P.A., Rubinstein, J.H., Thomas, D.A.: Gradient-constrained discounted Steiner tree II—optimally locating a discounted Steiner point. J. Glob. Optim. (2015). doi: 10.1007/s10898-015-0325-0

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • K. G. Sirinanda
    • 1
    Email author
  • M. Brazil
    • 2
  • P. A. Grossman
    • 1
  • J. H. Rubinstein
    • 3
  • D. A. Thomas
    • 1
  1. 1.Department of Mechanical EngineeringThe University of MelbourneMelbourneAustralia
  2. 2.Department of Electrical and Electronic EngineeringThe University of MelbourneMelbourneAustralia
  3. 3.Department of Mathematics and StatisticsThe University of MelbourneMelbourneAustralia

Personalised recommendations