Skip to Main Content
Particle swarm optimization (PSO) is a powerful evolutionary computation technique for solving continuous-valued optimization problems in various fields of engineering. However, its binary version could not attract much attention such that research on the discrete form of the PSO is currently not massive. In this paper, the Boolean PSO is introduced based on the idea of using the Boolean algebra in the implementation of PSO concepts in the binary space. The proposed algorithm is applied to a hard multiobjective electromagnetic problem, namely to an antenna design problem. The appropriate behavior of the optimization process in comparison with genetic algorithm is demonstrated. The paper also presents the measurement results on a planar antenna whose layout was generated by the proposed Boolean PSO.