For genetic algorithms, there are many strategies to choose individuals: general, and elitist. The general approach is the simplest approach, in which the algorithm replaces the whole current population by the offspring generated so far. In the elitist strategy, parents and offspring compete for survival. With the elitist approach, only the best individuals are selected from the current generation. In this article, we compare the results of the non-elitist genetic algorithm, and the elitist genetic algorithm improved with the parenting fitness. Results show that the elitist genetic algorithm improved with parenting fitness outperforms the non-elitist one in 93% cases.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Comparison Between the (μ+ λ) and (μ, λ) Genetic Algorithm

  • Mustapha Ouiss,
  • Abdelaziz Ettaoufik,
  • Abdelaziz Marzak

摘要

For genetic algorithms, there are many strategies to choose individuals: general, and elitist. The general approach is the simplest approach, in which the algorithm replaces the whole current population by the offspring generated so far. In the elitist strategy, parents and offspring compete for survival. With the elitist approach, only the best individuals are selected from the current generation. In this article, we compare the results of the non-elitist genetic algorithm, and the elitist genetic algorithm improved with the parenting fitness. Results show that the elitist genetic algorithm improved with parenting fitness outperforms the non-elitist one in 93% cases.