Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Systems 9(2), 115–148 (1995)
Harik, G., Goldberg, D.E.: Learning linkages. In: Foundations of Genetic Algorithms 4 (FOGA-4), pp. 247–262 (1996)
Munetomo, M., Goldberg, D.E.: Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation 7(4), 377–398 (1999)
Deb, K., Sinha, A., Kukkonen, S.: Multi-objective test problems, linkages and evolutionary methodologies. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006), pp. 1141–1148. The Association of Computing Machinery (ACM), New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acharyya, A., Deb, K. (2012). Associated and Assorted Recombination in SBX Operator for Problems with Linkages. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2012. Lecture Notes in Computer Science, vol 7677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35380-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-35380-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35379-6
Online ISBN: 978-3-642-35380-2
eBook Packages: Computer ScienceComputer Science (R0)