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.
Document type :
Conference papers
GECCO 1999, Genetic and Evolutionary Computation Conference, Jul 1999, Orlando, United States. pp xxxx, 1999


https://hal-enac.archives-ouvertes.fr/hal-00937736
Contributor : Laurence Porte <>
Submitted on : Friday, April 25, 2014 - 3:05:09 PM
Last modification on : Friday, April 25, 2014 - 3:06:31 PM

File

568.pdf
fileSource_public_author

Identifiers

  • 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>

Export

Share

Metrics

Consultation de
la notice

516

Téléchargement du document

28