Integrated Optimization of Multi-period Yard Template Planning and Loading and Unloading Scheduling for Transshipment Vessels

This paper addresses an integrated multi-period optimization problem that coordinates yard template planning and loading/unloading scheduling for transshipment vessels with heterogeneous visiting cycles. The objective is to minimize container transportation and vessel service costs over a common planning horizon, while incorporating tactical congestion-control requirements for neighboring subblocks and vertical yard lanes. We employ a decomposition-based solution framework that separates yard template assignment decisions from container storage allocation and operational scheduling decisions. Leveraging variable neighborhood search, we develop a matheuristic algorithm known as the Critical Element-based Three-Stage Assignment (CETSA) to solve the problem through the decomposition-based solution framework. Numerical experiments are conducted to verify the effectiveness of CETSA, offering insights and potential improvements for port yard management practices.