Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

<table>Example of a subtour problem generated by a <svg height="10.8625" id="M270" style="vertical-align:-0.3135pt" version="1.1" viewbox="0 0 32.700001 10.8625" width="32.700001" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.8625)">
<g transform="translate(72,-63.31)">
<text transform="matrix(1,0,0,-1,-71.95,63.67)">
<tspan style="font-size: 12.50px; " x="0" y="0">7</tspan>
<tspan style="font-size: 12.50px; " x="9.0271664" y="0">×</tspan>
<tspan style="font-size: 12.50px; " x="19.804752" y="0">7</tspan>
</text>
</g>
</g>
</svg> grid (circles), with 9 more added targets (squares).</table>

Mathematical Problems in Engineering

fig17

Figure 17

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