Systems Engineering and Electronics ›› 2020, Vol. 42 ›› Issue (1): 148-156.doi: 10.3969/j.issn.1001-506X.2020.01.20

Previous Articles     Next Articles

Adaptive gravitational search algorithm improved by hybrid methods

Ao LOU1(), Minli YAO1(), Weimin JIA2(), Ding YUAN1()   

  1. 1. School of Military Operational Support, Rocket Force University of Engineering, Xi'an 710025, China
    2. School of Nuclear Engineering, Rocket Force University of Engineering, Xi'an 710025, China
  • Received:2019-05-27 Online:2020-01-01 Published:2019-12-23
  • Supported by:
    国家自然科学基金(61179004);国家自然科学基金(61179005)

Abstract:

In order to overcome the shortcomings of premature convergence, trapping in local optimum easily and lower search accuracy of gravitational search algorithm (GSA), an adaptive GSA improved by hybrid methods is proposed. Firstly, sobol sequence is used to initialize the population and enhance the global search ability. Secondly, hamming nearness degree is introduced to calculate the population maturity and judge whether the population is premature. Thirdly, logistic chaos is introduced to search the population chaotically and update the particle which has fallen into the local optimum. Finally, based on the precocious convergence judgment factor, the gravitational coefficient is improved, and the shrinkage factor is added to the particle position formula to accelerate the population departure from the local optimum. The simulation results of nine different types of benchmark functions show that the new algorithm can effectively improve the premature convergence problem and has better optimization performance.

Key words: gravitational search algorithm (GSA), low-discrepancy sequence, nearness degree, chaos

CLC Number: 

[an error occurred while processing this directive]