IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i12p3651-3668.html
   My bibliography  Save this article

Probabilistic tabu search algorithm for container liner shipping problem with speed optimisation

Author

Listed:
  • Shijin Wang
  • Qianyang Zhao

Abstract

This paper considers a container liner shipping problem with speed optimisation (CLSP-SO) to minimise the total costs of the fleet, which includes operating costs, capital costs and voyage costs. A mixed-integer nonlinear programming model is first formulated to illustrate the problem, in which the oil consumption of ships is treated as a cubic function of speeds. Then, the computational complexity of the problem is analysed and a lower bound is given based on the theoretical optimised speed of ships. To solve the problem, a probabilistic tabu search (PTS)-based algorithm is developed considering the NP-hardness of the problem. Extensive computational experiments on randomly generated data and a real-world case are conducted and the performance of the proposed method is compared with the lower bound and that of the basic tabu search (TS) algorithm. The results show that the proposed PTS-based algorithm obtains satisfactory solutions with respect to lower bounds in reasonable computation time and it outperforms the basic TS-based algorithm.

Suggested Citation

  • Shijin Wang & Qianyang Zhao, 2022. "Probabilistic tabu search algorithm for container liner shipping problem with speed optimisation," International Journal of Production Research, Taylor & Francis Journals, vol. 60(12), pages 3651-3668, June.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:12:p:3651-3668
    DOI: 10.1080/00207543.2021.1930236
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1930236
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1930236?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:12:p:3651-3668. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.