{'fraction_non_alphanumeric': 0.018538713195201745, 'fraction_numerical': 0.0, 'mean_word_length': 5.8, '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}}
Evaluation of stochastic algorithm performance on antenna optimization benchmarks

This paper evaluates performance of ten stochastic search algorithms on a benchmark suite of four antenna optimization problems. Hill climbers (HC) serve as baseline algorithms. We implement several variants of genetic algorithms, evolution strategies, and genetic programming as examples of competitive strategy for achieving optimal solution. Ant colony and particle-swarm optimization represent cooperative strategy. Static performance is measured in terms of success rates and mean hit time, while dynamic performance is evaluated from the development of the mean solution quality. Among the evaluated algorithms, steady-state GA provides the best trade-off between efficiency and effectiveness. PSO is recommended for noisy problems, while ACO and GP should be avoided for antenna optimizations because of their low efficiencies.