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

A tree search algorithm for uncertainty-considered consecutive discharging and loading operations between ship and offshore platform

Author

Listed:
  • Zhou, Chenhao
  • Yuan, Mengxue
  • Zhang, Jingwen
  • Zhang, Wei

Abstract

This paper presents a combinatorial optimization problem for consecutive discharging and loading operations on a floating cargo-handling platform which is a new maritime technology for liquified natural gas redistribution. Because the discharging and loading process involves complex operations with stochastic and sequential nature, a Markov decision process model is formulated for the problem description with the objective of minimizing the ship turnaround time. Then, a tabu-based tree search algorithm allowing a look-ahead at future states is developed. Two sets of practical rules are proposed to control the local tree structure in terms of depth and breadth. The ship stability is also considered. A comprehensive analysis is conducted to determine the most suitable operation strategy for a specific platform design, followed by the analyses of the impacts of strategy parameters, ship size, operation uncertainties. The results show that a customized strategy that considers the dual-cycling operation outperforms other strategies.

Suggested Citation

  • Zhou, Chenhao & Yuan, Mengxue & Zhang, Jingwen & Zhang, Wei, 2024. "A tree search algorithm for uncertainty-considered consecutive discharging and loading operations between ship and offshore platform," European Journal of Operational Research, Elsevier, vol. 315(2), pages 729-749.
    • Handle: RePEc:eee:ejores:v:315:y:2024:i:2:p:729-749
    DOI: 10.1016/j.ejor.2023.12.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723009396
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.12.010?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:315:y:2024:i:2:p:729-749. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.