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.0023a" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0023a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>76 cities and 5 agents</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="483643.fig.0023b" src="https://static.hindawi.com/articles/mpe/volume-2011/483643/figures/483643.fig.0023b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>100 cities and 5 agents</td></tr></table></td></tr></table>

Mathematical Problems in Engineering

fig23

Figure 23

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