Research Article

Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Figure 3

Given the set of targets 𝑇 = { 𝑡 1 , , 𝑡 4 } and the agent 𝑎 , (b) shows the augmented vertex set 𝑉 = { 𝑣 1 , , 𝑣 5 } = 𝑇 𝑎 , where ( 𝑣 5 = 𝑎 ), while (c) shows the complete graph 𝐾 5 ( 𝑉 ) generated by the augmented vertex set 𝑉 .
483643.fig.003a
(a) Targets and agent
483643.fig.003b
(b) Vertex set 𝑉 = 𝑇 𝑎
483643.fig.003c
(c) Complete graph 𝐾 5 ( 𝑉 )