Representations for Genetic and Evolutionary Algorithms

The book summarizes existing knowledge regarding problem representations and describes how basic properties of representations, such as redundancy, scaling, or locality, influence the performance of GEAs and other heuristic optimization methods. Using the developed theory, representations can be analyzed and designed in a theory-guided matter. The theoretical concepts are used for solving integer optimization problems and network design problems more efficiently.