A Hybrid Simplex Search for Global Optimization with Representation Formula and Genetic Algorithm
Classical Genetic Algorithm (GA). We obtain a new algorithm called (RFGA),
Genetic Algorithm using Nelder Mead algorithm at the mutation stage (GANM). We obtain a new algorithm called (RFGANM),
Nelder Mead Algorithm. We obtain a new algorithm called (RFNM).
All these six algorithms (RF, GA, RFGA, GANM, RFGANM, RFNM) were tested on 21 benchmark functions with a complete analysis of the effect of different parameters of the methods. The experiments show that the RFNM is the most successful algorithm. Its performance was compared with the other algorithms, and observed to be the more effective, robust, and stable than the others.
KeywordsGlobal optimization Genetic algorithm Representation formula Nelder Mead algorithm
- 3.Souza de Cursi, J.: Representation of solutions in variational calculus. In: Variational Formulations in Mechanics: Theory and Applications, pp. 87–106 (2007)Google Scholar
- 4.Souza de Cursi, J., El Hami, A.: Representation of solutions in continuous optimization. Int. J. Simul. Multidiscip. Design Optim. (2009)Google Scholar
- 5.Floudas, C.A., Pardalos, P.M. (eds.).: Encyclopedia of Optimization. Springer, Boston (2009)Google Scholar
- 8.Ivorra, B., Mohammadi, B., Ramos, A.M., Redont, I.: Optimizing initial guesses to improve global minimization. In: Pre-Publication of the Department of Applied Mathematics MA-UCM-UCM-No 2008-06 - Universidad Complutense de Madrid, 3 Plaza de Ciencias, 28040, Madrid, Spain. p. 17 (2008)Google Scholar