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

Optimizing the loading of double stack trains under uncertain container availability

Author

Listed:
  • Ng, ManWo
  • Lee, Yu-Chi
  • Lin, Dung-Ying

Abstract

This paper contributes to the literature on the operations management of double stack trains by introducing a new, real-world research problem that arises when loading trains at marine container terminals with on-dock rail service. Specifically, in this research we model the reality that containers that need to be loaded on railcars can be unavailable at the time of loading, while optimizing the assignment of railcars to hubs and trains, and containers to railcars. To this end, we propose a two stage stochastic program that aims to minimize the number of well cars used when container availability is uncertain (first stage) while also maximizing their space utilization when taking corrective actions (second stage). For its solution, a tailored integer L-shaped solution method is presented. Algorithmic performance and managerial insights are highlighted in a series of numerical experiments. Findings include: 1) The proposed L-shaped method is superior compared to a state-of-the-art commercial solver (up to 5 times faster in our experiments). 2) It is beneficial for the rail manager to prioritize making available 40-foot containers versus 20-foot containers. 3) The higher the probability of container availability in the second stage, the more well cars should be made available in the first stage.

Suggested Citation

  • Ng, ManWo & Lee, Yu-Chi & Lin, Dung-Ying, 2025. "Optimizing the loading of double stack trains under uncertain container availability," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).
  • Handle: RePEc:eee:transe:v:196:y:2025:i:c:s1366554525000572
    DOI: 10.1016/j.tre.2025.104016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525000572
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104016?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:196:y:2025:i:c:s1366554525000572. 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.