{'fraction_non_alphanumeric': 0.022988505747126436, 'fraction_numerical': 0.0, 'mean_word_length': 6.119496855345912, '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}}
An OSGI-MPH Algorithm for Solving Combinatorial Optimization Problem

Travelling Salesman Problem(TSP) is a classical combinatorial optimization problem. There are numerous algorithms to solve it in the field, like Genetic Algorithm, Any Colony Algorithm, Simulated Annealing Algorithm. However, these algorithms usually have the weak global seach ability, premature converging capability, weak parallel ability and poor accuracy. Particularly, when facing large-scale combinatorial optimization problems, the algorithms above often require a great time cost. In this paper, we propose OSGI-MPH(Multi Parent Hybrid Algorithm based on Optimal Selection and Gene Insertion) by integrating a variety of heuristic seaerch algorithms and intelligent optimization algorithms. The algorithms and intelligent optimization algorithms. The algorithms has excellent global search ability and convergence ability. We test the performance of the algorithm in large-scale TSPLIB instances, and the results show that the algorithm has excellent performance compared with the traditional heuristic algorithm and intelligent optimization algorithm.