Abstract

A Novel Distributed Gravitational Search Algorithm With Multi-Layered Information Interaction

Highlights

  • Meta-heuristic algorithms (MHAs) have attracted more and more attention in the recent years [1]

  • In order to prevent the algorithm from falling into local optimization, we set up the historical information layer to manage the elite top layer by Eqs. (12) and (13)

  • Through the information interaction between the elite top layer and the historical information layer, MGSA realizes the better balance between exploitation and exploration

Read more

Summary

INTRODUCTION

Meta-heuristic algorithms (MHAs) have attracted more and more attention in the recent years [1]. In [46], [47], [70], hierarchical, multi-layered and distributed structures are devised to optimize individuals’ interaction These mechanisms effectively alleviate the limitation of GSA such that its performance is improved. As one state-of-the-art GSA variant, DGSA [70] is the most recently proposed for function optimization and realworld optimization problems It uses a distributed framework and three-layered hierarchical structure to guide individuals’ search. The interaction among individuals needs to be further improved to accelerate the convergence of algorithm To realize such objective, this paper innovatively proposes a distributed gravitational search algorithm with multi-layer information interaction (MGSA) based on DGSA. The resultant MGSA optimizes the population structure and introduces historical information It effectively improves the information interaction among individuals.

DESCRIPTION OF DGSA
DESCRIPTION OF MGSA
Initialization
TIME COMPLEXITY OF MGSA
EXPERIMENTS
EXPERIMENTAL SETUP
PERFORMANCE EVALUATION CRITERIA
COMPARISON FOR GSA VARIANTS
COMPARISON FOR COMPETITIVE ALGORITHMS
Findings
CONCLUSIONS

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.