![]() |
|
|||
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
|
![]() |
[an error occurred while processing this directive]
where α is in the (0, 1) interval. The continuity of the coding scheme also implies a number of possible mutation operators. For instance, one can modify the coordinates of the strings by some random increments. The examples below provide a representative sample of possible crossover operators. Here x and y denote two original strings involved in the crossover operation while z is the result of crossover
We would like to stress that the discussed types of coding capture the problem of representing parameters of the system of interest. The representation of structures (e.g., topologies of the neural networks) has not been tackled and this issue is far more demanding. In particular, we should strive for the integrity of the representation scheme (encoding and decoding) and the ensuing recombination and mutation mechanisms. Both of them should assure that once starting from meaningful individuals the results lead to meaningful offsprings. This step is crucial to the success of Evolutionary Computation yet its solution should not be taken for granted. In fact, this phase has not been formalized and definitely calls for a prudent incorporation of domain knowledge about the problem at hand. 5.6. Exploration and exploitation of the search spaceAny optimization problem is usually split into two phases called exploration and exploitation of the search space. While the role of the GA machinery becomes more profound at the exploration level, evolutionary methods possess the abilities of space exploitation. The exploration - exploitation trade-off is achieved by modifying some of the parameters of the GAs. For instance:
Quite often the GA approach is followed by a more detailed and exploitation-oriented hill-climbing algorithm. An example of the representative tandem of two methods comes in the form of the GA followed by a sort of gradient-based algorithm, Fig. 5.11. In this sense, a phenotypic learning can influence the genotype. As the GA and hill-climbing optimization interact, this somewhat alludes to the Darwinian and Lamarckian models of evolution. Let us recall that the latter model admits an inheritance of learned characteristics.
5.7. Experimental studiesThe following examples illustrate the performance of several basic versions of the genetic algorithm. In particular, we discuss several forms of coding (binary, Gray, and floating-point). The function to be minimized is a simple quadratic expression defined in the unit square The fitness function is defined as 5 - f(x1, x2). The global minimum is located at x1 = 0.5 and x2 = 0.7. In all versions of the GA the population comprises 15 strings. The crossover and mutation rates were equal to 0.5 and 0.05, respectively. The progress of evolution is monitored via the values of the fitness function, both for the best individual and its average of the entire population. The GA was run for 40 populations.
5.8. Classes of evolutionary computationIn what follows, we summarize the three important classes of EC such as evolutionary strategies, evolutionary programming, and genetic programming. While all of them deal with the same principle that is a population-based computation, they become quite distinct when it comes to underlying concepts.
Copyright © CRC Press LLC
![]() |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |