# New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Jan 2020.

## Built on by (most cited first, 1 of 1)

- [A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization](https://mlsanity.com/paper/2102.09954/) (2021)

## Abstract (arXiv)

Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. In this paper, we propose two new crossover operators and new mechanism of combination crossover operators in genetic algorithm for solving TSP. We experimented on TSP instances from TSP-Lib and compared the results of proposed algorithm with genetic algorithm (GA), which used MSCX. Experimental results show that, our proposed algorithm is better than the GA using MSCX on the min, mean cost values.