A Species-based Particle Swarm Optimization with Adaptive Population Size and Deactivation of Species for Dynamic Optimization Problems

被引:1
|
作者
Yazdani D. [1 ]
Yazdani D. [1 ]
Yazdani D. [1 ]
Omidvar M.N. [4 ]
Gandomi A.H. [2 ,5 ]
Yao X. [6 ,7 ]
机构
[1] Department of Computer Engineering, Mashhad Branch, Azad University, Mashhad
[2] Faculty of Engineering & Information Technology, University of Technology Sydney, Ultimo
[3] AI Lab, British Antarctic Survey, Cambridge
[4] School of Computing, Leeds University Business School, University of Leeds, Leeds
[5] University Research and Innovation Center (EKIK), Obuda University, Budapest
[6] Research Institute of Trustworthy Autonomous Systems (RITAS), Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen
[7] The Center of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Birmingham, Birmingham
关键词
Computational resource allocation; Evolutionary dynamic optimization; Particle swarm optimization; Single-objective dynamic optimization problems; Tracking moving global optimum;
D O I
10.1145/3604812
中图分类号
学科分类号
摘要
Population clustering methods, which consider the position and fitness of individuals to form sub-populations in multi-population algorithms, have shown high efficiency in tracking the moving global optimum in dynamic optimization problems. However, most of these methods use a fixed population size, making them inflexible and inefficient when the number of promising regions is unknown. The lack of a functional relationship between the population size and the number of promising regions significantly degrades performance and limits an algorithm’s agility to respond to dynamic changes. To address this issue, we propose a new species-based particle swarm optimization with adaptive population size and number of sub-populations for solving dynamic optimization problems. The proposed algorithm also benefits from a novel systematic adaptive deactivation component that, unlike the previous deactivation components, adapts the computational resource allocation to the sub-populations by considering various characteristics of both the problem and the sub-populations. We evaluate the performance of our proposed algorithm for the Generalized Moving Peaks Benchmark and compare the results with several peer approaches. The results indicate the superiority of the proposed method. © 2023 Copyright held by the owner/author(s).
引用
收藏
相关论文
共 50 条
  • [21] A novel hybrid adaptive collaborative approach based on particle swarm optimization and local search for dynamic optimization problems
    Sharifi, Ali
    Kordestani, Javidan Kazemi
    Mandaviani, Mahshid
    Meybodi, Mohammad Reza
    APPLIED SOFT COMPUTING, 2015, 32 : 432 - 448
  • [22] Multi-objective particle swarm optimization with dynamic population size
    Shu, Xiaoli
    Liu, Yanmin
    Liu, Jun
    Yang, Meilan
    Zhang, Qian
    JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING, 2023, 10 (01) : 446 - 467
  • [23] The Study on Dynamic Population Size Improvements for Classical Particle Swarm Optimization
    Lei, Chen
    2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 430 - 433
  • [24] Adaptive particle swarm optimization algorithm based on population velocity
    Zhang, Ding-Xue
    Liao, Rui-Quan
    Kongzhi yu Juece/Control and Decision, 2009, 24 (08): : 1257 - 1260
  • [25] Adaptive Particle Swarm Optimization Based on Population Entropy for MDVRPTW
    Wang Tie-jun
    Wu Kai-jun
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 753 - 756
  • [26] Particle swarm optimization with variable population size
    Lanzarini, Laura
    Leza, Victoria
    De Giusti, Armando
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2008, PROCEEDINGS, 2008, 5097 : 438 - 449
  • [27] Adaptive Particle Swarm Optimization with Dynamic Population and Its Application to Constrained Engineering Design Optimization
    Liu, Yi
    Mu, Caihong
    Kou, Weidong
    Liu, Jing
    MATERIALS PROCESSING TECHNOLOGY II, PTS 1-4, 2012, 538-541 : 3074 - +
  • [28] Cultural based adaptive mutation Particle Swarm Optimization algorithm for numerical optimization problems
    Liu, Sheng
    Wang, Xing-Yu
    You, Xiao-Ming
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2007, 37 (SUPPL.): : 100 - 104
  • [29] Modification Of Species-Based Differential Evolution For Multimodal Optimization
    Al Idrus, Said Iskandar
    Syahputra, Hermawan
    Firdaus, Muliawan
    INNOVATION AND ANALYTICS CONFERENCE AND EXHIBITION (IACE 2015), 2015, 1691
  • [30] A dynamic adaptive particle swarm optimization and genetic algorithm for different constrained engineering design optimization problems
    Zhu, Hao
    Hu, Yumei
    Zhu, Weidong
    ADVANCES IN MECHANICAL ENGINEERING, 2019, 11 (03)