Foundations of Generic Optimization

About this book

The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way.

In particular, it contains a refresher on the linear algebra used in the text as well as an elementary introductory chapter on genetic algorithms aimed at readers unacquainted with this notion.

In this way, the monograph aims to serve a broad audience consisting of graduate and advanced undergraduate students in mathematics and Computer Sciences, as well as researchers working in the domains of optimization, artificial intelligence, theoretical Computer Sciences, combinatorics and evolutionary algorithms.