A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Looking Inside Particle Swarm Optimization in Constrained Search Spaces
[chapter]
2008
Lecture Notes in Computer Science
In this paper, the behavior of different Particle Swarm Optimization (PSO) variants is analyzed when solving a set of well-known numerical constrained optimization problems. After identifying the most competitive one, some improvements are proposed to this variant regarding the parameter control and the constraint-handling mechanism. Furthermore, the on-line behavior of the improved PSO and some of the most competitive original variants are studied. Two performance measures are used to analyze
doi:10.1007/978-3-540-88636-5_43
fatcat:i3mec2ix7vb33at2l2zwb5kpda