IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v6y2022i1p6-d721433.html
   My bibliography  Save this article

Composing Vessel Fleets for Maintenance at Offshore Wind Farms by Solving a Dual-Level Stochastic Programming Problem Using GRASP

Author

Listed:
  • Kamilla Hamre Bolstad

    (Department of Industrial Economics and Technology Management, NTNU, 7491 Trondheim, Norway)

  • Manu Joshi

    (Department of Industrial Economics and Technology Management, NTNU, 7491 Trondheim, Norway)

  • Lars Magnus Hvattum

    (Faculty of Logistics, Molde University College, 6410 Molde, Norway)

  • Magnus Stålhane

    (Department of Industrial Economics and Technology Management, NTNU, 7491 Trondheim, Norway)

Abstract

Background: Dual-level stochastic programming is a technique that allows modelling uncertainty at two different levels, even when the time granularity differs vastly between the levels. In this paper we study the problem of determining the optimal fleet size and mix of vessels performing maintenance operations at offshore wind farms. In this problem the strategic planning spans decades, while operational planning is performed on a day-to-day basis. Since the operational planning level must somehow be taken into account when making strategic plans, and since uncertainty is present at both levels, dual-level stochastic programming is suitable. Methods: We present a heuristic solution method for the problem based on the greedy randomized adaptive search procedure (GRASP). To evaluate the operational costs of a given fleet, a novel fleet deployment heuristic (FDH) is embedded into the GRASP. Results: Computational experiments show that the FDH produces near optimal solutions to the operational day-to-day fleet deployment problem. Comparing the GRASP to exact methods, it produces near optimal solutions for small instances, while significantly improving the primal solutions for larger instances, where the exact methods do not converge. Conclusions: The proposed heuristic is suitable for solving realistic instances, and produces near optimal solution in less than 2 h.

Suggested Citation

  • Kamilla Hamre Bolstad & Manu Joshi & Lars Magnus Hvattum & Magnus Stålhane, 2022. "Composing Vessel Fleets for Maintenance at Offshore Wind Farms by Solving a Dual-Level Stochastic Programming Problem Using GRASP," Logistics, MDPI, vol. 6(1), pages 1-22, January.
    • Handle: RePEc:gam:jlogis:v:6:y:2022:i:1:p:6-:d:721433
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/6/1/6/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/6/1/6/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lars Magnus Hvattum & Arne Løkketangen & Gilbert Laporte, 2009. "Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 268-285, May.
    2. Mahdi Yousefi Nejad Attari & Ali Ebadi Torkayesh & Behnam Malmir & Ensiyeh Neyshabouri Jami, 2021. "Robust possibilistic programming for joint order batching and picker routing problem in warehouse management," International Journal of Production Research, Taylor & Francis Journals, vol. 59(14), pages 4434-4452, July.
    3. Marcelo Prais & Celso C. Ribeiro, 2000. "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 164-176, August.
    4. Pantuso, Giovanni & Fagerholt, Kjetil & Hvattum, Lars Magnus, 2014. "A survey on maritime fleet size and mix problems," European Journal of Operational Research, Elsevier, vol. 235(2), pages 341-349.
    5. Mauricio G.C. Resende & Celso C. Ribeiro, 2010. "Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 283-319, Springer.
    6. Giovanni Pantuso & Kjetil Fagerholt & Stein W. Wallace, 2015. "Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 89-102, February.
    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. Ksciuk, Jana & Kuhlemann, Stefan & Tierney, Kevin & Koberstein, Achim, 2023. "Uncertainty in maritime ship routing and scheduling: A Literature review," European Journal of Operational Research, Elsevier, vol. 308(2), pages 499-524.

    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. Orestis Schinas & Niklas Bergmann, 2021. "The Short-Term Cost of Greening the Global Fleet," Sustainability, MDPI, vol. 13(16), pages 1-32, August.
    2. Ksciuk, Jana & Kuhlemann, Stefan & Tierney, Kevin & Koberstein, Achim, 2023. "Uncertainty in maritime ship routing and scheduling: A Literature review," European Journal of Operational Research, Elsevier, vol. 308(2), pages 499-524.
    3. Skålnes, Jørgen & Fagerholt, Kjetil & Pantuso, Giovanni & Wang, Xin, 2020. "Risk control in maritime shipping investments," Omega, Elsevier, vol. 96(C).
    4. Stålhane, Magnus & Halvorsen-Weare, Elin E. & Nonås, Lars Magne & Pantuso, Giovanni, 2019. "Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms," European Journal of Operational Research, Elsevier, vol. 276(2), pages 495-509.
    5. Dhirendra Prajapati & M. Manoj Kumar & Saurabh Pratap & H. Chelladurai & Mohd Zuhair, 2021. "Sustainable Logistics Network Design for Delivery Operations with Time Horizons in B2B E-Commerce Platform," Logistics, MDPI, vol. 5(3), pages 1-13, September.
    6. Wu, Lingxiao & Pan, Kai & Wang, Shuaian & Yang, Dong, 2018. "Bulk ship scheduling in industrial shipping with stochastic backhaul canvassing demand," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 117-136.
    7. Musmanno, Leonardo M. & Ribeiro, Celso C., 2016. "Heuristics for the generalized median graph problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 371-384.
    8. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    9. 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.
    10. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    11. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    12. Yuan, Jun & Shi, Xunpeng & He, Junliang, 2024. "LNG market liberalization and LNG transportation: Evaluation based on fleet size and composition model," Applied Energy, Elsevier, vol. 358(C).
    13. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    14. Grzegorz Tarczyński, 2023. "Linear programming models for optimal workload and batching in pick-and-pass warehousing systems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(3), pages 141-158.
    15. Ng, ManWo & Lin, Dung-Ying, 2018. "Fleet deployment in liner shipping with incomplete demand information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 184-189.
    16. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    17. Lars Magnus Hvattum & Arne Løkketangen & Gilbert Laporte, 2009. "Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 268-285, May.
    18. Koza, David Franz & Ropke, Stefan & Boleda Molas, Anna, 2017. "The liquefied natural gas infrastructure and tanker fleet sizing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 99(C), pages 96-114.
    19. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
    20. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.

    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:jlogis:v:6:y:2022:i:1:p:6-:d:721433. 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.