Associated and assorted recombination in SBX operator for problems with linkages

Authors:
Arnav Acharyya;Kalyanmoy Deb
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology Bhubaneswar, India;Department of Mechanical Engineering, Indian Institute of Technology Kanpur, India
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 2
Cited 0

Multi-objective test problems, linkages, and evolutionary methodologies

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Linkage identification by non-monotonicity detection for overlapping functions

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.