Chinaunix首页 | 论坛 | 博客
  • 博客访问: 1352121
  • 博文数量: 188
  • 博客积分: 4847
  • 博客等级: 上校
  • 技术积分: 2124
  • 用 户 组: 普通用户
  • 注册时间: 2006-03-06 13:49
个人简介

Who am I?

文章分类

全部博文(188)

分类: Python/Ruby

2012-06-13 09:39:34

Outline of the Algorithm
The following outline summarizes how the genetic algorithm works:
   1.The algorithm begins by creating a random initial population.
   2.The algorithm then creates a sequence of new populations. At each step, the algorithm uses the individuals in the current generation to create the next population. To create the new population, the algorithm performs the following steps:
                 1.Scores each member of the current population by computing its fitness value.
         2.Scales the raw fitness scores to convert them into a more usable range of values.
         3.Selects members, called parents, based on their fitness.
         4.Some of the individuals in the current population that have lower fitness are chosen as elite. These elite individuals are passed to the next population.
         5.Produces children from the parents. Children are produced either by making random changes to a single parent—mutation—or by combining the vector entries of a pair of parents—crossover.
         6.Replaces the current population with the children to form the next generation.
   3.The algorithm stops when one of the stopping criteria is met. See Stopping Conditions for the Algorithm.
Back to Top of Page Back to Top
Initial Population
阅读(1140) | 评论(0) | 转发(0) |
给主人留下些什么吧!~~