IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v67y2021i5p3087-3103.html
   My bibliography  Save this article

Lane’s Algorithm Revisited

Author

Listed:
  • Marcos Goycoolea

    (Business School, Universidad Adolfo Ibáñez, Peñalólen 7941169, Chile)

  • Patricio Lamas

    (Business School, Universidad Adolfo Ibáñez, Peñalólen 7941169, Chile)

  • Bernardo K. Pagnoncelli

    (Business School, Universidad Adolfo Ibáñez, Peñalólen 7941169, Chile)

  • Adriana Piazza

    (Department of Economics, Faculty of Economics and Business, University of Chile, Santiago 8330015, Chile)

Abstract

In 1964, Kenneth Lane proposed an algorithm to optimize the production schedule of a single-metal, single-processor open pit mine. For this, he proposed a policy based on varying, over time, the so-called “cutoff grade”—or grade threshold used to determine if extracted material should be ore (processed material) or waste (thrown away). Lane’s algorithm had a profound impact on the mining industry. However, though it has been used in multiple commercial software systems and has traditionally been taught to every aspiring mining engineer, it is widely considered a heuristic, and little is known regarding the quality of the solutions it produces. In this paper, we formally study Lane’s problem. We show that Lane’s algorithm can be viewed as an approximate dynamic programming scheme and that Lane’s optimality conditions can be formally derived in two different ways: by considering a variant of the problem where the future value function is linearly approximated or by deriving the optimality conditions of a continuous-time version of the problem. We further show that Lane’s algorithm can naturally be extended to this continuous-time version of the problem and that when this algorithm converges, it converges to an optimal solution. Finally, through a reformulation, we show that Lane’s original problem can be solved using convex mixed-integer programming. Though hypothetical counterexamples can be constructed, computational experiments prove that Lane’s algorithm can produce the optimal solution in every real-world data set tested, thereby lending solid support for its practical application.

Suggested Citation

  • Marcos Goycoolea & Patricio Lamas & Bernardo K. Pagnoncelli & Adriana Piazza, 2021. "Lane’s Algorithm Revisited," Management Science, INFORMS, vol. 67(5), pages 3087-3103, May.
    • Handle: RePEc:inm:ormnsc:v:67:y:2021:i:5:p:3087-3103
    DOI: 10.1287/mnsc.2020.3685
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2020.3685
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2020.3685?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
    ---><---

    References listed on IDEAS

    as
    1. Asad, Mohammad Waqar Ali & Qureshi, Muhammad Asim & Jang, Hyongdoo, 2016. "A review of cut-off grade policy models for open pit mining operations," Resources Policy, Elsevier, vol. 49(C), pages 142-152.
    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. Biswas, Pritam & Sinha, Rabindra Kumar & Sen, Phalguni, 2023. "A review of state-of-the-art techniques for the determination of the optimum cut-off grade of a metalliferous deposit with a bibliometric mapping in a surface mine planning context," Resources Policy, Elsevier, vol. 83(C).
    2. Ashish Kumar & Roussos Dimitrakopoulos & Marco Maulen, 2020. "Adaptive self-learning mechanisms for updating short-term production decisions in an industrial mining complex," Journal of Intelligent Manufacturing, Springer, vol. 31(7), pages 1795-1811, October.
    3. Guo, Jianxin & Tan, Xianchun & Zhu, Kaiwei & Cheng, Yonglong, 2024. "Integrated management of abatement technology investment and resource extraction," Resources Policy, Elsevier, vol. 92(C).
    4. Zheng, Xiaolei & Nguyen, Hoang & Bui, Xuan-Nam, 2021. "Exploring the relation between production factors, ore grades, and life of mine for forecasting mining capital cost through a novel cascade forward neural network-based salp swarm optimization model," Resources Policy, Elsevier, vol. 74(C).
    5. Khan, Asif & Asad, Mohammad Waqar Ali, 2019. "A method for optimal cut-off grade policy in open pit mining operations under uncertain supply," Resources Policy, Elsevier, vol. 60(C), pages 178-184.
    6. Khan, Asif & Asad, Mohammad Waqar Ali, 2021. "A mixed integer programming based cut-off grade model for open-pit mining of complex poly-metallic resources," Resources Policy, Elsevier, vol. 72(C).
    7. Kuangyuan Zhang & Richard Olawoyin & Antonio Nieto & Andrew N. Kleit, 2018. "Risk of commodity price, production cost and time to build in resource economics," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 20(6), pages 2521-2544, December.
    8. Paithankar, Amol & Chatterjee, Snehamoy & Goodfellow, Ryan & Asad, Mohammad Waqar Ali, 2020. "Simultaneous stochastic optimization of production sequence and dynamic cut-off grades in an open pit mining operation," Resources Policy, Elsevier, vol. 66(C).
    9. Yasrebi, Amir Bijan & Hezarkhani, Ardeshir & Afzal, Peyman, 2017. "Application of Present Value-Volume (PV-V) and NPV-Cumulative Total Ore (NPV-CTO) fractal modelling for mining strategy selection," Resources Policy, Elsevier, vol. 53(C), pages 384-393.
    10. Paithankar, Amol & Chatterjee, Snehamoy & Goodfellow, Ryan, 2021. "Open-pit mining complex optimization under uncertainty with integrated cut-off grade based destination policies," Resources Policy, Elsevier, vol. 70(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:inm:ormnsc:v:67:y:2021:i:5:p:3087-3103. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.