An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Table 3

The performance experiment result 2.

Number of nodes	Optimization technique		AEA
	Optimal solution	CPU Time (sec)	𝑛	Best solution	CPU time (sec)
10	18	1.51	25; 50	18; 18	0.023; 0.047
12	27	156.72	25; 50	27; 27	0.062; 0.062
15	49	70626	25; 50	49; 49	0.088; 0.078
20	—	—	25; 50	68; 73	0.086; 0.125