A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions

  • Authors:
  • R. Chelouah;P. Siarry

  • Affiliations:
  • Laboratoire de Modélisation et Optimisation des Systèmes en Electronique IUT, rue d'Eragny, Neuville sur Oise, 95031 Cergy-Pontoise, France. chelouah@u-cergy.fr;Université de Paris 12, Faculté des Sciences (L.E.R.I.S.S.), 61 Avenue du Général de Gaulle, 94010 Créteil, France. siarry@univ-paris12.fr

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic algorithms are stochastic search approaches basedon randomized operators, such as selection, crossover and mutation,inspired by the natural reproduction and evolution of the livingcreatures. However, few published works deal with their applicationto the global optimization of functions depending on continuousvariables.A new algorithm called Continuous Genetic Algorithm (CGA) is proposedfor the global optimization of multiminima functions. In order tocover a wide domain of possible solutions, our algorithm first takescare over the choice of the initial population. Then it locates themost promising area of the solution space, and continues the searchthrough an “intensification” inside this area. The selection, thecrossover and the mutation are performed by using the decimal code.The efficiency of CGA is tested in detail through a set of benchmarkmultimodal functions, of which global and local minima are known. CGAis compared to Tabu Search and Simulated Annealing, as alternativealgorithms.