{'fraction_non_alphanumeric': 0.012690355329949238, 'fraction_numerical': 0.0, 'mean_word_length': 5.362903225806452, '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}}
A global approach to optimal space trajectory design

In this paper a combination of Evolution Programming and Branching is used to solve some typical problems in space trajectory design: finding a number of possible minimum cost transfers, including the global one, between two celestial bodies. The idea is to use a limited population evolving for a small number of generations, according to some specific evolution rules, in subregions of the solution space defined by a branching procedure. On the other hand the branching rules are functions of the outcome from the local evolution optimization. The proposed combined systematic-heuristic global optimization performs quite well on the analyzed cases suggesting the possibility of more complex application in space trajectory design.