### Table 5: Average deviation from best results for strict and reactive tabu search.

1999

"... In PAGE 11: ... The results achieved by the improvement methods are signi cantly better than those of steepest descent. Table5 shows the results of the application of advanced tabu search approaches. We restricted to shift moves in connection with the tabu threshold set corresponding to a full move (i.... ..."

Cited by 12

### Table 5 Average deviation from best results for static and reactive tabu search (partly with additional escape moves).

"... In PAGE 16: ...) Both ideas led to a significant increase of solution quality (cf. Table5 ). Assessing the results obtained while taking into account that... ..."

### Table 3. Comparison of tabu search with different Nmax

"... In PAGE 11: ... This implies that a large tabusize is too restrictive to generate good solutions for the problem. Table3 shows the performance of tabu search with different value of Nmax. Based on the experiments by various Nmax, we see that the stopping criteria Nmax with 2n is appropriate for all the problems.... In PAGE 11: ... Table 2. Comparison of tabu search with different tabusize Table3 . Comparison of tabu search with different Nmax In Table 4, for the problems with 10, 20, and 30 nodes, the computational results of tabu search are shown with a recency based short term memory, a frequency based long term memory and optimal solution.... ..."

### Table 1. GLS verses reactive tabu search and robust tabu search: Mean percent excess from best known solution, over 10 runs, 1000 x N repairs per problem

### Table 5: Reactive tabu search applied for 1000 seconds in connection with shift neighborhood on the basis of initial solutions provided by Chins and Pilot-10.

2001

Cited by 4

### Table 1 shows the results obtained by our algorithms and by reactive tabu search method of William et al. [13] on the 9 a1 a0

"... In PAGE 6: ...8 85 10 9827.3 Table1 . Results Obtained for a1 a0 a38 Instances 5.... ..."

### Table 2. Results of heuristic repair after the maximal covering phase by IP, the pure tabu search, and the hybrid algorithm.

"... In PAGE 6: ...8 11.2 Minimum 14 10 Table2 compares the results of applying heuristic repair to the maximal covering solutions obtained by IP, the pure tabu search (TS), and the hybrid algorithm (HY- BRID). As seen from the bottom row of the table, it took only 38 minutes to repair 10 blanks, while it took 1 hour and 24 minutes and 16 hours and 42 minutes to repair 14 and 24 blanks, respectively.... ..."

### Table 5. Results of tabu search in problems with 40 and 50 nodes

"... In PAGE 11: ... Table 4. Results of tabu search in problems with 10, 20 and 30 nodes Table5 shows the computational results of tabu search in problems with 40 and 50 nodes. For the problems, we fail to get optimal solutions until the branch and bound nodes of more than 2 millions have been investigated.... In PAGE 12: ...which is approximately 1 - 4% from the lower bounds or optimal solutions. Table5 . Results of tabu search in problems with 40 and 50 nodes In Table 6 the cost of pure mesh network is compared with that of hybrid ring-mesh network.... ..."

### Table 1. Performance comparison of the pure tabu search and the hybrid algorithm.

"... In PAGE 5: ... IP had difficulty in finding a good solution when given a pool of size bigger than 20,000 perhaps because of the limited time and space re- sources. Table1 summarizes the results of ten runs of the pure tabu search (TS) and the hybrid algorithm of tabu and IP (HYBRID). Both algorithms implemented the MCP model with the number of pairings in the covering set fixed to 65.... ..."

### Table 4. Results of tabu search in problems with 10, 20 and 30 nodes

"... In PAGE 11: ... Comparison of tabu search with different tabusize Table 3. Comparison of tabu search with different Nmax In Table4 , for the problems with 10, 20, and 30 nodes, the computational results of tabu search are shown with a recency based short term memory, a frequency based long term memory and optimal solution. In the table, optimal solutions are obtained by solving each integer problem by running the CPLEX solver9.... In PAGE 11: ... We note that the computational running time for the tabu search increases linearly as the number of nodes gets larger, but the computation time by CPLEX increases exponentially. Table4 . Results of tabu search in problems with 10, 20 and 30 nodes Table 5 shows the computational results of tabu search in problems with 40 and 50 nodes.... ..."