Parallel Evolutionary Algorithm for the Traveling Salesman Problem
Wojciech Bo · 2007
In this paper we present a evolutionary algorithm for solving traveling salesman problem (TSP). It deals with testing feasible solutions which are local minima. This method is based on the following observation: if there are the same elements in some positions in several permutations, which are local minima, then these elements are in the same position in the optimal solution. Computational experiments on the benchmark instances from the TSP-Library (9) are presented and compared with the results yielded by the best algorithms discussed in the literature. These results show that the algorithm proposed allows us to obtain the best known results for the benchmarks in a short time. c 2007 European Society of Computational Methods in Sciences and Engineering