《外文文献—遗传算法》由会员分享，可在线阅读，更多相关《外文文献—遗传算法（22页珍藏版）》请在金锄头文库上搜索。
1、附录 I 英文翻译第一部分 英文原文文章来源： 书名：自然赋予灵感的元启发示算法第二、三章 出版社：英国Luniver 出版社 出版日期：2008 Chapter 2 Genetic Algorithms 2.1 Introduction The genetic algorithm (GA), developed by John Holland and his collaborators in the 1960s and 1970s, is a model or abstraction of biological evolution based on Charles Darwins theor
2、y of natural selection. Holland was the first to use the crossover and recombination, mutation, and selection in the study of adaptive and artificial systems. These genetic operators form the essential part of the genetic algorithm as a problem-solving strategy. Since then, many variants of genetic
3、algorithms have been developed and applied to a wide range of optimization problems, from graph colouring to pattern recognition, from discrete systems (such as the travelling salesman problem) to continuous systems (e.g., the efficient design of airfoil in aerospace engineering), and from financial
4、 market to multiobjective engineering optimization. There are many advantages of genetic algorithms over traditional optimization algorithms, and two most noticeable advantages are: the ability of dealing with complex problems and parallelism. Genetic algorithms can deal with various types of optimi
5、zation whether the objective (fitness) functionis stationary or non-stationary (change with time), linear or nonlinear, continuous or discontinuous, or with random noise. As multiple offsprings in a population act like independent agents, the population (or any subgroup) can explore the search space
6、 in many directions simultaneously. This feature makes it ideal to parallelize the algorithms for implementation. Different parameters and even different groups of strings can be manipulated at the same time. However, genetic algorithms also have some disadvantages.The formulation of fitness functio
7、n, the usage of population size, the choice of the important parameters such as the rate of mutation and crossover, and the selection criteria criterion of new population should be carefully carried out. Any inappropriate choice will make it difficult for the algorithm to converge, or it simply prod
8、uces meaningless results. 2.2 Genetic Algorithms 2.2.1 Basic Procedure The essence of genetic algorithms involves the encoding of an optimization function as arrays of bits or character strings to represent the chromosomes, the manipulation operations of strings by genetic operators, and the selecti
9、on according to their fitness in the aim to find a solution to the problem concerned. This is often done by the following procedure:1) encoding of the objectives or optimization functions; 2) defining a fitness function or selection criterion; 3) creating a population of individuals; 4) evolution cy
10、cle or iterations by evaluating the fitness of all the individuals in the population,creating a new population by performing crossover, and mutation,fitness-proportionate reproduction etc, and replacing the old population and iterating again using the new population;5) decoding the results to obtain
11、 the solution to the problem. These steps can schematically be represented as the pseudo code of genetic algorithms shown in Fig. 2.1. One iteration of creating a new population is called a generation. The fixed-length character strings are used in most of genetic algorithms during each generation a
12、lthough there is substantial research on the variable-length strings and coding structures.The coding of the objective function is usually in the form of binary arrays or real-valued arrays in the adaptive genetic algorithms. For simplicity, we use binary strings for encoding and decoding. The genet
13、ic operators include crossover,mutation, and selection from the population.The crossover of two parent strings is the main operator with a higher probability and is carried out by swapping one segment of one chromosome with the corresponding segment on another chromosome at a random position (see Fi
14、g.2.2). The crossover carried out in this way is a single-point crossover. Crossover at multiple points is also used in many genetic algorithms to increase the efficiency of the algorithms. The mutation operation is achieved by flopping the randomly selected bits (see Fig. 2.3), and the mutation pro
15、bability is usually small. The selection of an individual in a population is carried out by the evaluation of its fitness, and it can remain in the new generation if a certain threshold of the fitness is reached or the reproduction of a population is fitness-proportionate. That is to say, the indivi
16、duals with higher fitness are more likely to reproduce. 2.2.2 Choice of Parameters An important issue is the formulation or choice of an appropriate fitness function that determines the selection criterion in a particular problem. For the minimization of a function using genetic algorithms, one simple way of constructing a fitness function is to use the simplest form F = Ay with A being a large constant (though A = 0 will do) and y = f(x), thus the
