## 6 Conclusions  
This paper addresses issues related to optimizing the real-time pickup operations of import containers based on the appointment and arrival information of ETs to reduce the number of relocations. Our results include a method (namely _Real-time Batch Optimization_), which only focuses on the real-time pickup operation round of import containers, a dynamic upper bound of the theoretical optimal solution of the SCRP, and a heuristic \begin{table}
\begin{tabular}{l c c c c c c c c c c c} \hline \hline  & & \multicolumn{3}{c}{**LL**} & \multicolumn{6}{c}{**SPFH**} \\ \cline{3-13}
**S** & **T** & **Act** & **EM** & **ERI** & **PBFS** & **PBFSA** & **Act** & **EM** & **ERI** & **PBFS** & **PBFSA** \\ \hline
5 & 3 & 2.63 & 14.50\% & 15.33\% & 14.50\% & 14.22\% & 2.63 & 14.50\% & 15.33\% & 14.50\% & 14.22\% \\  & 4 & 4.87 & 13.12\% & 14.78\% & 12.19\% & 14.04\% & 4.90 & 13.71\% & 15.36\% & 12.78\% & 14.62\% \\  & 5 & 9.33 & 9.03\% & 13.65\% & - & - & 9.53 & 10.94\% & 15.46\% & - & - \\  & 6 & 12.93 & 7.17\% & 13.76\% & - & - & 13.60 & 11.72\% & 17.99\% & - & - \\ \hline
6 & 3 & 3.50 & 11.11\% & 11.11\% & 10.88\% & 11.11\% & 3.47 & 10.26\% & 10.26\% & 10.03\% & 10.26\% \\  & 4 & 6.63 & 9.17\% & 11.08\% & 7.05\% & 5.63\% & 6.77 & 10.96\% & 12.83\% & 8.88\% & 7.48\% \\  & 5 & 9.20 & 8.16\% & 11.73\% & - & - & 9.53 & 11.37\% & 14.81\% & - & - \\  & 6 & 13.33 & 6.61\% & 12.23\% & - & - & 14.17 & 12.11\% & 17.39\% & - & - \\ \hline
7 & 3 & 3.60 & 9.55\% & 10.45\% & 9.32\% & 13.04\% & 3.60 & 9.55\% & 10.45\% & 9.32\% & 13.04\% \\  & 4 & 6.60 & 9.42\% & 11.58\% & 8.55\% & - & 6.67 & 10.33\% & 12.47\% & 9.47\% & - \\  & 5 & 10.73 & 5.49\% & 10.03\% & - & - & 11.07 & 8.34\% & 12.74\% & - & - \\  & 6 & 16.10 & 4.71\% & 10.69\% & - & - & 16.80 & 8.68\% & 14.41\% & - & - \\ \hline
8 & 3 & 4.17 & 10.59\% & 10.97\% & 10.59\% & 14.09\% & 4.17 & 10.59\% & 10.97\% & 10.59\% & 14.09\% \\  & 4 & 7.67 & 7.78\% & 8.66\% & 7.12\% & - & 7.70 & 8.18\% & 9.05\% & 7.52\% & - \\  & 5 & 12.47 & 4.97\% & 9.22\% & - & - & 12.80 & 7.45\% & 11.58\% & - & - \\  & 6 & 17.83 & 6.03\% & 12.07\% & - & - & 18.33 & 8.59\% & 14.47\% & - & - \\ \hline
9 & 3 & 4.60 & 10.16\% & 10.51\% & 9.80\% & 10.51\% & 4.60 & 10.16\% & 10.51\% & 9.80\% & 10.51\% \\  & 4 & 9.00 & 5.65\% & 7.10\% & 5.36\% & - & 9.07 & 6.35\% & 7.79\% & 6.05\% & - \\  & 5 & 14.47 & 6.06\% & 11.44\% & - & - & 14.83 & 8.38\% & 13.63\% & - & - \\  & 6 & 18.60 & 4.25\% & 10.64\% & - & - & 19.53 & 8.82\% & 14.91\% & - & - \\ \hline
10 & 3 & 4.87 & 7.20\% & 7.20\% & 7.02\% & 7.72\% & 4.90 & 7.83\% & 7.83\% & 7.65\% & 8.35\% \\  & 4 & 9.53 & 3.79\% & 4.53\% & - & - & 9.90 & 7.35\% & 8.07\% & - & - \\  & 5 & 15.17 & 4.06\% & 6.93\% & - & - & 15.53 & 6.32\% & 9.13\% & - & - \\  & 6 & 21.80 & 3.30\% & 8.29\% & - & - & 22.43 & 6.03\% & 10.87\% & - & - \\ \hline \hline \end{tabular}
\end{table} 
Table 7: Performance of heuristic \(LL\) and algorithm \(SPFH\) for the fill rate 67%. algorithm based on three relocation rules. The heuristic relocation rule, \(LL\), can be used as a standalone algorithm for operation scenarios of restricted SCRP, and the algorithm \(SPFH\) is applied to operation scenarios of unrestricted SCRP. Numerical experiments show that the newly proposed method exhibits excellent performance on both small-batch and large-batch instance sets, and its solution efficiency and quality outperform other methods in the literature. The reason for the new method's performance compared with others in the literature is that it focuses only on real-time operations, i.e., a part of the overall retrieval process, which significantly reduces the solution process size. In addition, the adjustment of the target containers' pickup order helps us choose a better operation plan.