Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Extending Population-Based Incremental Learning to Continuous Search Spaces
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Telephone Network Traffic Overloading Diagnosis and Evolutionary Computation Techniques
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
On the importance of diversity maintenance in estimation of distribution algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The correlation-triggered adaptive variance scaling IDEA
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Initial approaches to the application of islands-based parallel EDAs in continuous domains
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
An estimation of distribution particle swarm optimization algorithm
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Black-box optimization benchmarking for noiseless function testbed using an EDA and PSO hybrid
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A modified particle swarm optimizer with a novel operator
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
| Hi-index | 0.00 |
Particle Swarm Optimization (PSO) is a stochastic optimization approach that originated from earlier attempts to simulate the behavior of birds and was successfully applied in many applications as an optimization tool. Estimation of distributions algorithms (EDAs) are a class of evolutionary algorithms which build a probabilistic model capturing the search space properties and use this model to generate new individuals. One research trend that emerged in the past few years is the hybridization of PSO and EDA algorithms. In this work, we examine one of these hybrids attempts that uses a Gaussian model for capturing the search space characteristics. We compare two different approaches, previously introduced into EDAs to prevent premature convergence, when incorporated into this hybrid algorithm. The performance of the hybrid algorithm with and without these approaches is studied using a suite of well-known benchmark optimization functions.