Dynamic Reduction-Expansion Operator to Improve Performance of Genetic Algorithms for the Traveling Salesman Problem

Figure 2

TSP instance a280.tsp [9]: (a) complete set of nodes, (b) optimal total route for the complete set, (c) clustering of the complete set, (d) optimal total route for the reduced set, and (e) declustered total route for the complete set of nodes.

(a)

(b)

(c)

(d)

(e)