Frankenstein's PSO: A Composite Particle Swarm Optimization Algorithm
Montes de Oca, M.A.
Stutzle, T.
Birattari, M.
Dorigo, M.
Inst. de Recherches Interdisciplinaires et de Developpements en Intell. Artificielle, Univ. Libre de Bruxelles, Brussels, Belgium;
This paper appears in: Evolutionary Computation, IEEE Transactions on
Publication Date: Oct. 2009
Volume: 13,
Issue: 5
On page(s): 1120-1132
ISSN: 1089-778X
INSPEC Accession Number: 10879797
Digital Object Identifier: 10.1109/TEVC.2009.2021465
First Published: 2009-08-18
Current Version Published: 2009-09-22
Abstract
During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed. In many cases, the difference between two variants can be seen as an algorithmic component being present in one variant but not in the other. In the first part of the paper, we present the results and insights obtained from a detailed empirical study of several PSO variants from a component difference point of view. In the second part of the paper, we propose a new PSO algorithm that combines a number of algorithmic components that showed distinct advantages in the experimental study concerning optimization speed and reliability. We call this composite algorithm Frankenstein's PSO in an analogy to the popular character of Mary Shelley's novel. Frankenstein's PSO performance evaluation shows that by integrating components in novel ways effective optimizers can be designed.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
