IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v207y2010i2p1041-1051.html
   My bibliography  Save this article

A hybrid heuristic algorithm for the open-pit-mining operational planning problem

Author

Listed:
  • Souza, M.J.F.
  • Coelho, I.M.
  • Ribas, S.
  • Santos, H.G.
  • Merschmann, L.H.C.

Abstract

This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NP-hard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search. The proposed algorithm was tested using a set of real-data problems and the results were validated by running the CPLEX optimizer with the same data. This solver used a mixed integer programming model also developed in this work. The computational experiments show that the proposed algorithm is very competitive, finding near optimal solutions (with a gap of less than 1%) in most instances, demanding short computing times.

Suggested Citation

  • Souza, M.J.F. & Coelho, I.M. & Ribas, S. & Santos, H.G. & Merschmann, L.H.C., 2010. "A hybrid heuristic algorithm for the open-pit-mining operational planning problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1041-1051, December.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:2:p:1041-1051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00387-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Hansen, Pierre & Mladenovic, Nenad & Moreno Pérez, Jos´e A., 2008. "Variable neighborhood search," European Journal of Operational Research, Elsevier, vol. 191(3), pages 593-595, December.
    2. Romero, Carlos, 2004. "A general structure of achievement function for a goal programming model," European Journal of Operational Research, Elsevier, vol. 153(3), pages 675-686, March.
    3. Robert Fourer & David M. Gay & Brian W. Kernighan, 1990. "A Modeling Language for Mathematical Programming," Management Science, INFORMS, vol. 36(5), pages 519-554, May.
    4. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    5. Mladenovic, Nenad & Drazic, Milan & Kovacevic-Vujcic, Vera & Cangalovic, Mirjana, 2008. "General variable neighborhood search for the continuous optimization," European Journal of Operational Research, Elsevier, vol. 191(3), pages 753-770, December.
    6. Hansen, Pierre & Oguz, Ceyda & Mladenovic, Nenad, 2008. "Variable neighborhood search for minimum cost berth allocation," European Journal of Operational Research, Elsevier, vol. 191(3), pages 636-649, December.
    7. Sgurev, V. & Vassilev, V. & Dokev, N. & Genova, K. & Drangajov, S. & Korsemov, Ch. & Atanassov, A., 1989. "TRASY -- An automated system for real-time control of the industrial truck haulage in open-pit mines," European Journal of Operational Research, Elsevier, vol. 43(1), pages 44-52, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Franco-Sepúlveda, Giovanni & Del Rio-Cuervo, Juan Camilo & Pachón-Hernández, María Angélica, 2019. "State of the art about metaheuristics and artificial neural networks applied to open pit mining," Resources Policy, Elsevier, vol. 60(C), pages 125-133.
    2. S.R. Patterson & E. Kozan & P. Hyland, 2016. "An integrated model of an open-pit coal mine: improving energy efficiency decisions," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4213-4227, July.
    3. Patterson, S.R. & Kozan, E. & Hyland, P., 2017. "Energy efficient scheduling of open-pit coal mine trucks," European Journal of Operational Research, Elsevier, vol. 262(2), pages 759-770.
    4. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    5. Coelho, Vitor N. & Coelho, Igor M. & Coelho, Bruno N. & Reis, Agnaldo J.R. & Enayatifar, Rasul & Souza, Marcone J.F. & Guimarães, Frederico G., 2016. "A self-adaptive evolutionary fuzzy model for load forecasting problems on smart grid environment," Applied Energy, Elsevier, vol. 169(C), pages 567-584.
    6. Coelho, Vitor N. & Coelho, Igor M. & Coelho, Bruno N. & Cohen, Miri Weiss & Reis, Agnaldo J.R. & Silva, Sidelmo M. & Souza, Marcone J.F. & Fleming, Peter J. & Guimarães, Frederico G., 2016. "Multi-objective energy storage power dispatching using plug-in vehicles in a smart-microgrid," Renewable Energy, Elsevier, vol. 89(C), pages 730-742.
    7. 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).
    8. de Castro Pena, Guilherme & Santos, Andréa Cynthia & Prins, Christian, 2023. "Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters," European Journal of Operational Research, Elsevier, vol. 306(1), pages 156-172.
    9. Matamoros, Martha E. Villalba & Dimitrakopoulos, Roussos, 2016. "Stochastic short-term mine production schedule accounting for fleet allocation, operational considerations and blending restrictions," European Journal of Operational Research, Elsevier, vol. 255(3), pages 911-921.
    10. Zhang, Hong & Nguyen, Hoang & Bui, Xuan-Nam & Nguyen-Thoi, Trung & Bui, Thu-Thuy & Nguyen, Nga & Vu, Diep-Anh & Mahesh, Vinyas & Moayedi, Hossein, 2020. "Developing a novel artificial intelligence model to estimate the capital cost of mining projects using deep neural network-based ant colony optimization algorithm," Resources Policy, Elsevier, vol. 66(C).
    11. Zhang, Jian & Dimitrakopoulos, Roussos G., 2017. "A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty," European Journal of Operational Research, Elsevier, vol. 258(2), pages 617-625.
    12. Lamghari, Amina & Dimitrakopoulos, Roussos, 2012. "A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty," European Journal of Operational Research, Elsevier, vol. 222(3), pages 642-652.
    13. King, Barry & Goycoolea, Marcos & Newman, A., 2017. "Optimizing the open pit-to-underground mining transition," European Journal of Operational Research, Elsevier, vol. 257(1), pages 297-309.
    14. Strang, Kenneth David, 2012. "Importance of verifying queue model assumptions before planning with simulation software," European Journal of Operational Research, Elsevier, vol. 218(2), pages 493-504.
    15. Huang, Baobin & Tang, Lixin & Baldacci, Roberto & Wang, Gongshu & Sun, Defeng, 2023. "A metaheuristic algorithm for a locomotive routing problem arising in the steel industry," European Journal of Operational Research, Elsevier, vol. 308(1), pages 385-399.
    16. Chaowasakoo, Patarawan & Seppälä, Heikki & Koivo, Heikki & Zhou, Quan, 2017. "Improving fleet management in mines: The benefit of heterogeneous match factor," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1052-1065.
    17. 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.

    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. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    2. Ilic, Aleksandar & Urosevic, Dragan & Brimberg, Jack & Mladenovic, Nenad, 2010. "A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 206(2), pages 289-300, October.
    3. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    4. J Euchi & H Chabchoub, 2011. "Hybrid metaheuristics for the profitable arc tour problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2013-2022, November.
    5. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    6. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    7. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    8. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
    9. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    10. Abraham Duarte & Eduardo G. Pardo, 2020. "Special issue on recent innovations in variable neighborhood search," Journal of Heuristics, Springer, vol. 26(3), pages 335-338, June.
    11. Jiang, Min & Leung, K.H. & Lyu, Zhongyuan & Huang, George Q., 2020. "Picking-replenishment synchronization for robotic forward-reserve warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    12. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    13. Fan Bu & Heather Nachtmann, 2023. "Literature review and comparative analysis of inland waterways transport: “Container on Barge”," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(1), pages 140-173, March.
    14. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    15. Javier Panadero & Jana Doering & Renatas Kizys & Angel A. Juan & Angels Fito, 2020. "A variable neighborhood search simheuristic for project portfolio selection under uncertainty," Journal of Heuristics, Springer, vol. 26(3), pages 353-375, June.
    16. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    17. Daniel Aloise & Pierre Hansen & Caroline Rocha & Éverton Santi, 2014. "Column generation bounds for numerical microaggregation," Journal of Global Optimization, Springer, vol. 60(2), pages 165-182, October.
    18. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    19. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    20. Yusuf Yilmaz & Can B. Kalayci, 2022. "Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery," Mathematics, MDPI, vol. 10(17), pages 1-22, August.

    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:eee:ejores:v:207:y:2010:i:2:p:1041-1051. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.