Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem
Figure 4
(a) Given the set of targets and the agent , , with , is the augmented vertex set. In (b), a subtour of length 2 (the agent visits the targets associated with the vertices and ) is shown, while in (c), the cheapest Hamiltonian path (the agent visits all the given targets) is depicted. (d) shows the -TSP with , and in (e), the optimal solution of the Traveling Salesman Problem is drawn.