A combined nelder-mead simplex and genetic algorithm

Abstract : It is usually said that genetic algorithm should be used when nothing else works. In practice, genetic algorithm are very often used for large sized global optimization problems, but are not very efficient for local optimization problems. The Nelder-Mead simplex algorithm has some common characteristics with genetic algorithm, but it can only find a local optimum close to the starting point. In this article, a combined Nelder-Mead Simplex and Genetic algorithm is introduced and tested on classical test functions on which both genetic algorithm or local optimization techniques are not efficient when separately used.
Type de document :
Communication dans un congrès
GECCO 1999, Genetic and Evolutionary Computation Conference, Jul 1999, Orlando, United States. pp xxxx, 1999


https://hal-enac.archives-ouvertes.fr/hal-00937736
Contributeur : Laurence Porte <>
Soumis le : vendredi 25 avril 2014 - 15:05:09
Dernière modification le : lundi 21 mars 2016 - 11:30:49
Document(s) archivé(s) le : vendredi 25 juillet 2014 - 10:41:36

Fichier

568.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00937736, version 1

Collections

Citation

Nicolas Durand, Jean-Marc Alliot. A combined nelder-mead simplex and genetic algorithm. GECCO 1999, Genetic and Evolutionary Computation Conference, Jul 1999, Orlando, United States. pp xxxx, 1999. <hal-00937736>

Exporter

Partager

Métriques

Consultations de
la notice

572

Téléchargements du document

53