The TSP(Travelling Salesman Problem) is unique in that we need to incorporate all locations exactly one time. To follow this rule, we can use a special breeding function called ordered crossover. In an ordered crossover, we randomly select a subset of the first parent string and then fill the remainder of the route with the genes from the second parent in the order in which they appear, without duplicating any genes in the selected subset from the first parent.
For more information regarding the same, refer to the following link: https://www.scribd.com/document/101866504/1989-On-Genetic-Crossover-Operators-for-Relative-Order-Preservation
If you are looking to learn more about Artificial Intelligence then visit this Artificial Intelligence Course which will cover topics like Euclidean distance,Pearson Correlation Coefficient,Brute Force Algorithms,traveling salesman problem,NeuroEvolution of Augmenting Topologies,Fitness Function ,Resolution Algorithm,k-nearest neighbors algorithm ,Markvo Model ,Genetic Algorith,deep first iterative deeping and many more.So Enroll for the course Now.
Back