Enhancing Online Yard Crane Scheduling through a Two-Stage Rollout Memetic Genetic Programming

Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes, requiring the simultaneous scheduling of internal and external loading tasks. Traditional yard crane scheduling methods often rely on outdated assumptions that fail to account for the dynamic impact of external tasks. In response, container terminals increasingly model the yard crane scheduling as an online problem. A notable advancement in online scheduling is the online rollout method, which evaluates the decisions based on the potential outcomes of their future rollout solutions rather than immediate priorities. Although this method outperforms the latter approach, it faces two main issues: the rollout is time consuming, and decisions based solely on objective of rollout solution may not align with long-term scheduling objectives. To overcome these limitations, we have developed a two-stage adaptive rollout decision model. In the first stage, less desirable tasks are dynamically filtered out to reduce the number of rollouts, while the second stage employs a genetic programming evolved evaluation functions to infuse forward-looking insights into the scheduling process. This approach has proven to significantly enhance yard scheduling efficiency and performance, as confirmed by experimental validation. Given the dynamic nature of yard crane operations, we believe this method could be beneficially applied to other dynamic scheduling contexts.