An Adaptation Social Spider Optimization Algorithm Based on Dynamic Multi-swarm Strategy
DOI:
Author:
Affiliation:

Clc Number:

TP273

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
    Abstract:

    In order to improve the samples diversity and convergence properties of social spiders optimization algorithm (SSO), an adaptation social spider optimization algorithm based on dynamic multi-swarm strategy (DMASSO) is proposed. According to the algorithm samples diversity and evolutionary level, the spider population is dynamically divided into different sizes leading groups and supporting groups, and the adaptive learning factor and Gaussian disturbance factor are introduced to improve the algorithm update ways, which helps to improve the algorithm global optimization ability and maintain the diversity of the sample population. For the test results of typical characteristics functions show that compared to SSO algorithm, SFLA algorithm and other optimization algorithms, the new algorithm has better convergence speed and convergence accuracy.

    Reference
    Related
    Cited by
Get Citation

Cite this article as: LIU Zhou-Zhou, LI Bin. An Adaptation Social Spider Optimization Algorithm Based on Dynamic Multi-swarm Strategy [J]. J Sichuan Univ: Nat Sci Ed, 2017, 54: 721.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 13,2016
  • Revised:August 28,2016
  • Adopted:September 04,2016
  • Online: July 26,2017
  • Published: