IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v178y2023ics1366554523002569.html
   My bibliography  Save this article

Tramp ship routing and speed optimization with tidal berth time windows

Author

Listed:
  • Gao, Yuan
  • Sun, Zhuo

Abstract

Tramp shipping companies need to schedule shipping routes and decide on appropriate speeds based on short-term demand. This task differs from traditional vehicle routing problems (VRPs) in that the ship may wait for the tide, which changes with time. The wait time is a nonlinear function of the load, and in this paper, we describe this kind of wait as the ship following a tidal berth time windows. Additionally, the speed of the ship affects both the wait time and the sailing cost. This paper proposes a mixed-integer nonlinear programming model to tackle this problem. A branch-and-price framework is applied to solve the model efficiently, decomposing the model into a set partitioning master problem and an elementary shortest path subproblem. A labeling algorithm incorporating ship speed is developed to handle the subproblem, and further enhancements are made by optimizing the speed separately. Computational experiments show the effectiveness and accuracy of the proposed solution approach for large-scale instances. Moreover, considering the tidal time windows allows for exploiting the practical benefits of raising tides, which benefits the tramp shipping industry.

Suggested Citation

  • Gao, Yuan & Sun, Zhuo, 2023. "Tramp ship routing and speed optimization with tidal berth time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    • Handle: RePEc:eee:transe:v:178:y:2023:i:c:s1366554523002569
    DOI: 10.1016/j.tre.2023.103268
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554523002569
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2023.103268?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:transe:v:178:y:2023:i:c:s1366554523002569. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.