A new node-shift encoding representation for the travelling salesman problem
Neural and Evolutionary Computing
2023-05-17 v1 Artificial Intelligence
Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.2305.09257,
title = {A new node-shift encoding representation for the travelling salesman problem},
author = {Menouar Boulif and Aghiles Gharbi},
journal= {arXiv preprint arXiv:2305.09257},
year = {2023}
}
Comments
6 pages, 5 figures. Accepted in ICL2022, Jeddah, Saudi Arabia conference (postponed to 2024)