Talk:Mutation (evolutionary algorithm)
This is the talk page for discussing improvements to the Mutation (evolutionary algorithm) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | Robotics Unassessed | |||||||||
|
now that this has some meat to it, should we consider de-stubifying it. There is much more that we can do with it, but I would question whether it still exists as a stub or not. Rgarvage 16:09, Aug 21, 2004 (UTC)
I don't think this is a stub either. Unless someone has plans on expanding it in the near future, it should be removed from stubhood.
--Fastfinge 22:50, Sep 19, 2004 (UTC)
CELL
An information is not given in the article
It is not mentioned in the article where the mutation operation is used in the GA. There are N chromosomes in the last step. ( I say them old N chromosomes) There are three choises, I think.
1) N new chromosomes are generated by three operations: a) Some are directly copied from initial population b) Some are generated by crossover c) Some are generated by mutation (This is the algoritm used in MATLAB's implementation)
2) N old chromosomes enter crossover and after mating and crossover N new chromosomes are generated. There are 2 choises for this case.
2.1) N new chromosomes enter mutation. 2.2) Both N old and N new chromosomes enter mutation.
Which one above (1, 2.1 and 2.2) is true? OR Are all of them true? Kavas (talk) 08:17, 17 September 2009 (UTC)