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

Improved Benders decomposition for stack-based yard template generation in an automated container terminal

Author

Listed:
  • Huang, Mingzhong
  • He, Junliang
  • Yu, Hang
  • Yan, Wei
  • Tan, Caimao

Abstract

Automated container terminals have become popular solutions to the growing need for container handling. We propose a two-stage mathematical model to design an efficient yard template for automated container terminals, using stacks as the allocation unit. In the first stage, a bi-objective model is developed to optimize landside and seaside operations in the terminal. A Benders decomposition algorithm is designed to solve the model. The proposed algorithm is improved by several acceleration strategies, including valid inequalities, pareto-optimal cuts, and ε−optimal approach. Drawing upon the solution derived from the first stage, the second stage assigns containers to specific bays, which is partitioned into multiple subproblems by capitalizing on the structure of it to enhance solvability. Numerous numerical experiments are conducted to verify the efficiency of the proposed algorithm. In addition, scenario analysis demonstrate that the stack-based yard template is more efficient than a cluster-based yard template for automated container terminals with multiple targets.

Suggested Citation

  • Huang, Mingzhong & He, Junliang & Yu, Hang & Yan, Wei & Tan, Caimao, 2024. "Improved Benders decomposition for stack-based yard template generation in an automated container terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    • Handle: RePEc:eee:transe:v:188:y:2024:i:c:s1366554524001984
    DOI: 10.1016/j.tre.2024.103607
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524001984
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103607?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:188:y:2024:i:c:s1366554524001984. 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.