A new node-shift encoding representation for the travelling salesman problem
This work addresses the traveling salesman problem for optimization researchers, but it appears incremental as it focuses on a new encoding within an existing genetic algorithm framework.
The paper introduced a new genetic algorithm encoding representation for the traveling salesman problem and compared it with state-of-the-art methods using 14 benchmarks from TSPLIB, reporting the results without specifying concrete numbers.
This paper presents a new genetic algorithm encoding representation to solve the travelling salesman problem. To assess the performance of the proposed chromosome structure, we compare it with state-of-the-art encoding representations. For that purpose, we use 14 benchmarks of different sizes taken from TSPLIB. Finally, after conducting the experimental study, we report the obtained results and draw our conclusion.