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.0014a" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0014a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>The singular mating pool is not used</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="483643.fig.0014b" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0014b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>The singular mating pool is used</td></tr></table></td></tr></table>

<table>(a) Simulation without using the singular mating pool. The duplicated chromosomes lead to premature convergence. (b) Simulation with the singular mating pool technique. With duplicate chromosomes removed from the populations, the diversity of solutions is maintained.</table>

Mathematical Problems in Engineering

fig14

Figure 14

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