论文信息 - A gradient-guided niching method in genetic algorithm for solving continuous optimisation problems

A gradient-guided niching method in genetic algorithm for solving continuous optimisation problems

A hybrid genetic algorithm, which embeds a gradient-based local search route into a niching genetic algorithm, is proposed for solving continuous optimisation problems. The optimisation algorithm is applied to three nonlinear functions each having up to 100 variables and multi-minima. The test results show that relative to a standard niching algorithm the combination of a gradient-based search and niching improves the searching precision by several orders and the capability for locating the global optimum is significantly improved.

Kang Li | S. Thompson | J. Peng

[1] P. Siarry,et al. An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization , 2000 .

[2] R. K. Aggarwal,et al. Fast and accurate power dispatch using a relaxed genetic algorithm and a local gradient technique , 2000 .

[3] Angelo M. Sabatini,et al. A hybrid genetic algorithm for estimating the optimal time scale of linear systems approximations using Laguerre models , 2000, IEEE Trans. Autom. Control..

[4] Bruno Sareni,et al. Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[5] Aleksandra B. Djurišić,et al. Elite genetic algorithms with adaptive mutations for solving continuous optimization problems: application to modeling of the optical constants of solids , 1998 .

[6] Thomas Bäck,et al. Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[7] Michael J. Shaw,et al. Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[8] David E. Goldberg,et al. Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.