Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Table 6

Comparison of the proposed method with different TSPs solved using the CONCORDE algorithm. For each case, 100 simulations have been run. Rounded distances are used.

Number of targets	Optimal tour	Genetic algorithm error
	Length	Minimum	Mean	Maximum	Std
600	1812	0.7%	1.3%	2.2%	5.6
700	1946	0.9%	2%	2.8%	7.6
800	2087	1.3%	2.1%	2.8%	9.1
1000	2297	4.2%	5.3%	6.7%	11.1