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.0018a" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0018a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Speed of convergence</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="483643.fig.0018b" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0018b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Distributions of subtour lengths after 250 generations</td></tr></table></td></tr></table>

<table>The convergence of the 50-from-489 Subtour Problem is shown. Subtour lengths are normalized with the optimal one (length = 0.0707). In (a) the speed of converge is shown. Note that the last simulation converges after 2045 generations. (b) Shows the distribution of the subtour lengths after 250 generations, considering 100 simulations.</table>

Mathematical Problems in Engineering

fig18

Figure 18

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