A simplex genetic algorithm hybrid
John Yen, Bogju Lee · IEEE International Conference on Evolutionary Computation (ICEC) · 2002
One of the main obstacles in applying genetic algorithms (GAs) to complex problems has been the high computational cost due to their slow convergence rate. To alleviate this difficulty, we developed a hybrid approach that combines a GA with a stochastic variant of the simplex method in function optimization. Our motivation for developing the stochastic simplex method is to introduce a cost-effective exploration component into the conventional simplex method. In an attempt to make effective use of the simplex operation in a hybrid GA framework, we used an elite-based hybrid architecture that applies one simplex step to a top portion of the ranked population. We compared our approach with five alternative optimization techniques, including another simplex-GA hybrid, developed independently by Renders and Bersini (1994), and adaptive simulated annealing (ASA). We used two function optimization problems to compare our approach with the five alternative methods. Overall, these tests showed that our hybrid approach is an effective and robust optimization technique. We also tested our hybrid GA on the seven function benchmark problems on real space and showed its results.
Cited by 35 works. doi:10.1109/icec.1997.592291
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- A Simplex Method for Function Minimization
- Genetic Algorithms + Data Structures = Evolution Programs
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Simulated annealing: Practice versus theory
- An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms.
- System identification and control using genetic algorithms
- Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways
- Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems
- System Identification with Evolving Polynomial Networks.