Statistical Exploratory Analysis of Genetic Algorithms: The Influence of Gray Codes upon the Difficulty of a Problem

Abstract

Abstract. An important issue in genetic algorithms is the relationship between the difficulty of a problem and the choice of encoding. Two questions remain unanswered: is their a statistically demonstrable relationship between the difficulty of a problem and the choice of encoding, and, if so, what it the actual mechanism by which this occurs?In this paper we use components of a rigorous statistical methodology to demonstrate that the choice of encoding has a real effect upon the difficulty of a problem. Computer animation is then used to illustrate the actual mechanism by which this occurs.

Review of nature-inspired methods for wake-up scheduling in wireless sensor networks

“…It translates candidate solutions from the problem domain (phenotype) to the encoded search space (genotype) of the algorithm. In other words, it defines the internal representation of the problem instances used during the optimization process, so-called chromosome data structure and decoding function [119]. The data structure determines the actual size and shape of the search space.…”

Genetic Algorithm for the Column Subset Selection Problem

“…It translates candidate solutions from the problem domain (phenotype) to the encoded search space (genotype) of the algorithm and defines the internal representation of the problem instances used during the optimization process. The representation specifies the chromosome data structure and a decoding function [18]. The data structure defines the actual search space, its size and shape.…”

Calibrating strategies for evolutionary algorithms

“…For testing we used the same algorithm and conditions established in two well-known research publications, both related to parameter control strategies: [12] and [10]. There are:…”