Research Article

Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Figure 7

Order-based representation: the chromosome (possible solution) is coded as the sequence of visited targets. In (a), the set of targets 𝑇 = { 𝑡 1 , , 𝑡 5 } and the agent 𝑎 are shown. In (b), a path visiting 4 targets ( 𝑃 𝒫 4 ( 𝐾 6 ( 𝑉 ) ) ) is illustrated on the vertex set 𝑉 = 𝑇 𝑎 . The associated chromosome is represented as the sequence of the visited targets, with 𝑎 = 𝑣 6 , thus 𝐬 = ( 𝑎 , 𝑡 1 , 𝑡 3 , 𝑡 5 , 𝑡 2 ) (see (c)).
483643.fig.007a
(a) Targets and agents
483643.fig.007b
(b) Path in 𝒫 4 ( 𝐾 6 ( 𝑉 ) )
483643.fig.007c
(c) Chromosome