Antenna Design Using Binary Differential Evolution: Application to discrete-valued design problems

Several antenna design problems are discrete valued. Particle swarm optimization (PSO) and differential evolution (DE) are popular evolutionary algorithms that have been applied to a number of design problems in electromagnetics. However, both PSO and DE are best suited for continuous search spaces. Therefore, to apply these to binary-coded combinatorial optimization problems, binary versions of the aforementioned algorithms must be used. In this article, we introduce a design technique based on novel binary DE (NBDE). The main benefit of NBDE is reserving the DE updating strategy to binary space.