A dynamic yard space reservation algorithm based on reward-penalty mechanism

Abstract

Increasing throughput at container terminals leads to higher yard occupancy rates, reduced yard service capacity, and inefficient use of space. These issues result in longer waiting times for trucks, underutilized yard slots, and longer distances between berth positions and the yard, particularly under high occupancy conditions. Traditional methods for allocating yard space fail to adequately consider dynamic container arrival patterns, conflict between container operations, and efficient use of yard resources. This paper introduces an innovative approach to improve yard efficiency by dividing yard container retrieval into time intervals and dynamically reserving yard slots within each interval. This method aims to minimize operational conflicts, reduce distances between blocks and berths, and avoid excessive reservations. We propose a dynamic reservation algorithm based on a reward-penalty mechanism to handle the problem's complexity and real-time demands. Furthermore, a time-series reward-penalty mechanism, which considers past reservation feedback and future reservation potential, ensures the concentration and continuity of container groups in the yard. Our evaluation metrics and multiple experimental scenarios demonstrate that this method significantly enhances yard efficiency and overall port productivity compared to static and other dynamic algorithms.