Minimizing multimodal functions by simplex coding genetic algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2159091
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- A niche hybrid genetic algorithm for global optimization of continuous multimodal functions
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- A continuous genetic algorithm designed for the global optimization of multimodal functions
Cited in
(14)- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points
- Global sensing search for nonlinear global optimization
- A practical fractional numerical optimization method for designing economically and environmentally friendly super-tall buildings
- Global optimization by continuous grasp
- A novel three-phase trajectory informed search methodology for global optimization
- Tabu search directed by direct search methods for nonlinear global optimization
- Hybrid chaos optimization algorithm with artificial emotion
- scientific article; zbMATH DE number 1984139 (Why is no real title available?)
- Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions
- scientific article; zbMATH DE number 2159091 (Why is no real title available?)
- A stochastic local search algorithm for constrained continuous global optimization
- Low dimensional simplex evolution: a new heuristic for global optimization
- Speeding up continuous GRASP
- An analysis of the equilibrium of migration models for biogeography-based optimization
This page was built for publication: Minimizing multimodal functions by simplex coding genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457885)
