Container Relocation and Retrieval Tradeoffs Minimizing Schedule Deviations and Relocations

Ports are striving to improve operational efficiency in the context of constantly growing volumes of trade. In this context, port terminal storage yard operation is key, since complexity and poor coordination lead to containers stacked without consideration of retrieval schedules, resulting in time- and energy-consuming reshuffling operations. This problem, known as the block relocation (and retrieval) problem (BRP), has recently gained considerable attention. Indeed, there are promising solutions to the BRP. However, the literature views the problem in isolation, optimizing one operational parameter for one of the many port stakeholders. This often leads to efficiency losses since port processes involve different stakeholders and port parts. In this work, we explicitly focus on scheduling trucks for pick-up for hinterland distribution. Appointments are often postponed in order to minimize reshuffling operations, leading to losses for the transport forwarders and decreasing the competitiveness of the port. We discuss the trade-off between minimizing container reshuffling operations while maintaining scheduled time windows for container retrieval. We describe the multi-objective optimization problem as a weighted sum of the two objectives. Given the complexity of the problem, we also present a greedy heuristic. Our results indicate that the number of schedule deviations can be reduced without significantly affecting the number of relocations compared to solutions that consider only the latter. Ideally, a weighting of 0.4 and 0.6 should be applied, reflecting schedule deviations and relocations, respectively, to achieve the highest joint optimization potential. This demonstrates that in complex environments, such as ports, with multiple interacting stakeholders and processes, coordination of solutions yields significant benefits.