IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v209y2026ics1366554526000797.html

Simulation-based optimization of yard slot allocation in U-shaped container terminals

Author

Listed:
  • Zhang, Junkai
  • Kim, Kap Hwan
  • Song, Ningning
  • Feng, Xuehao

Abstract

The yard slot allocation problem (SAP), which concerns locating containers in the storage yard, could critically affect the performance of ports. The optimization of this problem is challenging due to the complex operational conditions and real-time decision requirement in practice. As a new type of layout, the U-shaped layout offers external and internal trucks (ETs and ITs) novel combinations of travel routes and container handover points that may result in unique characteristics for the SAP. This study addresses the SAP under the U-shaped layout to minimize the delay time of ITs and ETs. A novel simulation-based evaluation method considering multiple criteria is proposed to allocate slots for arriving containers. In this method, an evolving neural decision network (ENDN) is developed to explore the influence of real-time information on the weights of these criteria. We develop an efficient genetic algorithm tailored to optimize the parameters of the ENDN. A simulation model is developed to evaluate the algorithm’s performance under realistic operational uncertainties that may promote the practical implementation of the ENDN. The experimental results demonstrate that our method can determine slot allocations of shorter total vehicle delay time compared with existing methods.

Suggested Citation

  • Zhang, Junkai & Kim, Kap Hwan & Song, Ningning & Feng, Xuehao, 2026. "Simulation-based optimization of yard slot allocation in U-shaped container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 209(C).
  • Handle: RePEc:eee:transe:v:209:y:2026:i:c:s1366554526000797
    DOI: 10.1016/j.tre.2026.104739
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2026.104739?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transe:v:209:y:2026:i:c:s1366554526000797. 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.