Can tournament selection improve performances of the classical Particle Swarm Optimization Algorithm?

摘要

Particle Swarm Optimization (PSO) algorithm is known to be very efficient solution for electromagnetic (EM) optimization problems. In this paper we show that binary tournament selection applied to PSO algorithm further speeds-up its convergence. Having in mind that EM simulation is the most time-consuming part of the optimization, reducing the overall number of iterations (EM solver calls) is of a paramount relevance.