Berth and yard scheduling optimization for a port with diagonal yard layout

The efficient operation of container ports relies on the coordination of operational problems including berth allocation and container internal transportation routing. Yard layout designs with diagonal cross lanes may bring more opportunities for future container terminals, and this opportunity requires further evaluation of operational performance improvements. This study analyses the application possibility of flying-V layout and fishbone layout in container yards by investigating the berth and yard scheduling problem. In detail, we introduce the two layouts first, and model the berth and yard scheduling problem as a mixed-integer linear programming model. The model optimizes performance indicators including travel distance and berthing delay. We develop a neighbourhood search algorithm to solve the problem and verify the effectiveness and efficiency by numerical experiments. The proposed model and algorithm provide a framework for the evaluation of yard layouts. Sensitivity analysis reveals the relationship between the angle of diagonal cross lanes and total travel distance and discusses the influence of the width-depth ratio. The comparative experiments investigate different performance indicators and show that the diagonal yard layouts have proven to be efficient.