Traditional container terminals usually use a horizontal yard layout, while automated container terminals usually use a vertical yard layout. The two types of yard layout perform differently in the vehicle travel routes, the handling interface points of vehicles and yard cranes, and the yard cranes travel routes. These differences result in the different indicators between the two types of yard layout, such as yard utilization, average vehicle travel routes, average yard crane travel distance, and overall terminal efficiency etc. This paper uses an analytic method to quantify these indicators of the two types of yard layout. Based on the analysis results, the terminal efficiency is approximated by a queuing network from the overall operations. In the experiment studies, we first evaluate the indicators of the two types of yard layout, respectively. Then, we change the length and width of the yard to compare the efficiency of the two types of yard layout in various yard sizes. Finally, the overall terminal efficiency is compared. Results show that the overall efficiency is significantly affected by the service rate of yard cranes. The results in this paper may provide references for terminal yard design.
The integrated scheduling problem of cranes and automated guided vehicles (AGVs) in automated container terminals is a crucial area of concern for ports. In the terminal with AGV-supports in the yard, AGVs can autonomously place or pick up containers without waiting for yard cranes. Therefore, in such a terminal, meticulous scheduling and coordination between quay cranes (QCs) and AGVs are core for efficient and orderly operations. However, managing the operation of QCs and AGVs is complex as numerous factors affect the operational performance, such as QC interference, vehicle congestion, and limited capacity of handover points. To address the problem, we formulate a mixed-integer linear programming model that explicitly considers the above realistic factors. As the model is computationally inefficient even for small-scale instances, we develop a tailored two-stage algorithm, where the first stage is branch-and-bound for QC operations and the second is column generation for AGV operations. To validate the solution quality, we compare the proposed algorithm with some benchmark methods, and the numerical experiments confirm the effectiveness of the proposed approach.