Random state genetic algorithm

  • Authors:
  • Louis Gacôgne

  • Affiliations:
  • LIP6 - Université Paris VI, Paris 5, France and ENSIIE, Evry, France

  • Venue:
  • SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Following earlier results, the purpose of this paper is to show a new evolutionary algorithm whose parameters are moving in ranges defined by experiments. That is to say, no parameters must be fixed at the beginning of the course of generations. Comparing the performance of two methods, we arrive to the conclusion that the random often is a better way.