# Cargo Terminal Intelligent-Scheduling Strategies Based on Improved Bee Colony Algorithms
## 4 Implementation and Experimental Results
### Scheduling Problem
\begin{table}
\begin{tabular}{c c c c c c c c} \hline \hline \multicolumn{2}{c}{**Inbound Tasks**} & \multicolumn{2}{c}{**Inbound Tasks**} & \multicolumn{2}{c}{**Outbound Tasks**} & \multicolumn{2}{c}{**Outbound Tasks**} \\ \hline
1 & I(1-5-34) & 16 & I(1-8-44) & 31 & O(1-3-10) & 46 & O(2-8-10) \\
2 & I(2-3-14) & 17 & I(2-8-32) & 32 & O(1-5-55) & 47 & O(1-3-32) \\
3 & I(1-5-58) & 18 & I(2-3-54) & 33 & O(1-5-25) & 48 & O(1-4-50) \\
4 & I(1-5-26) & 19 & I(1-3-40) & 34 & O(2-4-8) & 49 & O(2-3-38) \\
5 & I(1-5-30) & 20 & I(1-4-60) & 35 & O(2-2-18) & 50 & O(2-1-58) \\
6 & I(1-2-55) & 21 & I(1-3-20) & 36 & O(2-1-16) & 51 & O(1-5-24) \\
7 & I(1-5-24) & 22 & I(2-2-43) & 37 & O(2-3-51) & 52 & O(1-4-30) \\
8 & I(1-4-40) & 23 & I(2-4-50) & 38 & O(1-5-6) & 53 & O(2-6-40) \\
9 & I(1-5-40) & 24 & I(1-6-10) & 39 & O(2-5-3) & 54 & O(2-4-35) \\
10 & I(1-5-35) & 25 & I(2-7-20) & 40 & O(1-6-12) & 55 & O(2-8-51) \\
11 & I(2-5-23) & 26 & I(1-6-15) & 41 & O(2-6-13) & 56 & O(2-2-30) \\
12 & I(1-7-43) & 27 & I(2-8-30) & 42 & O(2-7-49) & 57 & O(1-2-60) \\
13 & I(1-3-48) & 28 & I(2-2-45) & 43 & O(1-7-57) & 58 & O(1-3-26) \\
14 & I(1-8-50) & 29 & I(1-7-58) & 44 & O(1-5-25) & 59 & O(1-6-35) \\
15 & I(1-6-21) & 30 & I(1-4-9) & 45 & O(2-6-18) & 60 & O(2-8-10) \\ \hline \hline \end{tabular}
\end{table} 
Table 5: Task sets to be scheduled. \begin{table}
\begin{tabular}{c c c} \hline  & \multicolumn{3}{c}{(**b**)} \\ \hline \multicolumn{3}{c}{**Inbound tasks**} & \multicolumn{3}{c}{**Outbound tasks**} \\ \hline
1 & 4, 27, 25, 30, 26, 7, 15, 24, 2, 16, 17, 11 & 1 & 39, 40, 51, 45, 60, 34, 38, 44, 31, 46, 33, 59, 41 \\ \hline
2 & 1, 5, 12, 14, 21, 10 & 2 & 52, 53, 58,3 6, 35, 55, 42 \\ \hline
3 & 9 & 3 & 47, 54, 56, 43, 49 \\ \hline
4 & 29, 8 & 4 & 32, 48 \\ \hline
5 & 19 & 5 & 37 \\ \hline
6 & 23 & 6 \\ \hline
7 & 13, 22, 28 & 7 & 57, 50 \\ \hline
8 & 18, 3, 20, 6 \\ \hline \end{tabular}
\begin{tabular}{c c c c c c c c c c} \multicolumn{10}{c}{**(a)**} \\ \hline
**1** & **2** & **3** & **4** & **5** & **6** & **7** & **8** & **9** & **10** \\ \hline
**Iteration** & 1098 & 872 & 725 & 915 & 1003 & 1000 & 697 & 605 & 835 & 898 \\ \hline
**Result/s** & 6852.9 & 6772.4 & 6806.41 & 6697.15 & 6892.79 & 6905.64 & 6748.78 & 6865.9 & 6787.76 & 6803 \\ \hline
**Iteration** & 732 & 1079 & 509 & 840 & 602 & 675 & 786 & 821 & 753 & 835 \\ \hline
**Result/s** & 6839.3 & 6824.9 & 6877.64 & 6796.28 & 6787.27 & 6864.15 & 6808.01 & 6871.29 & 6839.52 & 6817.27 \\ \hline
**(b)** & & & & & & & \\ \hline
**Inbound tasks** & & & & & & & & \\ \hline
1 & 17, 25, 10, 16, 11, 15, 27, 26, 7, 24, 4, 30, 2 & 1 & & & & & \\ \hline
2 & 14, 21, 12, 1, 5 & 2 & & & & & & \\ \hline
3 & 9 & 3 & & & 56, 49, 43, 47 & & & \\ \hline
4 & 8, 29 & 4 & & & & & & \\ \hline
5 & 19 & 5 & & 37 & & & \\ \hline
6 & 23 & 6 & & & & & & \\ \hline
7 & 22, 28, 13 & 7 & & 57, 50 & & & \\ \hline
8 & 20, 18, 3, 6 & & & & & & \\ \hline \end{tabular}
\end{table} 
Table 7: **(a)** The scheduling results with ABC. (**b**) Entrances and exits allocation scheme with ABC. \begin{table}
\begin{tabular}{c c c c c c c c c c} \hline  & \multicolumn{3}{c}{(**a**)} \\ \hline  & **1** & **2** & **3** & **4** & **5** & **6** & **7** & **8** & **9** & **10** \\ \hline
**Iteration** & 488 & 230 & 223 & 501 & 179 & 346 & 267 & 464 & 202 & 595 \\ \hline
**Result/s** & 6621.11 & 6623.11 & 6613.61 & 6609.98 & 6617.36 & 6617.36 & 6611.73 & 6617.12 & 6615.49 \\ \hline
**Iteration** & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 \\ \hline
**Result/s** & 6606.35 & 6617.48 & 6630.49 & 6615.37 & 6611.86 & 6617.36 & 6617.48 & 6619.24 & 6615.37 & 6611.74 \\ \hline \end{tabular}
\end{table} 
Table 8: **(a)** The scheduling results with PfdABC. (**b**) Entrances and exits allocation scheme with PfdABC.