A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr class="thead"><td class="align_left">Cell</td><td class="align_center">Route</td><td class="align_center">Distance</td><td class="align_center">Cell</td><td class="align_center">Route</td><td class="align_center">Distance</td></tr><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr><td class="align_left"><i>V</i></td><td class="align_center">4 3 2 7 10 6 8 1 5 9</td><td class="align_center">290.6597</td><td class="align_center">O2</td><td class="align_center">9 3 2 7 10 6 8 4 1 5</td><td class="align_center">296.2696</td></tr><tr><td class="align_left">AE</td><td class="align_center">7 8 1 9 3 5 10 4 2 6</td><td class="align_center">244.1511</td><td class="align_center">O3</td><td class="align_center">1 8 4 9 3 5 10 2 6 7</td><td class="align_center"><b>258.7903</b></td></tr><tr><td class="align_left">O1</td><td class="align_center">4 8 1 9 3 5 10 2 6 7</td><td class="align_center">264.5371</td><td class="align_center">O4</td><td class="align_center">9 4 8 6 10 7 2 3 1 5</td><td class="align_center">286.1712</td></tr><tr class="table-tr"><td colspan="6"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Individuals in crossover and mutation process.</div>

Mathematical Problems in Engineering

tab3

Table 3

Table 3: A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem 