{'fraction_non_alphanumeric': 0.012953367875647668, 'fraction_numerical': 0.0, 'mean_word_length': 5.6068376068376065, '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}}
Majorization of Artillery Fire Distribution Based on Quantum Genetic Algorithm

Artillery fire Distribution is a typical NP-hard problem, it will fall into the plight of local optimum when we use traditional methods to solve the problem. The idea of qubit and quantum gate are introduced to QGA(quantum genetic Algorithm ), which combine quantum computing with genetic algorithms and it possesses those characters such as higher velocity of convergence and better optimization seeking compared with traditional evolution algorithm. This thesis solve the problem of artillery fire distribution by QGA and It has been proved this method is more effective than traditional GA(genetic algorithm) in solving optimization of Artillery fire distribution by simulation experiment.