Research Article
Heuristics for Synthesizing Robust Networks with a Diameter Constraint
Table 1
Comparison of the deviation of the solutions found by the heuristics for networks with 8 nodes.
is the optimal algebraic connectivity.
| | No. | Optimal solution | -opt search ( = 2, 3) | Tabu search | | Time (sec) | | Deviation (%) | | Deviation (%) |
| | 1 | 3.9712 | 180.57 | 3.9712 | 0.00 | 3.9712 | 0.00 | | 2 | 4.3101 | 408.10 | 4.3101 | 0.00 | 4.3101 | 0.00 | | 3 | 3.9297 | 621.85 | 3.9297 | 0.00 | 3.9297 | 0.00 | | 4 | 3.5275 | 216.79 | 3.5275 | 0.00 | 3.5275 | 0.00 | | 5 | 3.8753 | 470.63 | 3.8753 | 0.00 | 3.8753 | 0.00 | | 6 | 3.7972 | 342.14 | 3.7972 | 0.00 | 3.7972 | 0.00 | | 7 | 3.7125 | 377.47 | 3.7125 | 0.00 | 3.7125 | 0.00 | | 8 | 3.9205 | 313.12 | 3.9205 | 0.00 | 3.9205 | 0.00 | | 9 | 3.7940 | 341.84 | 3.7940 | 0.00 | 3.7940 | 0.00 | | 10 | 3.8923 | 316.86 | 3.8923 | 0.00 | 3.8923 | 0.00 |
| | Average | | | | 0.00 | | 0.00 |
|
|
