IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v17y2025i9p4022-d1645955.html
   My bibliography  Save this article

A Variable Neighborhood Search Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem

Author

Listed:
  • Xiafei Xie

    (School of Traffic & Transportation Engineering, Central South University, Changsha 410075, China)

  • Bin Ji

    (School of Traffic & Transportation Engineering, Central South University, Changsha 410075, China)

  • Samson S. Yu

    (School of Engineering, Deakin University, Melbourne, VIC 31125, Australia)

Abstract

To improve the utilization of port resources and reduce the consumption of resources due to vessel waiting and delays, this paper investigates the Berth Allocation and Quay Crane Assignment Problem (BACAP) in container ports, focusing on the Quay Crane (QC) profile. The objective is to assign berths, berthing times, and QC profiles to vessels arriving at the port within a given planning horizon, thereby extending the traditional BACAP framework. To minimize the sum of idle time costs caused by vessel waiting and delay time costs due to late vessel departures, a mixed-integer linear programming (MILP) model is proposed. Additionally, a variable neighborhood search (VNS) algorithm is designed to solve the model, tailored to the specific characteristics of the problem. The proposed MILP model and VNS algorithm are evaluated using two sets of BACAP instances. The numerical results demonstrate the effectiveness of both the model and the algorithm, showing that VNS efficiently and reliably solves instances of various sizes. Furthermore, each neighborhood structure contributes uniquely to the iterative process. This study also analyzes the impact of different idle and delay costs on BACAP, providing valuable managerial insights. The proposed framework contributes to enhancing operational efficiency and supports sustainable port management.

Suggested Citation

  • Xiafei Xie & Bin Ji & Samson S. Yu, 2025. "A Variable Neighborhood Search Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem," Sustainability, MDPI, vol. 17(9), pages 1-29, April.
    • Handle: RePEc:gam:jsusta:v:17:y:2025:i:9:p:4022-:d:1645955
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/17/9/4022/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/17/9/4022/
    Download Restriction: no
    ---><---

    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:gam:jsusta:v:17:y:2025:i:9:p:4022-:d:1645955. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.