IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i11p8970-d1162211.html
   My bibliography  Save this article

Planning an Integrated Stockyard–Port System for Smart Iron Ore Supply Chains via VND Optimization

Author

Listed:
  • Álvaro D. O. Lopes

    (Department of Electrical Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil)

  • Helder R. O. Rocha

    (Department of Electrical Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil
    These authors contributed equally to this work.)

  • Marcos W. J. Servare Junior

    (Department of Electrical Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil
    Department of Industrial Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil)

  • Renato E. N. Moraes

    (Department of Industrial Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil)

  • Jair A. L. Silva

    (Department of Electrical Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil
    Sensors and Smart Systems Group, Institute of Engineering, Hanze University of Applied Sciences, 9747 AS Groningen, The Netherlands)

  • José L. F. Salles

    (Department of Electrical Engineering, Federal University of Espírito Santo, Av. Fernando Ferrari, 514, Vitória 29075-910, ES, Brazil
    These authors contributed equally to this work.)

Abstract

Stockyard–port planning is a complex combinatorial problem that has been studied primarily through simulation or optimization techniques. However, due to its classification as non-deterministic polynomial-time hard (NP-hard), the generation of optimal or near-optimal solutions in real time requires optimization techniques based on heuristics or metaheuristics. This paper proposes a deterministic simulation and a meta-heuristic algorithm to address the stockyard–port planning problem, with the aim of reducing the time that ships spend in berths. The proposed algorithm is based on the ore handling operations in a real stockyard–port terminal, considering the interaction of large physical equipment and information about the production processes. The stockyard–port system is represented by a graph in order to define ship priorities for planning and generation of an initial solution through a deterministic simulation. Subsequently, the Variable Neighborhood Descent (VND) meta-heuristic is used to improve the initial solution. The convergence time of VND ranged from 1 to 190 s, with the total number of ships served in the berths varying from 10 to 1000 units, and the number of stockyards and berths varying from 11 to 15 and 3 to 5, respectively. Simulation results demonstrate the efficiency of the proposed algorithm in determining the best allocation of stockpiles, berths, car-dumpers, and conveyor belts. The results also show that increasing the number of conveyor belts is an important strategy that decreases environmental impacts due to exposure of the raw material to the atmosphere, while also increasing the stockyard–port productivity. This positive impact is greater when the number yards and ship berths increases. The proposed algorithm enables real-time decision-making from small and large instances, and its implementation in an iron ore stockyard–port that uses Industry 4.0 principles is suitable.

Suggested Citation

  • Álvaro D. O. Lopes & Helder R. O. Rocha & Marcos W. J. Servare Junior & Renato E. N. Moraes & Jair A. L. Silva & José L. F. Salles, 2023. "Planning an Integrated Stockyard–Port System for Smart Iron Ore Supply Chains via VND Optimization," Sustainability, MDPI, vol. 15(11), pages 1-20, June.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:11:p:8970-:d:1162211
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/11/8970/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/11/8970/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Catherine Marinagi & Panagiotis Reklitis & Panagiotis Trivellas & Damianos Sakas, 2023. "The Impact of Industry 4.0 Technologies on Key Performance Indicators for a Resilient Supply Chain 4.0," Sustainability, MDPI, vol. 15(6), pages 1-31, March.
    2. Pierre Hansen & Nenad Mladenović & Jack Brimberg & José A. Moreno Pérez, 2019. "Variable Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 57-97, Springer.
    3. Menezes, Gustavo Campos & Mateus, Geraldo Robson & Ravetti, Martín Gómez, 2017. "A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports," European Journal of Operational Research, Elsevier, vol. 258(3), pages 926-937.
    4. Marcos Wagner Jesus Servare Junior & Helder Roberto de Oliveira Rocha & José Leandro Félix Salles & Sylvain Perron, 2020. "A Linear Relaxation-Based Heuristic for Iron Ore Stockyard Energy Planning," Energies, MDPI, vol. 13(19), pages 1-18, October.
    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. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    2. Marcos Wagner Jesus Servare Junior & Helder Roberto de Oliveira Rocha & José Leandro Félix Salles & Sylvain Perron, 2020. "A Linear Relaxation-Based Heuristic for Iron Ore Stockyard Energy Planning," Energies, MDPI, vol. 13(19), pages 1-18, October.
    3. Enna Hirata & Daisuke Watanabe & Athanasios Chalmoukis & Maria Lambrou, 2024. "A Topic Modeling Approach to Determine Supply Chain Management Priorities Enabled by Digital Twin Technology," Sustainability, MDPI, vol. 16(9), pages 1-15, April.
    4. Gust, Gunther & Schlüter, Alexander & Feuerriegel, Stefan & Úbeda, Ignacio & Lee, Jonathan T. & Neumann, Dirk, 2024. "Designing electricity distribution networks: The impact of demand coincidence," European Journal of Operational Research, Elsevier, vol. 315(1), pages 271-288.
    5. Yue Chen & Yisong Li, 2024. "Storage Location Assignment for Improving Human–Robot Collaborative Order-Picking Efficiency in Robotic Mobile Fulfillment Systems," Sustainability, MDPI, vol. 16(5), pages 1-25, February.
    6. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    7. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    8. Bouzekri, Hamza & Bara, Najat & Alpan, Gülgün & Giard, Vincent, 2022. "An integrated Decision Support System for planning production, storage and bulk port operations in a fertilizer supply chain," International Journal of Production Economics, Elsevier, vol. 252(C).
    9. Andrei V. Nikolaev & Egor V. Klimov, 2024. "Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-31, July.
    10. Nevena Čolić & Pavle Milošević & Ivana Dragović & Miljan S. Ćeranić, 2024. "IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    11. Dimitrije D. Čvokić & Yury A. Kochetov & Aleksandr V. Plyasunov & Aleksandar Savić, 2022. "A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ ( r ∣ p ) hub–centroid problem under the price war," Journal of Global Optimization, Springer, vol. 83(3), pages 405-444, July.
    12. Gleb Belov & Natashia L. Boland & Martin W. P. Savelsbergh & Peter J. Stuckey, 2020. "Logistics optimization for a coal supply chain," Journal of Heuristics, Springer, vol. 26(2), pages 269-300, April.
    13. Zhang, Sicheng & Li, Xiang & Zhang, Bowen & Wang, Shouyang, 2020. "Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system," European Journal of Operational Research, Elsevier, vol. 283(2), pages 441-460.
    14. Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
    15. João Luiz Marques Andrade & Gustavo Campos Menezes, 2023. "A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports," Journal of Heuristics, Springer, vol. 29(1), pages 39-76, February.

    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:gam:jsusta:v:15:y:2023:i:11:p:8970-:d:1162211. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.