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

Dynamic container slot allocation for a liner shipping service

Author

Listed:
  • Wang, Tingsong
  • Meng, Qiang
  • Tian, Xuecheng

Abstract

In this paper, we study a dynamic container slot allocation problem (DCSAP) for a liner container shipping company that aims to make an acceptance or rejection decision to each dynamically arriving container slot booking request. To capture the dynamic arrival feature and real-time acceptance/rejection decision of the booking request, we formulate the DCSAP as a dynamic programming (DP) model with the objective of maximizing the total revenues generated by accepted container booking requests over the entire booking horizon. Due to the well-known curse of dimensionality of solving a DP model, we develop a series of models to transform the intractable DP model into a solvable approximate linear programming (ALP) model. We further propose a spatiotemporal-heterogeneity-based (STH-based) decomposition preprocessor by identifying the spatiotemporal property of the DCSAP before solving the ALP model. Extensive numerical experiments are conducted to assess the applicability of the developed research methodology.

Suggested Citation

  • Wang, Tingsong & Meng, Qiang & Tian, Xuecheng, 2024. "Dynamic container slot allocation for a liner shipping service," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    • Handle: RePEc:eee:transb:v:179:y:2024:i:c:s0191261523001996
    DOI: 10.1016/j.trb.2023.102874
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261523001996
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2023.102874?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:transb:v:179:y:2024:i:c:s0191261523001996. 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/548/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.