# A new node-shift encoding representation for the travelling salesman problem

arXiv: https://arxiv.org/abs/2305.09257 · HTML: https://mlsanity.com/paper/2305.09257/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 23 references that are in the map.
- First posted on arXiv 16 May 2023.

## Builds on (most cited first, 1 of 1)

- [Heterogeneous Parallel Genetic Algorithm Paradigm](https://mlsanity.com/paper/1905.06636/) (2019)

## Abstract (arXiv)

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.