General Subpopulation Framework and Taming the Conflict Inside Populations
- 1 March 2015
- journal article
- Published by MIT Press in Evolutionary Computation
- Vol. 23 (1) , 1-36
Abstract
Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics and structures keep the understanding and adoption rate of structured evolutionary algorithms low. Here, we propose a general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aiding the design of structured algorithms. The proposed framework is capable of generalizing most of the structured evolutionary algorithms, such as cellular algorithms, island models, spatial predator-prey, and restricted mating based algorithms. Moreover, we propose two algorithms based on the general subpopulation framework, demonstrating that with the simple addition of a number of single-objective differential evolution algorithms for each objective, the results improve greatly, even when the combined algorithms behave poorly when evaluated alone at the tests. Most importantly, the comparison between the subpopulation algorithms and their related panmictic algorithms suggests that the competition between different strategies inside one population can have deleterious consequences for an algorithm and reveals a strong benefit of using the subpopulation framework.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Behavioral diversity measures for Evolutionary Robotics2010
- A Study of Multiobjective Metaheuristics When Solving Parameter Scalable ProblemsIEEE Transactions on Evolutionary Computation, 2010
- On the Complexity of Computing the Hypervolume IndicatorIEEE Transactions on Evolutionary Computation, 2009
- Advances in Differential Evolution2008
- Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark ProblemsIEEE Transactions on Evolutionary Computation, 2006
- Evolutionary multi-objective optimization: a historical view of the fieldIEEE Computational Intelligence Magazine, 2006
- Main Chain Representation for Evolutionary Algorithms Applied to Distribution System ReconfigurationIEEE Transactions on Power Systems, 2005
- Parallelism and evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- On the performance assessment and comparison of stochastic multiobjective optimizers1996