Open Access
Translator Disclaimer
2013 An Improved Hybrid Genetic Algorithm with a New Local Search Procedure
Wen Wan, Jeffrey B. Birch
J. Appl. Math. 2013(SI26): 1-10 (2013). DOI: 10.1155/2013/103591


One important challenge of a hybrid genetic algorithm (HGA) (also called memetic algorithm) is the tradeoff between global and local searching (LS) as it is the case that the cost of an LS can be rather high. This paper proposes a novel, simplified, and efficient HGA with a new individual learning procedure that performs a LS only when the best offspring (solution) in the offspring population is also the best in the current parent population. Additionally, a new LS method is developed based on a three-directional search (TD), which is derivative-free and self-adaptive. The new HGA with two different LS methods (the TD and Neld-Mead simplex) is compared with a traditional HGA. Four benchmark functions are employed to illustrate the improvement of the proposed method with the new learning procedure. The results show that the new HGA greatly reduces the number of function evaluations and converges much faster to the global optimum than a traditional HGA. The TD local search method is a good choice in helping to locate a global “mountain” (or “valley”) but may not perform the Nelder-Mead method in the final fine tuning toward the optimal solution.


Download Citation

Wen Wan. Jeffrey B. Birch. "An Improved Hybrid Genetic Algorithm with a New Local Search Procedure." J. Appl. Math. 2013 (SI26) 1 - 10, 2013.


Published: 2013
First available in Project Euclid: 7 May 2014

MathSciNet: MR3115278
Digital Object Identifier: 10.1155/2013/103591

Rights: Copyright © 2013 Hindawi


Vol.2013 • No. SI26 • 2013
Back to Top