A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case
Figure 3
(a) Graphs showing tours encoded in two chromosomes and the outdegree of each city. For instance, the outdegree of city 1 is . (b) Same information given in (a) represented as an adjacency matrix which makes it easier to understand how the average size of the search space is computed. The number 2 in the denominator in (4) indicates that the adjacency matrix is symmetric in this case.
