Novel Multi-swarm Approach for Balancing Exploration and Exploitation in Particle Swarm Optimization

Several metaheuristic algorithms and improvements to the existing ones have been presented over the years. Most of these algorithms were inspired either by nature or the behavior of certain swarms, such as birds, ants, bees, or even bats. These algorithms have two major components, which are explora...

Full description

Saved in:
Bibliographic Details
Main Authors: Salih, Sinan Q., Alsewari, Abdulrahman A., Al-Khateeb, Bellal, Mohamad Fadli, Zolkipli
Format: Book Section
Language:English
Published: Springer International Publishing 2019
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/22271/1/Novel%20Multi-Swarm%20Approach%20for%20Balancing%20Exploration1.pdf
http://umpir.ump.edu.my/id/eprint/22271/
https://doi.org/10.1007/978-3-319-99007-1_19
https://doi.org/10.1007/978-3-319-99007-1_19
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Malaysia Pahang
Language: English
Description
Summary:Several metaheuristic algorithms and improvements to the existing ones have been presented over the years. Most of these algorithms were inspired either by nature or the behavior of certain swarms, such as birds, ants, bees, or even bats. These algorithms have two major components, which are exploration and exploitation. The interaction of these components can have a significant influence on the efficiency of the metaheuristics. Meanwhile, there are basically no guiding principles on how to strike a balance between these two components. This study, therefore, proposes a new multi-swarm-based balancing mechanism for keeping a balancing between the exploration and exploitation attributes of metaheuristics. The new approach is inspired by the phenomenon of the leadership scenario among a group of people (a group of people being governed by a selected leader(s)). These leaders communicate in a meeting room, and the overall best leader makes the final decision. The simulation aspect of the study considered several benchmark functions and compared the performance of the suggested algorithm to that of the standard PSO (SPSO) in terms of efficiency.