IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2020i19p5232-d424975.html
   My bibliography  Save this article

A Linear Relaxation-Based Heuristic for Iron Ore Stockyard Energy Planning

Author

Listed:
  • Marcos Wagner Jesus Servare Junior

    (Electrical Engineering Department, Federal University of Espírito Santo, Av. Fernando Ferrari, 514–Goiabeiras, Vitória, ES 29075-910, Brazil
    Group for Research in Decision Analysis, Hautes Études Commerciales de Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, QC H3T 2A7, Canada)

  • Helder Roberto de Oliveira Rocha

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

  • José Leandro Félix Salles

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

  • Sylvain Perron

    (Group for Research in Decision Analysis, Hautes Études Commerciales de Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, QC H3T 2A7, Canada)

Abstract

Planning the use of electrical energy in a bulk stockyard is a strategic issue due to its impact on efficiency and responsiveness of these systems. Empirical planning becomes more complex when the energy cost changes over time. The mathematical models currently studied in the literature consider many actors involved, such as equipment, sources, blends, and flows. Each paper presents different combinations of actors, creating their own transportation flows, thus increasing the complexity of this problem. In this work, we propose a new mixed integer linear programming (MILP) model for stockyard planning solved by a linear relaxation-based heuristic (LRBH) to minimize the plan’s energy cost. The proposed algorithm will allow the planner to find a solution that saves energy costs with an efficient process. The numerical results show a comparison between the exact and heuristic solutions for some different instances sizes. The linear relaxation approach can provide feasible solutions with a 3.99% average distance of the objective function in relation to the optimal solution (GAP) in the tested instances and with an affordable computation time in instances where the MILP was not able to provide a solution. The model is feasible for small and medium-sized instances, and the heuristic proposes a solution to larger problems to aid in management decision making.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jeners:v:13:y:2020:i:19:p:5232-:d:424975
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/19/5232/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/13/19/5232/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Thomas Kalinowski & Reena Kapoor & Martin W. P. Savelsbergh, 2017. "Scheduling reclaimers serving a stock pad at a coal terminal," Journal of Scheduling, Springer, vol. 20(1), pages 85-101, February.
    3. Dafnomilis, I. & Duinkerken, M.B. & Junginger, M. & Lodewijks, G. & Schott, D.L., 2018. "Optimal equipment deployment for biomass terminal operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 147-163.
    4. 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.
    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. Á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.

    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. 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).
    2. 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.
    3. Guo, Zijian & Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Feng, Peng, 2021. "An integrated model for vessel traffic and deballasting scheduling in coal export terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    4. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    5. 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).
    6. 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.
    7. 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).
    8. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    9. Tianhao Shao & Weijie Du & Yun Ye & Haoqing Li & Jingxin Dong & Guiyun Liu & Pengjun Zheng, 2024. "A Novel Virtual Arrival Optimization Method for Traffic Organization Scenarios," Sustainability, MDPI, vol. 16(1), pages 1-17, January.
    10. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    11. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2020. "Modélisation du problème de l'allocation des planches et des postes à quai dans les ports vraquiers," Post-Print hal-03005639, HAL.
    12. Á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.
    13. 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.
    14. Bor-Hong Lin & Hsuan-Shih Lee & Cheng-Chi Chung, 2020. "The Construction and Implication of Group Scale Efficiency Evaluation Model for Bulk Shipping Corporations," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    15. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    16. Gao, Zhendi & Ji, Mingjun & Kong, Lingrui & Hou, Xinhao, 2024. "Scheduling of automated ore terminal operations based on fixed inflow rhythm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).
    17. Qin, Tianbao & Du, Yuquan & Chen, Jiang Hang & Sha, Mei, 2020. "Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel," European Journal of Operational Research, Elsevier, vol. 285(3), pages 884-901.
    18. Chen, Sumin & Zeng, Qingcheng & Li, Yantong, 2023. "Integrated operations planning in highly electrified container terminals considering time-of-use tariffs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    19. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    20. 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.

    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:jeners:v:13:y:2020:i:19:p:5232-:d:424975. 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.