Fitness varying gravitational constant in GSA

被引:0
作者
Jagdish Chand Bansal
Susheel Kumar Joshi
Atulya K. Nagar
机构
[1] South Asian University,
[2] Liverpool Hope University,undefined
来源
Applied Intelligence | 2018年 / 48卷
关键词
Gravitational search algorithm (GSA); Swarm intelligence; Gravitational constant; Exploration; Exploitation;
D O I
暂无
中图分类号
学科分类号
摘要
Gravitational Search Algorithm (GSA) is a recent metaheuristic algorithm inspired by Newton’s law of gravity and law of motion. In this search process, position change is based on the calculation of step size which depends upon a constant namely, Gravitational Constant (G). G is an exponentially decreasing function throughout the search process. Further, in-spite of having different masses, the value of G remains same for each agent, which may cause inappropriate step size of agents for the next move, and thus leads the swarm toward stagnation or sometimes skipping the true optima. To overcome stagnation, we first propose a gravitational constant having different scaling characteristics for different phase of the search process. Secondly, a dynamic behavior is introduced in this proposed gravitational constant which varies according to the fitness of the agents. Due to this behavior, the gravitational constant will be different for every agent based on its fitness and thus will help in controlling the acceleration and step sizes of the agents which further improve exploration and exploitation of the solution search space. The proposed strategy is tested over 23 well-known classical benchmark functions and 11 shifted and biased benchmark functions. Various statistical analyzes and a comparative study with original GSA, Chaos-based GSA (CGSA), Bio-geography Based Optimization (BBO) and DBBO has been carried out.
引用
收藏
页码:3446 / 3461
页数:15
相关论文
共 30 条
  • [1] Bansal JC(2017)A novel disruption in biogeography-based optimization with application to optimal power flow problem Appl Intell 46 590-615
  • [2] Farswan P(2011)Hybrid gravitational search algorithm with random-key encoding scheme combined with simulated annealing IJCSNS 11 208-826
  • [3] Chen H(2014)Black hole: a new operator for gravitational search algorithm International Journal of Computational Intelligence Systems 7 809-50
  • [4] Li S(1998)On evolutionary exploration and exploitation Fundamenta Informaticae 35 35-1597
  • [5] Tang Z(2012)A modified gravitational search algorithm for slope stability analysis Eng Appl Artif Intell 25 1589-60
  • [6] Doraghinejad M(1947)On a test of whether one of two random variables is stochastically larger than the other Ann Math Stat 18 50-1584
  • [7] Nezamabadi-pour H(2014)Adaptive gbest-guided gravitational search algorithm Neural Comput & Applic 25 1569-2248
  • [8] Eiben AE(2009)Gsa: a gravitational search algorithm Inf Sci 179 2232-548
  • [9] Schippers CA(2011)Disruption: a new operator in gravitational search algorithm Scientia Iranica 18 539-316
  • [10] Khajehzadeh M(2012)Fitness based differential evolution Memetic Computing 4 303-33