Skip navigation

Integrated berth allocation and quay crane assignment under cooperation among multiple container terminals

Integrated berth allocation and quay crane assignment under cooperation among multiple container terminals

Du, Bo, Hu, Hao, Zhang, Jie, Meng, Meng and Zhou, Li ORCID logoORCID: https://orcid.org/0000-0001-7132-5935 (2025) Integrated berth allocation and quay crane assignment under cooperation among multiple container terminals. Annals of Operations Research. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1007/s10479-025-06772-9)

[thumbnail of Open Access Article]
Preview
PDF (Open Access Article)
50977 ZHOU_Integrated_Berth_Allocation_And_Quay_Crane_Assignment_Under_Cooperation_Among_Multiple_Container_Terminals_(OA)_2025.pdf - Published Version
Available under License Creative Commons Attribution.

Download (3MB) | Preview

Abstract

As international trade thrives, terminal operators attempt to increase productivity to satisfy the growing demand and offer better services for customers. Cooperation among multiple terminal operators in a port is an option to better utilise the existing resources and achieve
a high level of service without additional capital investment. To achieve an effective and efficient operation under cooperation, this study investigates a joint problem of berth allocation and quay crane assignment considering coordinated operation among multiple
terminals in a port. Mixed-integer linear programming model considering operational constraints is developed to minimise the total operation cost, including the delay cost of vessels, transshipment cost of export containers and crane assignment cost. An adaptive
large neighbourhood search algorithm is proposed to solve the integer linear programming model and tested in a series of numerical experiments. Numerical results show that cooperation not only helps to reduce the total operation cost significantly but also increases
the level of service by reducing the number of delayed vessels and their total delay time. Moreover, the proposed algorithm outperforms the commercial solver, Gurobi, with better convergence results and less computational time, which enables the proposed algorithm to
be applied to large-scale real-world problems.

Item Type: Article
Uncontrolled Keywords: Berth allocation, quay crane assignment;, adaptive large neighbourhood search, cooperation, container terminal
Subjects: H Social Sciences > H Social Sciences (General)
H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
T Technology > T Technology (General)
Faculty / School / Research Centre / Research Group: Greenwich Business School
Greenwich Business School > Networks and Urban Systems Centre (NUSC)
Greenwich Business School > Networks and Urban Systems Centre (NUSC) > Connected Cities Research Group (CCRG)
Greenwich Business School > School of Business, Operations and Strategy
Last Modified: 03 Sep 2025 14:32
URI: https://gala.gre.ac.uk/id/eprint/50977

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics