Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">Instances</td><td class="align_center">Optimal solution (improved GA)</td><td class="align_center">Optimal solution (TSPLIB)</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">ulysses22</td><td class="align_center">75.27</td><td class="align_center">74</td></tr><tr><td class="align_left">att48</td><td class="align_center">33523.7</td><td class="align_center">33,522</td></tr><tr><td class="align_left">eil76</td><td class="align_center">545.25</td><td class="align_center">538</td></tr><tr><td class="align_left">rand100</td><td class="align_center">7920.8</td><td class="align_center">7891</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Comparison of the improved GA and TSPLIB.</div>

Journal of Advanced Transportation

tab3

Table 3

Table 3: Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space 