## 5 Numerical Experiments
### Results of Search Strategy after Obtaining a Feasible Solution
\begin{table}
\begin{tabular}{c c c c} \hline \hline  & \multicolumn{2}{c}{**(a)**} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 241.81 & 232.13 & 254.94 \\
2 & 238.45 & 227.14 & 245.73 \\
3 & 228.09 & 218.60 & 244.40 \\
4 & 241.43 & 231.95 & 251.71 \\
5 & 247.58 & 240.39 & 256.60 \\
6 & 266.76 & 257.19 & 281.07 \\
7 & 234.84 & 222.53 & 251.80 \\
8 & 212.02 & 205.77 & 220.14 \\
9 & 240.48 & 232.09 & 251.94 \\
10 & 241.65 & 230.99 & 256.75 \\ \hline Avg. & 239.31 & 229.88 & 251.51 \\ \hline \multicolumn{3}{c}{**(b)**} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 242.53 & 235.06 & 251.29 \\
2 & 237.70 & 229.25 & 247.47 \\
3 & 227.98 & 219.98 & 237.32 \\
4 & 241.36 & 231.52 & 250.18 \\
5 & 248.68 & 241.96 & 258.93 \\
6 & 268.91 & 253.71 & 286.59 \\
7 & 235.25 & 222.83 & 255.66 \\
8 & 211.91 & 205.99 & 218.02 \\
9 & 239.90 & 227.68 & 253.67 \\
10 & 239.90 & 231.80 & 252.12 \\ \hline Avg. & 239.41 & 229.98 & 251.13 \\ \hline \multicolumn{3}{c}{**(c)**} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 244.20 & 232.75 & 259.46 \\
2 & 239.29 & 228.66 & 249.19 \\
3 & 227.79 & 217.16 & 238.15 \\
4 & 242.41 & 234.88 & 254.57 \\
5 & 251.11 & 242.17 & 264.62 \\
6 & 270.60 & 253.39 & 284.24 \\
7 & 236.22 & 226.03 & 251.93 \\
8 & 211.75 & 206.02 & 223.83 \\
9 & 243.22 & 231.37 & 258.92 \\
10 & 241.93 & 230.33 & 258.83 \\ \hline Avg. & 240.85 & 230.28 & 254.37 \\ \hline \end{tabular}
\end{table} 
Table 7: Results of search methods after obtaining a feasible solution. (**a**) Search method 2A-S (search for all neighborhood solutions of the Or-opt and the CROSS-exchange with soft constraints). (**b**) Search method 2A-H (search for all neighborhood solutions of the Or-opt and the CROSS-exchange with hard constraints). (**c**) Search method 2B-S (search for only normal order insertion of the Or-opt with soft constraints). (**d**) Search method 2B-H (search for only normal order insertion of the Or-opt with hard constraints). (**e**) Search method 2C-S (search for normal order insertion of the Or-opt and normal order exchange of the CROSS-exchange with soft constraints). (**f**) Search method 2C-H (search for normal order insertion of the Or-opt and normal order exchange of the CROSS-exchange with hard constraints). \begin{table}
\begin{tabular}{c c c c} \hline \hline  & \multicolumn{3}{c}{(d)} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 240.88 & 236.91 & 270.39 \\
2 & 241.65 & 228.40 & 258.26 \\
3 & 230.96 & 221.46 & 244.89 \\
4 & 246.12 & 230.94 & 263.21 \\
5 & 252.34 & 240.32 & 267.20 \\
6 & 275.42 & 263.31 & 286.62 \\
7 & 242.98 & 225.28 & 262.27 \\
8 & 212.27 & 206.68 & 227.78 \\
9 & 243.85 & 233.61 & 259.85 \\
10 & 249.20 & 231.04 & 266.57 \\ \hline Avg. & 244.37 & 231.79 & 260.20 \\ \hline \multicolumn{3}{c}{(e)} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 240.88 & 232.42 & 254.18 \\
2 & 235.86 & 228.96 & 243.84 \\
3 & 226.88 & 216.81 & 235.18 \\
4 & 240.18 & 231.96 & 254.29 \\
5 & 246.75 & 241.68 & 254.52 \\
6 & 264.58 & 255.89 & 276.92 \\
7 & 234.09 & 222.51 & 254.30 \\
8 & 211.11 & 205.87 & 216.95 \\
9 & 237.62 & 227.48 & 249.52 \\
10 & 238.92 & 230.84 & 249.83 \\ \hline Avg. & 237.69 & 229.44 & 248.95 \\ \hline \multicolumn{3}{c}{(f)} \\ \hline
**No.** & **Avg. [min]** & **Best [min]** & **Worst [min]** \\ \hline
1 & 241.36 & 232.87 & 255.56 \\
2 & 236.58 & 227.65 & 249.19 \\
3 & 225.96 & 216.81 & 233.52 \\
4 & 239.99 & 231.78 & 247.36 \\
5 & 247.18 & 240.11 & 255.19 \\
6 & 267.60 & 254.18 & 281.03 \\
7 & 235.12 & 222.29 & 255.66 \\
8 & 210.42 & 206.12 & 215.98 \\
9 & 238.72 & 230.49 & 247.28 \\
10 & 237.86 & 230.42 & 253.19 \\ \hline Avg. & 238.08 & 229.27 & 249.40 \\ \hline \hline \end{tabular}
\end{table} 
Table 8: Results of the _t_-test to evaluate the difference of performance between methods 2C-S and 2C-H.