Skip to main content
Log in

Gradient-constrained discounted Steiner trees I: optimal tree configurations

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  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. 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)

    Article  MathSciNet  Google Scholar 

  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)

  4. Trout, L.P.: Underground mine production scheduling using mixed integer programming. In: 25th International APCOM Symposium, Melbourne, Australia, pp. 395–400 (1995)

  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)

  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)

  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. 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)

    Article  Google Scholar 

  9. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Elsevier, Amsterdam (1992)

    MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Brazil, M., Thomas, D.A.: Network optimisation for the design of underground mines. Networks 49(1), 40–50 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. G. Sirinanda.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sirinanda, K.G., Brazil, M., Grossman, P.A. et al. Gradient-constrained discounted Steiner trees I: optimal tree configurations. J Glob Optim 64, 497–513 (2016). https://doi.org/10.1007/s10898-015-0326-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-015-0326-z

Keywords

Navigation