Heuristics for Synthesizing Robust Networks with a Diameter Constraint

Table 2

Comparison of 3-opt, 2-opt, and tabu search heuristic solutions for various problem sizes. Here, the deviation was averaged over ten random instances for each 𝑛.

𝑛	3-opt		2-opt		Tabu
	Deviation (%)	Time (sec)	Deviation (%)	Time (sec)	Deviation (%)	Time (sec)
10	0	0.29	0.00	0.10	0.00	0.77
15	0	3.06	0.01	0.52	1.52	9.36
20	0	16.32	0.27	1.65	1.78	25.58
25	0	60.38	0.60	3.59	1.88	60.19
30	0	274.93	2.07	12.13	3.12	144.92
35	0	480.15	2.02	37.85	2.77	313.20
40	0	1016.99	5.62	57.28	2.48	3470.71
45	0	2309.60	7.10	116.09	5.10	4272.58
50	0	4219.17	1.38	139.99	3.55	6675.32
55	0	6798.34	6.98	350.83	4.90	8654.29
60	0	8974.46	7.97	505.36	6.06	10049.10