IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v37y2025i2d10.1007_s10696-024-09546-w.html
   My bibliography  Save this article

Berth and yard scheduling optimization for a port with diagonal yard layout

Author

Listed:
  • Haolin Li

    (Shanghai University)

  • Jiajing Gao

    (Shanghai University)

  • Lu Zhen

    (Shanghai University)

  • Xueting He

    (Shanghai University)

Abstract

The efficient operation of container ports relies on the coordination of operational problems including berth allocation and container internal transportation routing. Yard layout designs with diagonal cross lanes may bring more opportunities for future container terminals, and this opportunity requires further evaluation of operational performance improvements. This study analyses the application possibility of flying-V layout and fishbone layout in container yards by investigating the berth and yard scheduling problem. In detail, we introduce the two layouts first, and model the berth and yard scheduling problem as a mixed-integer linear programming model. The model optimizes performance indicators including travel distance and berthing delay. We develop a neighbourhood search algorithm to solve the problem and verify the effectiveness and efficiency by numerical experiments. The proposed model and algorithm provide a framework for the evaluation of yard layouts. Sensitivity analysis reveals the relationship between the angle of diagonal cross lanes and total travel distance and discusses the influence of the width-depth ratio. The comparative experiments investigate different performance indicators and show that the diagonal yard layouts have proven to be efficient.

Suggested Citation

  • Haolin Li & Jiajing Gao & Lu Zhen & Xueting He, 2025. "Berth and yard scheduling optimization for a port with diagonal yard layout," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 473-512, June.
    • Handle: RePEc:spr:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09546-w
    DOI: 10.1007/s10696-024-09546-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-024-09546-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-024-09546-w?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:spr:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09546-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.