Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

<table>Single cutting-point crossover: new feasible solutions. For clarity, only the indices of the targets are reported and agent <svg height="7.1750002" id="M311" style="vertical-align:-0.1254pt" version="1.1" viewbox="0 0 7.9749999 7.1750002" width="7.9749999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,7.175)">
<g transform="translate(72,-66.26)">
<text transform="matrix(1,0,0,-1,-71.95,66.44)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑎</tspan>
</text>
</g>
</g>
</svg> is not considered.</table>

Mathematical Problems in Engineering

fig25

Figure 25

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