Revealing the Inner Dynamics of Evolutionary Algorithms with Convection Selection
Abstract
Evolutionary algorithms are stochastic algorithms so they tend to find different solutions when run repeatedly. However, it is not just the solutions that vary - the very dynamics of the search that led to finding these solutions are likely to differ as well. It is especially in the algorithms with complex population structures - such as convection selection where a population is divided into subpopulations according to fitness values - where an opportunity for highly diverse dynamics arises. This work investigates the way evolutionary dynamics of subpopulations influence the performance of evolutionary algorithms with convection selection. We employ a demanding task of evolutionary design of 3D structures to analyze the relation between the properties of the optimization task and the features of the evolutionary process. Based on this analysis, we identify the mechanisms that influence the performance of convection selection, and suggest ways to improve this selection scheme.
References
[1]
William H. E. Day. 1984. Properties of Levenshtein metrics on sequences. Bulletin of Mathematical Biology 46, 2 (1984), 327--332.
[2]
Maciej Komosinski and Konrad Miazga. 2018. Comparison of the tournament-based convection selection with the island model in evolutionary algorithms. Journal of Comp. Sci. 32 (2018), 106--114.
[3]
Maciej Komosinski and Szymon Ulatowski. 2009. Framsticks: Creating and Understanding Complexity of Life. In Artificial Life Models in Software (2nd ed.), M. Komosinski and A. Adamatzky (Eds.). Springer, London, Chapter 5, 107--148.
[4]
Maciej Komosinski and Szymon Ulatowski. 2017. Multithreaded computing in evolutionary design and in artificial life simulations. The Journal of Supercomputing 73, 5 (2017), 2214--2228.
[5]
Maciej Komosinski and Szymon Ulatowski. 2023. Genetic encodings in Framsticks. http://www.framsticks.com/a/al_genotype
[6]
Hari Mohan Pandey, Ankit Chaudhary, and Deepti Mehrotra. 2014. A comparative review of approaches to prevent premature convergence in GA. Applied Soft Computing 24 (2014), 1047--1077.
[7]
D. Sudholt. 2020. The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses. Theory of Evol. Comput. (2020), 359--404.
[8]
Andrew James Turner and Julian Francis Miller. 2015. Neutral genetic drift: an investigation using Cartesian Genetic Programming. Genetic Programming and Evolvable Machines 16, 4 (2015), 531--558.
Index Terms
- Revealing the Inner Dynamics of Evolutionary Algorithms with Convection Selection
Recommendations
Fitness diversification in the service of fitness optimization: a comparison study
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference CompanionBlindly chasing after fitness is not the best strategy for optimization of hard problems, as it usually leads to premature convergence and getting stuck in low-quality local optima. Several techniques such as niching or quality-diversity algorithms have ...
Evolutionary and population dynamics of 3 parents differential evolution (3PDE) using self-adaptive tuning methodologies
Differential Evolution is known for its simplicity and effectiveness as an evolutionary optimizer. In recent years, many researchers have focused on the exploration of Differential Evolution (DE). The objective of this paper is to show the evolutionary ...
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2023
2519 pages
Copyright © 2023 Owner/Author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2023
Check for updates
Author Tags
Qualifiers
- Poster
Conference
GECCO '23 Companion
Sponsor:
GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation
July 15 - 19, 2023
Lisbon, Portugal
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in