General Subpopulation Framework and Taming the Conflict Inside Populations
Preprint
Abstract
Structured evolutionary algorithms have been investigated for some time. However, they have been under-explored specially in the field of multi-objective optimization. Despite their good results, the use of complex dynamics and structures make their understanding and adoption rate low. Here, we propose the general subpopulation framework that has the capability of integrating optimization algorithms without restrictions as well as aid 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 under its formalization. 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 reveal a strong benefit of using the subpopulation framework. The code for SAN, the proposed multi-objective algorithm which has the current best results in the hardest benchmark, is available at the following https://github.com/zweifel/zweifelKeywords
All Related Versions
- Version 1, 2019-01-02, ArXiv
- Published version: Evolutionary Computation, 23 (1), 1.
This publication has 15 references indexed in Scilit:
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter OptimizationJournal of Heuristics, 2008
- Improved evolutionary optimization from genetically adaptive multimethod searchProceedings of the National Academy of Sciences, 2007
- Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark ProblemsIEEE Transactions on Evolutionary Computation, 2006
- A review of multiobjective test problems and a scalable test problem toolkitIEEE Transactions on Evolutionary Computation, 2006
- Evolutionary multi-objective optimization: a historical view of the fieldIEEE Computational Intelligence Magazine, 2006
- A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems2005
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997