This paper explores the efficacy of two different recombination schemes of variable-wise SBX operator. Once two offspring variable values are created by SBX operator on two parent values, their concatenation to form two overall offspring variable vector is an important issue, which is not studied much. Here, we propose two methodologies: associated and assorted recombinations, and demonstrate the working on a number of non-linked, partially-linked and fully-linked problems. Based on the results, we suggest a linkage-based recombination scheme that employs either associated or assorted scheme depending on the level of linkage associated with a variable. © 2012 Springer-Verlag.
CITATION STYLE
Acharyya, A., & Deb, K. (2012). Associated and assorted recombination in SBX operator for problems with linkages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7677 LNCS, pp. 484–491). https://doi.org/10.1007/978-3-642-35380-2_57
Mendeley helps you to discover research relevant for your work.