{'fraction_non_alphanumeric': 0.021486123545210387, 'fraction_numerical': 0.0008952551477170994, 'mean_word_length': 5.280898876404494, '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}}
Pipe Routing of Reactor Based on Adaptive A* Algorithm Combined With Genetic Algorithm

To solve the complex 3-D space pipe routing problem, an algorithm framework combining genetic algorithm and adaptive A* algorithm (AAGA) is proposed. The initial population of the genetic algorithm is generated using the adaptive A* algorithm combined with the concept of intermediate join points, this method is also used in the generation of sub-paths in the crossover and mutation operations of genetic algorithms. On the one hand, this method improves the quality of the initial population and speeds up the optimization of genetic algorithm, on the other hand, it solves the problem that the genetic algorithm combined with the traditional A* algorithm (AGA) is prone to redundant inflection points. Finally, on the premise of ensuring pipeline connectivity, pipeline length and number of inflection points, the constraints of pipeline center of gravity and minimum bending radius are added to carry out simulation experiments. Simulation results show that the AAGA has better performance than adaptive A* algorithm and AGA.