## 4 Experimental Results and Discussion
### Experimental Results  
The experimental evaluation of the SA algorithm is carried out on a computer with Intel Xeon X5675/3.07 GHz CPUs and 24 GB RAM. The algorithm is implemented using the C++ language and is compiled with GCC 4.9.4 on Linux 2.6-EL5. The results obtained by the SA algorithm on each test instance are described using several tables in the following paragraphs. They indicate the best solution value found, the mean value, and the standard deviation (SD) of these executions. In this work, a greedy BFS is chosen, which does not use a cost function to explore possible routes. This solution is used as the SA initial solution, and the comparison is carried out with the BFS strategy to show the quality of solutions obtained by SA within a corridor. BFS only generates a single solution, unlike the SA algorithm, which can produce multiple optimized local solutions that do not violate the restriction of leaving the corridor. When starting the search procedure with a solution that is not the global optimum obtained by a greedy BFS, it generates alternate routes within the corridor. Otherwise, if SA is initialized with a globally optimal solution, what happens is that the paths found by SA are very similar to each other and do not extend in the corridor, limiting the search space of the algorithm. SA seeks alternative routes with great diversity, which can be adjusted to the corridor's width. The corridor distances obtained by both the BFS strategy and the SA algorithms are shown. The results depicted in Table 5, Table 6, Table 7, Table 8 show the optimization that SA does with the initial solution obtained by the greedy-BFS strategy, and it is observed in the best solution found and in the average value obtained by SA. The objective of the comparison presented in these tables and Figures 10 and 11 is to have a quality measure and diversity that the routes obtained by SA have throughout the length and width of the corridor. Naturally, if we compare the quality of these routes with an algorithm getting the optimal global path, these would be of lower quality or some would be close to the global optimum, but it would not have a diversity of routes in the corridor, which is the objective of this work, i.e., quality and diversity. The pseudo-random paths are created using 10%, 30%, 50%, and 70% of the maximum length of the initial solution. The number of alternative routes generated by each execution is 452, using the values of the parameters shown in Table 4. The corridor redesign may require the generation of alternative routes to evaluate further solutions, which can be reached by modifying the algorithm parameters. Table 5 shows the results obtained using random pseudo-paths with a maximum length of 10% of the total length of the initial solution. The distances obtained by the compared algorithms greedy-BFS vs. SA in the first problem are 35.75 and 21.15, for problem two are 76.4 and 49.4, and for problem three are 416.75 and 301.4. Figure 9: Solution cost (distance) depending on the temperature. Table 6 shows the results obtained using pseudo-random paths with a maximum length of 30% of the total length of the initial solution. The distances obtained by the compared algorithms are 35.75 and 24.4, 76.4 and 55.65, and 416.75 and 301.6 for the problems one, two, and three, respectively. Table 7 shows the results obtained using pseudo-random paths with a maximum length of 50% of the total length. The distances obtained by the compared methods are 35.75 and 26.5, 76.4 and 59.2, and 416.75 for problems one, two, and three, respectively. Finally, Table 8 shows the results obtained using pseudo-random paths with a maximum length of 70% of the total length. The distances obtained by the compared algorithms are 35.75 and 27.25, 76.4 and 61.05, and 416.75 and 306.2 for problems one, two, and three, respectively. Figure 10 shows the behavior of the objective function concerning the size of the neighborhood structure: Figure 10a is for problem one, and Figure 10b is for problem 2.