Traveling salesman problem

To evaluate the efficiency of the GA-SA3-opt algorithm, problems from the TSPLIB standard library are selected for simulation and testing. The computational environment is configured with an Intel i5-10200H 2.60GHz CPU and MATLAB 9.0.0.341360 (R2016a) 64-bit.

First, the convergence speed of the algorithms is tested using the eil101 problem from TSPLIB. The optimal paths for each algorithm applied to the Eil101 problem are shown in figure 9.