k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation
- 31 August 2016
- book chapter
- Published by Springer Nature
- p. 824-834
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal Parameter Choices via Precise Black-Box Analysis2016
- Performance analysis of randomised search heuristics operating with a fixed budgetTheoretical Computer Science, 2014
- Parameter Control in Evolutionary Algorithms: Trends and ChallengesIEEE Transactions on Evolutionary Computation, 2014
- Analyzing Evolutionary Algorithms2013
- Analyzing Randomized Search Heuristics: Tools from Probability Theory2011
- Theoretical analysis of rank-based mutation - combining exploration and exploitation2009
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problemTheoretical Computer Science, 2007
- On the analysis of a dynamic evolutionary algorithmJournal of Discrete Algorithms, 2005
- Parameter control in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 1999
- An Overview of Parameter Control Methods by Self-Adaptation in Evolutionary AlgorithmsFundamenta Informaticae, 1998