Title: A heuristic algorithm based on quantum behaviour for berth allocation and quay crane scheduling optimisation problems in container terminals

Authors: Zhen Li; Shurong Li

Addresses: Beijing University of Posts and Telecommunications, No. 10 Xitucheng Road, Haidian District Beijing, 100876, China ' Beijing University of Posts and Telecommunications, No. 10 Xitucheng Road, Haidian District Beijing, 100876, China

Abstract: Various real-world engineering examples need to be settled by appropriate methods. However, many of them are proved as NP-hard problems with huge computational complexity, which causes premature convergence and slow computing efficiency. In this study, we are concerned with the combinatorial optimisation problems for optimal scheduling tasks in container terminals by utilising and improving the quantum-behaviour heuristic algorithm. First, an integrated two-stage model for the berth allocation, quay crane assignment, and quay crane scheduling problem (BACASP) in container terminals is presented to minimise the running costs in the given time horizon. To deal with the computation demand, a quantum-behaviour heuristic algorithm (QGA-E) with stronger global searching ability and higher computation efficiency is developed. The above works are certified to be feasible according to a series of experimental studies with datasets from the real container terminal.

Keywords: quantum-behaviour heuristic algorithm; berth allocation; quay crane assignment; quay crane scheduling.

DOI: 10.1504/IJSTL.2026.153259

International Journal of Shipping and Transport Logistics, 2026 Vol.22 No.3, pp.353 - 380

Received: 14 Jan 2025
Accepted: 07 Aug 2025
Published online: 29 Apr 2026 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article