Simplex coding genetic algorithm for the global optimization of nonlinear functions
From MaRDI portal
Recommendations
- Minimizing multimodal functions by simplex coding genetic algorithm
- A new genetic algorithm for solving nonconvex nonlinear programming problems
- scientific article; zbMATH DE number 98512
- scientific article; zbMATH DE number 5671191
- An improved genetic algorithm to optimize the nonlinear programming problems
- scientific article; zbMATH DE number 2058284
- A greedy genetic algorithm for unconstrained global optimization
- Genetic algorithm for constrained global optimization in continuous variables
- Genetic global optimization algorithms
Cited in
(6)- Parallel two-phase methods for global optimization on GPU
- A gray-encoded, hybrid-accelerated, genetic algorithm for global optimizations in dynamical systems
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
- Minimizing multimodal functions by simplex coding genetic algorithm
- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming
- A pragmetic intellect algorithm for optimizing complex nonlinear function
This page was built for publication: Simplex coding genetic algorithm for the global optimization of nonlinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667005)