Skip to Main content Skip to Navigation
Conference papers

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
Complete list of metadata
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Friday, April 25, 2014 - 3:05:09 PM
Last modification on : Tuesday, October 19, 2021 - 11:02:49 AM
Long-term archiving on: : Friday, July 25, 2014 - 10:41:36 AM


Files produced by the author(s)


  • HAL Id : hal-00937736, version 1



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. ⟨hal-00937736⟩



Les métriques sont temporairement indisponibles