Abstract.
In this paper a new Genetic Algorithm (GA) to optimize multimodal continuous functions is proposed. It is based on a splitting of the traditional GA into a sequence of three processes. The first process creates several appropriate sub-populations using the information entropy theory. The second process applies the genetic operators (selection, crossover and mutation) on every subpopulation that is so gradually enriched with better individuals. We then determine the best point s* among the best solutions issued from each of the preceding subpopulations. In the neighbourhood of this point s* is generated a population used to initialize a traditional GA in the third process. Inthis last process, the population is entirely renewed after each generation, the new population being generated in the neighborhood of the best point found. The neighborhood size is decreased after each generation. A detailedcomparison of performances with several stochastic global search methods is presented, using test functions of which local and global minima are known.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received October 2, 2000
Rights and permissions
About this article
Cite this article
Bessaou, M., Siarry, P. A genetic algorithm with real-value coding to optimize multimodal continuous functions. Struct Multidisc Optim 23, 63–74 (2001). https://doi.org/10.1007/s00158-001-0166-y
Issue Date:
DOI: https://doi.org/10.1007/s00158-001-0166-y