PSO is a powerful evolutionary algorithm used for finding global solution to a multidimensional problem. Particles in PSO tend to re-explore already visited bad solution regions of search space because they do not learn as a whole. This is avoided by restricting particles into promising regions through probabilistic modeling of the archive of best solutions. This paper presents hybrids of estimation of distribution algorithm and two PSO variants. These algorithms are tested on benchmark functions having high dimensionalities. Results indicate that the methods strengthen the global optimization abilities of PSO and therefore, serve as attractive choices to determine solutions to optimization problems in areas including sensor networks.
R. V. Kulkarni and G. K. Venayagamoorthy, "An Estimation of Distribution Improved Particle Swarm Optimization Algorithm," Proceedings of the International Conference on Intelligent Sensors, Sensor Networks and Information, 2007. ISSNIP 2007, Institute of Electrical and Electronics Engineers (IEEE), Dec 2007.
The definitive version is available at http://dx.doi.org/10.1109/ISSNIP.2007.4496900
International Conference on Intelligent Sensors, Sensor Networks and Information, 2007. ISSNIP 2007
Electrical and Computer Engineering
Keywords and Phrases
Estimation Theory; Evolutionary Computation; Particle Swarm Optimisation; Probability; Search Problems
Article - Conference proceedings
© 2007 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.