Crossover operation in genetic algorithm for TSP

Question

I'm trying to solve the Travelling Salesman Problem (TSP) with a Genetic algorithm. My genome is a permutation of a vertex in a graph (path for the salesman). How should I perform the crossover operation over my genomes? Where can I find implementations of my problem in C#? Select the correct answer from above options

Answer 1

The traveling salesman problem (TSP) is one of the most famous benchmarks, significant, historic, and very hard combinatorial optimization problem.TSP can be described as the minimization of the total distance traveled by touring all cities exactly once and return to depot city(finishing node). Crossover is the most significant phase in a genetic algorithm. For each pair of parents to be mated, a crossover point is chosen at random from within the genes. For example, consider the crossover point to be 3 as shown below. Offspring are created by exchanging the genes of parents among themselves until the crossover point is reached. The new offspring are added to the population. You can refer the following link for the implementation of your program in C#: https://www.c-sharpcorner.com/article/how-to-use-genetic-algorithm-for-traveling-salesman-problem/ Hope this answer helps! If you want to make your career in Artificial Intelligence then go through this video: