Advertisement

Neural Computing and Applications

, Volume 31, Issue 1, pp 27–42 | Cite as

Escape velocity: a new operator for gravitational search algorithm

  • U. GüvençEmail author
  • F. Katırcıoğlu
Original Article

Abstract

Gravitational search algorithm (GSA) is based on the feature of reciprocal acceleration tendency of objects with masses. The total force, which is formed as an influence of other agents, is an important variable in the calculation of agent velocity. It has been determined that the total force and, thus, the velocity of the agents that are located far away, is low due to the distance. In this case, they continue their search in bad areas, as their velocity is low, which means a decrease in their contribution to optimization result. In this paper, a new operator called “escape velocity” has been proposed which is inspired by the real nature of GSA. It has been suggested that adding the escape velocity negatively will enable the agents that remain far away or outside of group behavior to be included in the group or to be increased in velocity. Thus, the study of perfecting the herd or group approach within the search scope has been carried out. To evaluate the performance of our algorithm, we applied it to 23 standard benchmark functions and six composite test functions. Escape velocity gravitational search algorithm (EVGSA) has been compared with some well-known heuristic search algorithms such as GSA, genetic algorithm (GA), particle swarm optimization (PSO), and recently the new algorithm dragonfly algorithm (DA). Wilcoxon signed-rank tests were also utilized to execute statistical analysis of the results obtained by GSA and EVGSA. Standard and composite benchmark tables and Wilcoxon signed-rank test and visual results show that EVGSA is more powerful than other algorithms.

Keywords

Gravitational search algorithm Escape velocity Optimization algorithms 

Notes

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

References

  1. 1.
    Rashedi EJ, Nezamabadi-pour H, Sarazdi S (2009) A gravitational search algorithm. Information Science 179(13):2232–2248CrossRefzbMATHGoogle Scholar
  2. 2.
    Sarafrazi S, Nezamabadi-pour H, Sarazdi S (2011) Disruption: a new operator in gravitational search algorithm. Scientia Iranica 18(3):539–548CrossRefGoogle Scholar
  3. 3.
    Pei L, HaiBin D (2012) Path planning of unmanned aerial vehicle based on improved gravitational search algorithm. Science China Technological Science 55(10):2712–2719CrossRefGoogle Scholar
  4. 4.
    Chaoshunand L, Jianzhong Z (2011) Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm. Energy Convers Manag 52(1):374–381CrossRefGoogle Scholar
  5. 5.
    Chaoshun L (2012) Parameters identification of chaotic system by chaotic gravitational search algorithm. Chaos, Solitions & Fractals 45(4):539–547CrossRefGoogle Scholar
  6. 6.
    Khajehzadeh M (2012) A modified gravitational search algorithm for slope stability analysis. Eng Appl Artif Intell 25(8):1589–1597CrossRefGoogle Scholar
  7. 7.
    Han X, Chang X (2012) A chaotic digital secure communication based on a modified gravitational search algorithm filter. Inf Sci 208:14–27CrossRefGoogle Scholar
  8. 8.
    Jiang S, Wang Y, Ji Z (2014) Convergence analysis and performance of an improved gravitational search algorithm. Appl Soft Comput 24:363–384CrossRefGoogle Scholar
  9. 9.
    Doraghinejad M, Nezamabadi-pour H, Mahani A (2014) Channel assignment in multi-radio wireless mesh networks using an improved gravitational search algorithm. J Netw Comput Appl 38:163–171CrossRefGoogle Scholar
  10. 10.
    Bagher DM, Nezamabadi-pour H, Mashinchi M (2014) A discrete gravitational search algorithm for solving combinatorial optimization problems. Inf Sci 258:94–107MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Soleimanpour-moghadam M, Nezamabadi-pour H, Farsangi M, Maliha M (2014) A quantum inspired gravitational search algorithm for numerical function optimization. Inf Sci 267:83–100MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Guvenc U, Katırcıoglu F (2015) Best agent-specific behavior: improved gravitational search algorithm. Ecjse Journal of Science and Engineering 3(1):143–153Google Scholar
  13. 13.
    Rashedi E, Nezamabadi-Pour H (2013) A stochastic gravitational approach to feature based color image segmentation. Eng Appl Artif Intell 26(4):1322–1332CrossRefGoogle Scholar
  14. 14.
    Katırcıoglu F (2016) Improving of new operators for gravitational search algorithm Ph.D. dissertation, Dept. Elect-Electronic and Computer Eng., Duzce Univ., Duzce, TurkeyGoogle Scholar
  15. 15.
    Mirjalili S and Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization, International conference on computer and information applicationGoogle Scholar
  16. 16.
    Crothers SJ (2015) Black hole escape velocity—a case study in the decay of physics and astronomy Available: http://www.rxiv.org/pdf/1508.0066v1.pdf
  17. 17.
    Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–100CrossRefGoogle Scholar
  18. 18.
    Suganthan P N, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S(2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization KanGAL reportGoogle Scholar
  19. 19.
    Jones DR, Perttunen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79(1):157–181MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Haupt RL and Haupt SE (2004) Practical genetic algorithms John Wiley & Sons 2004Google Scholar
  21. 21.
    Tsai HC, Tyan YY, Wu YW, Lin YH (2013) Gravitational particle swarm. Appl Math Comput 219(17):9106–9117zbMATHGoogle Scholar
  22. 22.
    Han X, Quan L, Xiong X, Wu B (2015) Diversity enhanced and local search accelerated gravitational search algorithm for data fitting with B-splines. Eng Comput 31(2):215–236CrossRefGoogle Scholar
  23. 23.
    Garcia S, Molina D, Lozano M (2008) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special on real parameter optimization. J Heuristics 15:617–644CrossRefzbMATHGoogle Scholar
  24. 24.
    Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 6:80–83MathSciNetCrossRefGoogle Scholar
  25. 25.
    Zhang A, Sun G, Wang Z, Yao Y (2015) A hybrid genetic algorithm and gravitational search algorithm for global optimization. Neural Network World 25:53–73CrossRefGoogle Scholar
  26. 26.
    Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In Proceedings 2005 I.E. Swarm Intelligence Symposium 2005:68–75CrossRefGoogle Scholar
  27. 27.
    Mirjalili S, Lewis A (2014) Adaptive gbest-guided gravitational search algorithm. Neural Comput & Applic 25(7–8):1569–1584CrossRefGoogle Scholar
  28. 28.
    Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput & Applic 27(4):1053–1073CrossRefGoogle Scholar

Copyright information

© The Natural Computing Applications Forum 2017

Authors and Affiliations

  1. 1.Faculty of Technology, Department of Electrical-Electronics EngineeringUniversity of DuzceDuzceTurkey
  2. 2.Duzce Vocational High SchoolUniversity of DuzceDüzceTurkey

Personalised recommendations