{'fraction_non_alphanumeric': 0.011235955056179775, 'fraction_numerical': 0.0, 'mean_word_length': 5.405228758169935, '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}}
Novel Methodology for Designing Antenna Arrays with Reduced Number of Elements Based on Differential Evolution with Ranking-Based Mutation Operators

This paper addresses the problem of designing linear arrays with reduced number of elements and design constraints including the minimum and maximum distance between two adjacent elements. The proposed design method is based on Differential Evolution (DE) with ranking-based mutation operators. In this case, some of the vectors in the mutation operator are probabilistically selected according to their ranking in the current population instead of recurring to a random selection as in the original DE. A comparative study among different DE algorithms is carried out to define the optimum element geometry and set of excitations that produce the desired pattern with a reduced number of elements. The results show that DE enhanced with ranking-based mutation operator is highly efficient and outperforms the common DE variants.