“…When it comes to solve reconfigurable antenna problems, compared with traditional algorithms, evolutionary algorithms have the ability of obtaining excitation phases and amplitudes that can be practically implemented more easily by imposing additional constraints. So it is not uncommon, in the past decade, to see that different kinds of evolutionary algorithms, such as simulated annealing (SA) [4], genetic algorithm (GA) [5,6], particle swarm optimization algorithm (PSO) [7,8], and tabu search algorithm [9], have been advanced to handle reconfigurable antenna problems, especially for the problems of large scale.…”