Linkage in Evolutionary Computation

In recent years, the issue of linkage in GEAs has garnered greater attention and recognition from researchers. Conventional approaches that rely much on ad hoc tweaking of parameters to control the search by balancing the level of exploitation and exploration are grossly inadequate. As shown in the work reported here, such parameters tweaking based approaches have their limits; they can be easily ”fooled” by cases of triviality or peculiarity of the class of problems that the algorithms are designed to handle. Furthermore, these approaches are usually blind to the interactions between the decision variables, thereby disrupting the partial solutions that are being built up along the way.

In recent years, the issue of linkage in GEAs has garnered greater attention and recognition from researchers. Conventional approaches that rely much on ad hoc tweaking of parameters to control the search by balancing the level of exploitation and exploration are grossly inadequate. As shown in the work reported here, such parameters tweaking based approaches have their limits; they can be easily ”fooled” by cases of triviality or peculiarity of the class of problems that the algorithms are designed to handle. Furthermore, these approaches are usually blind to the interactions between the decision variables, thereby disrupting the partial solutions that are being built up along the way.

The whole volume consisting of 19 chapters is divided into 3 parts: Models and Theories; Operators and Frameworks; Applications. This edited volume will serve as a useful guide and reference for researchers who are currently working in the area of linkage. For postgraduate research students, this volume will serve as a good source of reference. It is also suitable as a text for a graduate level course focusing on linkage issues. For practitioners who are looking at putting into practice the concept of linkage, the few chapters on applications will serve as a useful guide.