Impact of Crossover Probability on Symmetric Travel Salesman Problem Efficiency
Keywords:Genetic Algorithm, Crossover, mutation, TSP
Genetic algorithm (GA) is a powerful evolutionary searching technique that is used successfully to solve and optimize problems in different research areas. Genetic Algorithm (GA) considered as one of optimization methods used to solve Travel salesman Problem (TSP). The feasibility of GA in finding TSP solution is dependent on GA operators; encoding method, population size, number of generations in general. In specific, crossover and its probability play a significant role in finding possible solution for Symmetric TSP (STSP). In addition, crossover should be determined and enhanced in term reaching optimal or at least near optimal. In This paper, we spot the light on using modified crossover method called Modified sequential constructive crossover and its impact on reaching optimal solution. To justify the relevance of parameters value in solving TSP, a set comparative analysis conducted on different crossover methods values.
How to Cite
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.
This journal has been awarded the SPARC Europe Seal for Open Access Journals (What's this?)