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 条
  • [41] Self-adaptive mechanism based genetic algorithms for combinatorial optimization problems
    Zhijian Q.
    Shasha W.
    Hongbo X.
    Panjing L.
    Caihong L.
    Journal of China Universities of Posts and Telecommunications, 2019, 26 (05): : 11 - 21
  • [42] Novel Self-adaptive Harmony Search Algorithm for Continuous Optimization Problems
    Chen Jing
    Man Hong-Fang
    Wang Ya-Min
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 5452 - 5456
  • [43] Solving Constrained Optimization Problems with a Self-Adaptive Differential Evolution Algorithm
    Worasucheep, Chukiat
    ECTI-CON: 2009 6TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY, VOLS 1 AND 2, 2009, : 646 - 649
  • [44] Dimensionality Reduction in Complex Medical Data: Improved Self-Adaptive Niche Genetic Algorithm
    Zhu, Min
    Xia, Jing
    Yan, Molei
    Cai, Guolong
    Yan, Jing
    Ning, Gangmin
    COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2015, 2015
  • [45] Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems
    Han, Ming-Feng
    Liao, Shih-Hui
    Chang, Jyh-Yeong
    Lin, Chin-Teng
    APPLIED INTELLIGENCE, 2013, 39 (01) : 41 - 56
  • [46] Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems
    Ming-Feng Han
    Shih-Hui Liao
    Jyh-Yeong Chang
    Chin-Teng Lin
    Applied Intelligence, 2013, 39 : 41 - 56
  • [47] Improved sequential niche genetic algorithm for multimodal optimization
    Yu, X.J.
    Wang, Z.J.
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2001, 41 (03): : 17 - 20
  • [48] Self-Adaptive Forensic-Based Investigation Algorithm with Dynamic Population for Solving Constraint Optimization Problems
    Cai, Pengxing
    Zhang, Yu
    Jin, Ting
    Todo, Yuki
    Gao, Shangce
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2024, 17 (01)
  • [49] Self-Adaptive Forensic-Based Investigation Algorithm with Dynamic Population for Solving Constraint Optimization Problems
    Pengxing Cai
    Yu Zhang
    Ting Jin
    Yuki Todo
    Shangce Gao
    International Journal of Computational Intelligence Systems, 17
  • [50] The Bat Algorithm with Dynamic Niche Radius for Multimodal Optimization
    Iwase, Takuya
    Takano, Ryo
    Uwano, Fumito
    Sato, Hiroyuki
    Takadama, Keiki
    2019 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE (ISMSI 2019), 2019, : 8 - 13