IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v64y2016i3p497-513.html
   My bibliography  Save this article

Gradient-constrained discounted Steiner trees I: optimal tree configurations

Author

Listed:
  • K. Sirinanda
  • M. Brazil
  • P. Grossman
  • J. Rubinstein
  • D. Thomas

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. Copyright Springer Science+Business Media New York 2016

Suggested Citation

  • K. Sirinanda & M. Brazil & P. Grossman & J. Rubinstein & D. Thomas, 2016. "Gradient-constrained discounted Steiner trees I: optimal tree configurations," Journal of Global Optimization, Springer, vol. 64(3), pages 497-513, March.
    • Handle: RePEc:spr:jglopt:v:64:y:2016:i:3:p:497-513
    DOI: 10.1007/s10898-015-0326-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-015-0326-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-015-0326-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alexandra M. Newman & Enrique Rubio & Rodrigo Caro & Andrés Weintraub & Kelly Eurek, 2010. "A Review of Operations Research in Mine Planning," Interfaces, INFORMS, vol. 40(3), pages 222-245, June.
    2. K. Sirinanda & M. Brazil & P. Grossman & J. Rubinstein & D. Thomas, 2015. "Maximizing the net present value of a Steiner tree," Journal of Global Optimization, Springer, vol. 62(2), pages 391-407, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. K. Sirinanda & M. Brazil & P. Grossman & J. Rubinstein & D. Thomas, 2016. "Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point," Journal of Global Optimization, Springer, vol. 64(3), pages 515-532, March.
    2. Rafael Epstein & Marcel Goic & Andrés Weintraub & Jaime Catalán & Pablo Santibáñez & Rodolfo Urrutia & Raúl Cancino & Sergio Gaete & Augusto Aguayo & Felipe Caro, 2012. "Optimizing Long-Term Production Plans in Underground and Open-Pit Copper Mines," Operations Research, INFORMS, vol. 60(1), pages 4-17, February.
    3. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    4. Renaud Chicoisne & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Enrique Rubio, 2012. "A New Algorithm for the Open-Pit Mine Production Scheduling Problem," Operations Research, INFORMS, vol. 60(3), pages 517-528, June.
    5. Nancel-Penard, Pierre & Morales, Nelson & Cornillier, Fabien, 2022. "A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: An application to the open-pit mine block sequencing problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1088-1099.
    6. Nakousi, C. & Pascual, R. & Anani, A. & Kristjanpoller, F. & Lillo, P., 2018. "An asset-management oriented methodology for mine haul-fleet usage scheduling," Reliability Engineering and System Safety, Elsevier, vol. 180(C), pages 336-344.
    7. Pérez, Juan & Maldonado, Sebastián & González-Ramírez, Rosa, 2018. "Decision support for fleet allocation and contract renegotiation in contracted open-pit mine blasting operations," International Journal of Production Economics, Elsevier, vol. 204(C), pages 59-69.
    8. Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier, 2018. "A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling," Computational Optimization and Applications, Springer, vol. 69(2), pages 501-534, March.
    9. Noriega, Roberto & Pourrahimian, Yashar, 2022. "A systematic review of artificial intelligence and data-driven approaches in strategic open-pit mine planning," Resources Policy, Elsevier, vol. 77(C).
    10. W. Lambert & A. Newman, 2014. "Tailored Lagrangian Relaxation for the open pit block sequencing problem," Annals of Operations Research, Springer, vol. 222(1), pages 419-438, November.
    11. Jyrki Savolainen & Ramin Rakhsha & Richard Durham, 2022. "Simulation-based decision-making system for optimal mine production plan selection," Mineral Economics, Springer;Raw Materials Group (RMG);Luleå University of Technology, vol. 35(2), pages 267-281, June.
    12. Mikael Collan & Jyrki Savolainen & Pasi Luukka, 2017. "Investigating the effect of price process selection on the value of a metal mining asset portfolio," Mineral Economics, Springer;Raw Materials Group (RMG);Luleå University of Technology, vol. 30(2), pages 107-115, July.
    13. Bisera Andrić Gušavac & Selman Karagoz & Milena Popović & Dragan Pamućar & Muhammet Deveci, 2023. "Reconcilement of conflicting goals: a novel operations research-based methodology for environmental management," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(8), pages 7423-7460, August.
    14. Lorenzo Reus & Mathias Belbèze & Hans Feddersen & Enrique Rubio, 2018. "Extraction Planning Under Capacity Uncertainty at the Chuquicamata Underground Mine," Interfaces, INFORMS, vol. 48(6), pages 543-555, November.
    15. Omotehinse, Adeyinka O. & De Tomi, Giorgio, 2020. "Managing the challenges of obtaining a social license to operate in the pre-mining phase: A focus on the oil sands communities in Ondo State, Nigeria," World Development Perspectives, Elsevier, vol. 18(C).
    16. Akshay Chowdu & Peter Nesbitt & Andrea Brickey & Alexandra M. Newman, 2022. "Operations Research in Underground Mine Planning: A Review," Interfaces, INFORMS, vol. 52(2), pages 109-132, March.
    17. Lamghari, Amina & Dimitrakopoulos, Roussos, 2016. "Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty," European Journal of Operational Research, Elsevier, vol. 253(3), pages 843-855.
    18. Cinna Seifi & Marco Schulze & Jürgen Zimmermann, 2021. "Solution procedures for block selection and sequencing in flat-bedded potash underground mines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 409-440, June.
    19. Marco Schulze & Jürgen Zimmermann, 2017. "Staff and machine shift scheduling in a German potash mine," Journal of Scheduling, Springer, vol. 20(6), pages 635-656, December.
    20. Zeng, Lanyan & Liu, Shi Qiang & Kozan, Erhan & Corry, Paul & Masoud, Mahmoud, 2021. "A comprehensive interdisciplinary review of mine supply chain management," Resources Policy, Elsevier, vol. 74(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:64:y:2016:i:3:p:497-513. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.