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

The bay-based quay crane scheduling problem considering time-varying handling capacities in automated container terminals

Author

Listed:
  • Tan, Runzhi
  • Wang, Peixiang
  • Tao, Jinghan
  • Zhou, Yaoming
  • Qin, Wei
  • Huang, Heng
  • Zou, Ying

Abstract

The scheduling of quay cranes at automated container terminals is a critical component of efficient seaside operations, particularly with the advent of ultra-large container ships. These massive vessels necessitate extended service times and present distinct challenges to quay crane scheduling, emphasizing the need for advanced models that accommodate temporal changes in task handling capacities. This study develops a mixed-integer linear programming (MILP) model specifically tailored for the bay-based quay crane scheduling problem (QCSP) associated with ultra-large container ships, incorporating two time-varying handling rates derived from Terminal Operating System (TOS) data. To enhance computational efficiency, a time-incremental solution framework is introduced to approximate the original problem. This framework transforms the optimization problem into a series of decision problems, specifically verifying whether all tasks can be completed within an incrementally refined time span. Correspondingly, a novel branch-and-price algorithm is designed to identify near-optimal solutions, employing column generation to derive upper bounds for pruning infeasible nodes, alongside tailored branching schemes for handling fractional solutions. Furthermore, a recursive heuristic algorithm integrated with an exact model is proposed to warm-start the column generation process and provide a precisely determined time interval for the algorithm. Computational experiments demonstrate the superiority of the proposed framework and algorithm, especially for large-scale instances, with significant performance improvements over the MILP model. The study also validates the effectiveness of incorporating time-varying rates, showing an 8.45% efficiency improvement by considering container arrival rates in QCSP models. Managerial insights indicate that prioritizing yard resources to better-stacked areas can more effectively enhance loading efficiency when resources are limited.

Suggested Citation

  • Tan, Runzhi & Wang, Peixiang & Tao, Jinghan & Zhou, Yaoming & Qin, Wei & Huang, Heng & Zou, Ying, 2025. "The bay-based quay crane scheduling problem considering time-varying handling capacities in automated container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
  • Handle: RePEc:eee:transe:v:201:y:2025:i:c:s1366554525002959
    DOI: 10.1016/j.tre.2025.104254
    as

    Download full text from publisher

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

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