{'fraction_non_alphanumeric': 0.021442495126705652, 'fraction_numerical': 0.001949317738791423, 'mean_word_length': 4.840909090909091, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator

This paper addresses an attempt to evolve Genetic Algorithm by a particular modified Partially Mapped Crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg [1]) and then a modified PMX to evolve a GA.