{'fraction_non_alphanumeric': 0.02406159769008662, 'fraction_numerical': 0.0028873917228103944, 'mean_word_length': 5.459627329192546, '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}}
Comparison of Binary Evolutionary Algorithms for Optimization of Thinned Array Antennas

Binary problems are common in engineering and they can be suitably faced with Evolutionary Optimization. In the antenna field, these problems are quite common and they are characterized to be often multi-modal and non-convex, so they cannot be easily solved by means of standard optimization techniques. In particular, three different Evolutionary Algorithms have been frequently considered in recent years in the field of antenna arrays optimization, namely Stud-Genetic Algorithm (Stud-GA), binary Particle Swarm Optimization (bPSO) and Social Network Optimization (SNO). The aim of this paper is to extensively compare these three heuristics over standard benchmark functions and on a well-known antenna problem, i.e. the optimization of a thinned array. Numerical simulation will be conducted on an array of 121 elements and performances of the different approaches will be compared and validated over this real-world electromagnetic application.