{'fraction_non_alphanumeric': 0.02032176121930567, 'fraction_numerical': 0.003386960203217612, 'mean_word_length': 5.715909090909091, '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}}
Three‐phase adaptive differential evolution for antenna array synthesis

Antenna array synthesis is a complex nonlinear optimization problem. Differential evolution (DE) is an efficient method to solve the problem of antenna array synthesis. Different mutation strategies applied in different evolutionary phases can improve the search ability of DE. In this paper, a three‐phase adaptive differential evolution (TADE) algorithm is proposed for antenna array synthesis problems. In TADE, the evolution process is divided into three phases according to the population fitness distribution and iterative information, namely, the initial phase, the stable phase, and the precise phase. Based on statistical information of population fitness values, a suitable mutation strategy of each phase is designed for enhancing the optimization performance. The performance of the TADE algorithm is verified by a CEC 2013 test suite, three circular antenna array problems, and a planar antenna array problem. The results show that the TADE algorithm achieves better performance in solving antenna array synthesis than several advanced DE variants and some non‐DE global optimization algorithms.