Identification of strategy parameters for particle swarm optimizer through Taguchi method

被引:0
|
作者
KHOSLA Arun
KUMAR Shakti
AGGARWAL K.K.
机构
[1] Vice Chancellor GGS Indraprastha University Delhi 110006 India
[2] Department of Electronics and Communication Engineering National Institute of Technology Jalandhar 144011 India
[3] Centre for Advanced Technology Haryana Engineering College Jagadhari 135003 India
关键词
Strategy parameters; Particle swarm optimization (PSO); Taguchi method; ANOVA;
D O I
暂无
中图分类号
TN201 [基础理论];
学科分类号
0702 ; 070207 ;
摘要
Particle swarm optimization (PSO), like other evolutionary algorithms is a population-based stochastic algorithm inspired from the metaphor of social interaction in birds, insects, wasps, etc. It has been used for finding promising solutions in complex search space through the interaction of particles in a swarm. It is a well recognized fact that the performance of evolu- tionary algorithms to a great extent depends on the choice of appropriate strategy/operating parameters like population size, crossover rate, mutation rate, crossover operator, etc. Generally, these parameters are selected through hit and trial process, which is very unsystematic and requires rigorous experimentation. This paper proposes a systematic based on Taguchi method reasoning scheme for rapidly identifying the strategy parameters for the PSO algorithm. The Taguchi method is a robust design approach using fractional factorial design to study a large number of parameters with small number of experiments. Computer simulations have been performed on two benchmark functions—Rosenbrock function and Griewank function—to validate the approach.
引用
收藏
页码:1989 / 1994
页数:6
相关论文
共 50 条
  • [31] Modal parameters identification with particle swarm optimization
    Galewski, M.A., 1600, Trans Tech Publications Ltd (597):
  • [32] A Quantum Particle Swarm Optimizer With Enhanced Strategy for Global Optimization of Electromagnetic Devices
    Rehman, Obaid Ur
    Yang, Shiyou
    Khan, Shafiullah
    Rehman, Sadaqat Ur
    IEEE TRANSACTIONS ON MAGNETICS, 2019, 55 (08)
  • [33] Orthogonal permutation particle swarm optimizer with switching learning strategy for global optimization
    Chu, Xianghua
    Lu, Qiang
    Niu, Ben
    WSEAS Transactions on Systems, 2013, 12 (11): : 507 - 516
  • [34] Fully connected particle swarm optimizer
    Sun, Y.
    Djouani, K.
    Qi, G.
    van Wyk, B. J.
    Wang, Z.
    ENGINEERING OPTIMIZATION, 2011, 43 (07) : 801 - 812
  • [35] A new dynamic particle swarm optimizer
    Zheng, Binbin
    Li, Yuanxiang
    Shen, Xianjun
    Zheng, Bojin
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 481 - 488
  • [36] Particle Swarm Optimizer with Full Information
    Liu, Yanmin
    Li, Chengqi
    Wu, Xiangbiao
    Zeng, Qingyu
    Liu, Rui
    Huang, Tao
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 644 - 650
  • [37] Adaptive cooperative particle swarm optimizer
    Mohammad Hasanzadeh
    Mohammad Reza Meybodi
    Mohammad Mehdi Ebadzadeh
    Applied Intelligence, 2013, 39 : 397 - 420
  • [38] An improved cooperative particle swarm optimizer
    Wang, Liying
    TELECOMMUNICATION SYSTEMS, 2013, 53 (01) : 147 - 154
  • [39] Particle Swarm Optimizer with Time-Varying Parameters based on a Novel Operator
    Cheng, R.
    Yao, M.
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2011, 5 (02): : 33 - 38
  • [40] Dynamic multi-swarm particle swarm optimizer
    Liang, JJ
    Suganthan, PN
    2005 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2005, : 124 - 129