Fitness varying gravitational constant in GSA

被引:15
作者
Bansal, Jagdish Chand [1 ]
Joshi, Susheel Kumar [1 ]
Nagar, Atulya K. [2 ,3 ]
机构
[1] South Asian Univ, New Delhi, India
[2] Liverpool Hope Univ, Math Sci, Liverpool, Merseyside, England
[3] Liverpool Hope Univ, Fac Sci, Liverpool, Merseyside, England
关键词
Gravitational search algorithm (GSA); Swarm intelligence; Gravitational constant; Exploration; Exploitation;
D O I
10.1007/s10489-018-1148-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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
页数:16
相关论文
共 19 条
[1]  
Amoozegar M, 2014, 2014 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), P431, DOI 10.1109/ICCKE.2014.6993390
[2]  
[Anonymous], 1993, FUNDAMENTALS PHYS
[3]  
[Anonymous], 2010, ENG OPTIMIZATION, DOI DOI 10.1002/9780470640425
[4]   A novel disruption in biogeography-based optimization with application to optimal power flow problem [J].
Bansal, Jagdish Chand ;
Farswan, Pushpa .
APPLIED INTELLIGENCE, 2017, 46 (03) :590-615
[5]  
Chen HQ, 2011, INT J COMPUT SCI NET, V11, P208
[6]   Black Hole: A New Operator for Gravitational Search Algorithm [J].
Doraghinejad, Mohammad ;
Nezamabadi-pour, Hossein .
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2014, 7 (05) :809-826
[7]  
Eiben A. E., 1998, Fundamenta Informaticae, V35, P35
[8]  
Joshi S, 2016, 2016 INTERNATIONAL WORKSHOP ON COMPUTATIONAL INTELLIGENCE (IWCI), P224, DOI 10.1109/IWCI.2016.7860371
[9]   A modified gravitational search algorithm for slope stability analysis [J].
Khajehzadeh, Mohammad ;
Taha, Mohd Raihan ;
El-Shafie, Ahmed ;
Eslami, Mahdiyeh .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (08) :1589-1597
[10]   ON A TEST OF WHETHER ONE OF 2 RANDOM VARIABLES IS STOCHASTICALLY LARGER THAN THE OTHER [J].
MANN, HB ;
WHITNEY, DR .
ANNALS OF MATHEMATICAL STATISTICS, 1947, 18 (01) :50-60