Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="483643.fig.0015a" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0015a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Edge diversity</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="483643.fig.0015b" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0015b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Boolean diversity</td></tr></table></td></tr></table>

<table>How the application of the singular mating pool technique affects the edge (a) and boolean (b) diversity (%) of the population.</table>

Mathematical Problems in Engineering

fig15

Figure 15

Figure 15: Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem 