Berth Allocation and Quay Crane Scheduling in Port Operations: A Systematic Review

Container terminals are facing significant challenges in meeting the increasing demands for volume and throughput, with limited space often presenting as a critical constraint. Key areas of concern at the quayside include the berth allocation problem, the quay crane assignment, and the scheduling problem. Effectively managing these issues is essential for optimizing port operations; failure to do so can lead to substantial operational and economic ramifications, ultimately affecting competitiveness within the global shipping industry. Optimization models, encompassing both mathematical frameworks and metaheuristic approaches, offer promising solutions. Additionally, the application of machine learning and reinforcement learning enables real-time solutions, while robust optimization and stochastic models present effective strategies, particularly in scenarios involving uncertainties. This study expands upon earlier foundational analyses of berth allocation, quay crane assignment, and scheduling issues, which have laid the groundwork for port optimization. Recent developments in uncertainty management, automation, real-time decision-making approaches, and environmentally sustainable objectives have prompted this review of the literature from 2015 to 2024, exploring emerging challenges and opportunities in container terminal operations. Recent research has increasingly shifted toward integrated approaches and the utilization of continuous berthing for better wharf utilization. Additionally, emerging trends, such as sustainability and green infrastructure in port operations, and policy trade-offs are gaining traction. In this review, we critically analyze and discuss various aspects, including spatial and temporal attributes, crane handling, sustainability, model formulation, policy trade-offs, solution approaches, and model performance evaluation, drawing on a review of 94 papers published between 2015 and 2024.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.