2000 character limit reached
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem (2001.11590v1)
Published 14 Jan 2020 in cs.NE and cs.AI
Abstract: 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.