Allocation model and algorithm for multiple container areas at U-automated container terminal

In order to address the problem of container allocation at the container terminal of a U-shaped terminal layout, taking into account the actual conditions of multi-container area storage at the terminal, a model for allocating multiple container areas for outbound containers is established with the objective of minimizing the rehandling time and IGV transport time during container loading and unloading operations. A variable neighborhood search algorithm, considering storage rules, is designed to solve the problem of container allocation in the multi-container area. The effectiveness of the model and algorithm is verified through numerical experiments, and a sensitivity analysis of the balance of operations between container areas is conducted. The experimental results demonstrate that considering the balance of operations between container areas can effectively reduce the rehandling time during container loading and unloading operations, then improving the efficiency of the container terminal.