  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.
