Document Type
Article
Rights
Available under a Creative Commons Attribution Non-Commercial Share Alike 4.0 International Licence
Disciplines
1.2 COMPUTER AND INFORMATION SCIENCE, Computer Sciences
Abstract
There has been a variety of crossover operators proposed for Real-Coded Genetic Algorithms (RCGAs), which recombine values from the same location in pairs of strings. In this article we present a recombination operator for RC- GAs that selects the locations randomly in both parents, and compare it to mainstream crossover operators in a set of experiments on a range of standard multidimensional optimization problems and a clustering problem. We present two variants of the operator, either selecting both bits uniformly at random in the strings, or sampling the second bit from a normal distribution centered at the selected location in the first string. While the operator is biased towards exploitation of fitness space, the random selection of the second bit for swap- ping makes it slightly less exploitation-biased. Extensive statistical analysis using a non-parametric test shows the advantage of the new recombination operators on a range of test functions. K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms. Available from: https://www.researchgate.net/publication/301560655_K-Bit-Swap_A_New_Operator_For_Real-Coded_Evolutionary_Algorithms [accessed Oct 12 2017].
DOI
https://doi.org/10.1007/s00500-016-2170-6
Recommended Citation
Ter-Sarkisov, A. & Marsland, S. (2017) K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms, SOFT COMPUTING, 21 (20):6133-6142; OCT 2017. DOI: 10.1007/s00500-016-2170-6
Publication Details
SOFT COMPUTING, 21 (20):6133-6142; SI 10.1007/s00500-016-2170-6 OCT 2017