Can Tournament Selection Improve Performances of the Classical Particle Swarm Optimization Algorithm?
Conference: EuCAP 2009 - 3rd European Conference on Antennas and Propagation
03/23/2009 - 03/27/2009 at Berlin, Germany
Proceedings: EuCAP 2009
Pages: 4Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Golubovic, Ruzica; Mosig, Juan (Laboratory of Electromagnetics and Acoustics, Ecole Polytechnique Fédérale de Lausanne, Station 11, 1015 Lausanne, Switzerland)
Stevanovic, Ivica (Freescale Semiconductor, Rue de Lion 111, 1203 Geneva, Switzerland)
Olcan, Dragan (University of Belgrade, School of Electrical Engineering, P.O. Box 35-54, 11120 Belgrade, Serbia)
Abstract:
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 overal number of iterations (EM solver calls) is of a paramount relevance.