An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Table 4

The performance experiment result 3.

Node	Yun and Moon (2011) [20]						AEA
	Best value			CPU time			Best value			CPU time
	Min.	Avg.	Max.	Min.	Avg.	Max.	Min.	Avg.	Max.	Min.	Avg.	Max.
7	26	26.4	28	0.00	0.01	0.01	26	26.4	28	0.00	0.01	0.02
25	134	134.8	141	0.34	0.98	2.56	134	134.2	136	0.31	0.97	2.39
35	177	179.9	186	0.78	5.62	10.84	177	180.3	183	2.36	5.62	11.31
45	209	216.3	224	12.92	29.73	48.66	207	214.9	223	12.64	29.87	57.18
70	368	375.8	386	83.05	146.20	223.80	364	374.5	380	46.38	93.59	161.20
85	420	432.8	471	133.60	326.04	587.30	394	427.3	448	60.22	290.93	467.80
100	458	492.25	520	303.00	676.87	1314.00	448	480.7	505	178.90	491.39	735.60