DocumentCode
1938545
Title
Can tournament selection improve performances of the classical Particle Swarm Optimization Algorithm?
Author
Golubovic, Ruzica ; Stevanovic, Ivica ; Olcan, Dragan ; Mosig, Juan
Author_Institution
Lab. of Electromagn. & Acoust., Ecole Polytech. Fed. de Lausanne, Lausanne
fYear
2009
fDate
23-27 March 2009
Firstpage
506
Lastpage
509
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 overall number of iterations (EM solver calls) is of a paramount relevance.
Keywords
convergence; particle swarm optimisation; EM; PSO; binary tournament selection; convergence speed; electromagnetic optimization problem; particle swarm optimization algorithm; Acoustical engineering; Acoustics; Boundary conditions; Convergence; Dynamic range; Frequency; Geometry; Microstrip antennas; Multidimensional systems; Particle swarm optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Antennas and Propagation, 2009. EuCAP 2009. 3rd European Conference on
Conference_Location
Berlin
Print_ISBN
978-1-4244-4753-4
Electronic_ISBN
978-3-00-024573-2
Type
conf
Filename
5067676
Link To Document