Preventing premature convergence and proving the optimality in evolutionary algorithms - Archive ouverte HAL
Communication Dans Un Congrès Année : 2013

Preventing premature convergence and proving the optimality in evolutionary algorithms

Résumé

Evolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality.
Fichier principal
Vignette du fichier
ea2013.pdf (187.19 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00880716 , version 1 (07-11-2013)

Identifiants

  • HAL Id : hal-00880716 , version 1

Citer

Charlie Vanaret, Jean-Baptiste Gotteland, Nicolas Durand, Jean-Marc Alliot. Preventing premature convergence and proving the optimality in evolutionary algorithms. EA 2013, 11th International Conference on Artificial Evolution, Oct 2013, Bordeaux, France. pp 84-94 ; ISBN : 9782953926736. ⟨hal-00880716⟩
287 Consultations
740 Téléchargements

Partager

More