IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i3p381-399.html
   My bibliography  Save this article

Multi-stage hierarchical decomposition approach for stowage planning problem in inland container liner shipping

Author

Listed:
  • Jun Li
  • Yu Zhang
  • Sanyou Ji
  • Lanbo Zheng
  • Jin Xu

Abstract

The relatively limited capacities of inland container liner shipping mean that, unlike in maritime container shipping, capacity utilisation is more important than scheduling. Capacity utilisation and stability must be considered in the stowage planning problem in inland container liner shipping. We adopt a multi-stage hierarchical decomposition approach to decompose the problem into multiple stages because a ship needs to visit multiple ports during its voyage. At each stage, the stowage planning problem of the current port is decomposed hierarchically into two sub-problems: the master bay planning problem (MBPP) and slot planning problem (SPP). The multi-port MBPP is first optimised to simultaneously generate the master bay plans for multiple ports over the full route. This approach incorporates two heuristic algorithms, a greedy randomised adaptive search procedure for the multi-port MBPP, and a heuristic evolutionary strategy algorithm for the SPP. Computational results for randomly generated data corresponding to real-size scenarios of inland container ships are presented validating the proposed algorithms.

Suggested Citation

  • Jun Li & Yu Zhang & Sanyou Ji & Lanbo Zheng & Jin Xu, 2020. "Multi-stage hierarchical decomposition approach for stowage planning problem in inland container liner shipping," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(3), pages 381-399, March.
  • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:3:p:381-399
    DOI: 10.1080/01605682.2018.1561162
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1561162
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2018.1561162?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:tjorxx:v:71:y:2020:i:3:p:381-399. 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/tjor .

    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.