Application of self-adaptive dynamic niche genetic algorithm in global multimodal optimization problems

被引:0
|
作者
机构
[1] Feng, Zhanshen
[2] Yu, Yan
来源
| 1600年 / Natsional'nyi Hirnychyi Universytet卷
关键词
Computation theory - Global optimization;
D O I
暂无
中图分类号
学科分类号
摘要
Purpose: Genetic algorithm is a kind of random search method evolved from the genetic mechanism, it has strong robustness and optimization ability. However, a large number of researches indicated that the traditional genetic algorithms have many deficiencies and limitations in global multimodal optimization, such as they are prone to premature convergence, high computational cost and weak local search abilities. The purpose is to overcome these disadvantages through the creation of a new algorithm for solving global multimodal optimization problems, which is self-adaptive dynamic niche genetic algorithm (SDNGA). Methodology: By studying the GA optimization and niche theory, we combine multi-groups and niche method to traditional genetic algorithm, which is used in the solution of global multimodal optimization problems. The proposed algorithm is applied to test functions to demonstrate its effectiveness and applicability. Findings: We adopted the niche technology to divide each generation of a group into several subgroups. Then we choosed the best individual from each subgroup as the representative of such a subgroup, and then carried out the hybridization and mutation to produce a new generation within the population and between populations, thus enhancing the global optimization ability of the algorithm, and improving the convergence speed. Originality: We made a study of genetic algorithm and niche theory to apply in the global multimodal optimization problem. We discussed the ideas and the steps of proposed algorithm, made the qualitative analysis on the searching ability and the convergence speed. The research on this aspect lias not been found at present. Practical value: We proposed a self-adaptive dynamic niche genetic algorithm, which can be used in global multimodal optimization problems. The test experimental results have shown that SDNGA has good searching ability, good performance and very strong robustness, which allows for solutions of higher quality. © Zhanshen Feng, Yan Yu, 2016.
引用
收藏
相关论文
共 50 条
  • [1] A self-adaptive niching genetic algorithm for multimodal optimization of electromagnetic devices
    Dilettoso, E
    Salerno, N
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2006, 42 (04) : 1203 - 1206
  • [2] An adaptive niche genetic algorithm for multimodal function optimization
    Lu, Qing
    Liang, Chang-Yong
    Yang, Shan-Lin
    Zhang, Jun-Ling
    [J]. Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2009, 22 (01): : 91 - 100
  • [3] A dynamic niche genetic algorithm for multimodal function optimization
    School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China
    [J]. Tongji Daxue Xuebao, 2006, 5 (684-688):
  • [4] A dynamic self-adaptive harmony search algorithm for continuous optimization problems
    Kattan, Ali
    Abdullah, Rosni
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (16) : 8542 - 8567
  • [5] A self-adaptive genetic algorithm for function optimization
    Galaviz, J
    Kuri, A
    [J]. PROCEEDINGS ISAI/IFIS 1996 - MEXICO - USA COLLABORATION IN INTELLIGENT SYSTEMS TECHNOLOGIES, 1996, : 156 - 161
  • [6] An Improved Self-Adaptive PSO Algorithm with Detection Function for Multimodal Function Optimization Problems
    Zhang, YingChao
    Xiong, Xiong
    Zhang, QiDong
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [7] Solving Dynamic Combinatorial Optimization Problems Using a Probabilistic Distribution as Self-adaptive Mechanism in a Genetic Algorithm
    Montiel Moctezuma, Cesar J.
    Mora, Jaime
    Gonzalez-Mendoza, Miguel
    [J]. ADVANCES IN SOFT COMPUTING, MICAI 2019, 2019, 11835 : 330 - 349
  • [8] Self-adaptive differential artificial bee colony algorithm for global optimization problems
    Chen, Xu
    Tianfield, Huaglory
    Li, Kangji
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2019, 45 : 70 - 91
  • [9] A self-adaptive global best harmony search algorithm for continuous optimization problems
    Pan, Quan-Ke
    Suganthan, P. N.
    Tasgetiren, M. Fatih
    Liang, J. J.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2010, 216 (03) : 830 - 848
  • [10] A Self-adaptive Bald Eagle Search optimization algorithm with dynamic opposition-based learning for global optimization problems
    Sharma, Suvita Rani
    Kaur, Manpreet
    Singh, Birmohan
    [J]. EXPERT SYSTEMS, 2023, 40 (02)