A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems

被引:27
|
作者
Wang, Hongfeng [1 ,2 ]
Yang, Shengxiang [3 ,4 ]
Ip, W. H. [5 ]
Wang, Dingwei [1 ,2 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110004, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110004, Peoples R China
[3] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England
[4] Nanjing Univ Informat Sci & Technol, Coll Math & Phys, Nanjing 210044, Jiangsu, Peoples R China
[5] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Kowloon, Hong Kong, Peoples R China
基金
英国工程与自然科学研究理事会;
关键词
memetic computing; memetic algorithm; particle swarm optimisation; dynamic multi-modal optimisation problem; speciation; local search; DIFFERENTIAL EVOLUTION; GENETIC ALGORITHM; MULTIPLE OPTIMA; STRATEGY; MINIMA; MODEL;
D O I
10.1080/00207721.2011.605966
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many real-world optimisation problems are both dynamic and multi-modal, which require an optimisation algorithm not only to find as many optima under a specific environment as possible, but also to track their moving trajectory over dynamic environments. To address this requirement, this article investigates a memetic computing approach based on particle swarm optimisation for dynamic multi-modal optimisation problems (DMMOPs). Within the framework of the proposed algorithm, a new speciation method is employed to locate and track multiple peaks and an adaptive local search method is also hybridised to accelerate the exploitation of species generated by the speciation method. In addition, a memory-based re-initialisation scheme is introduced into the proposed algorithm in order to further enhance its performance in dynamic multi-modal environments. Based on the moving peaks benchmark problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with several state-of-the-art algorithms taken from the literature. The experimental results show the efficiency of the proposed algorithm for DMMOPs.
引用
收藏
页码:1268 / 1283
页数:16
相关论文
共 50 条
  • [31] Application of Improved Particle Swarm Optimisation Algorithm in Hull form Optimisation
    Zheng, Qiang
    Feng, Bai-Wei
    Liu, Zu-Yuan
    Chang, Hai-Chao
    JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2021, 9 (09)
  • [32] A particle swarm optimization based memetic algorithm for dynamic optimization problems
    Wang, Hongfeng
    Yang, Shengxiang
    Ip, W. H.
    Wang, Dingwei
    NATURAL COMPUTING, 2010, 9 (03) : 703 - 725
  • [33] An improved salp swarm algorithm for complex multi-modal problems
    Divya Bairathi
    Dinesh Gopalani
    Soft Computing, 2021, 25 : 10441 - 10465
  • [34] An improved salp swarm algorithm for complex multi-modal problems
    Bairathi, Divya
    Gopalani, Dinesh
    SOFT COMPUTING, 2021, 25 (15) : 10441 - 10465
  • [35] A particle swarm optimization based memetic algorithm for dynamic optimization problems
    Hongfeng Wang
    Shengxiang Yang
    W. H. Ip
    Dingwei Wang
    Natural Computing, 2010, 9 : 703 - 725
  • [36] The Influence of Topologies on the Dynamic Vector Evaluated Particle Swarm Optimisation Algorithm
    Helbig, Marde
    2016 3RD INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI 2016), 2016, : 23 - 27
  • [37] Restarting Particle Swarm Optimisation for Deceptive Problems
    Hendtlass, Tim
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [38] A novel particle swarm algorithm for multi-objective optimisation problem
    Zhang, Jiande
    Huang, Chenrong
    Xu, Jinbao
    Lu, Jingui
    INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL, 2013, 18 (04) : 380 - 386
  • [39] Fitness estimation and the particle swarm optimisation algorithm
    Hendtlass, Tim
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 4266 - 4272
  • [40] Particle swarm optimisation algorithm with forgetting character
    Yuan, Dai-lin
    Chen, Qiu
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2010, 2 (01) : 59 - 64