An improved clustering-based multi-swarm PSO using local diversification and topology information
By: Yves Matanga, Yanxia Sun, Zenghui Wang
Potential Business Impact:
Finds many hidden answers in complex problems.
Multi-swarm particle optimisation algorithms are gaining popularity due to their ability to locate multiple optimum points concurrently. In this family of algorithms, clustering-based multi-swarm algorithms are among the most effective techniques that join the closest particles together to form independent niche swarms that exploit potential promising regions. However, most clustering-based multi-swarms are Euclidean distance-based and only inquire about the potential of one peak within a cluster and thus can lose multiple peaks due to poor resolution. In a bid to improve the peak detection ratio, the current study proposes two enhancements. First, a preliminary local search across initial particles is proposed to ensure that each local region is sufficiently scouted prior to particle collaboration. Secondly, an investigative clustering approach that performs concavity analysis is proposed to evaluate the potential for several sub-niches within a single cluster. An improved clustering-based multi-swarm PSO (TImPSO) has resulted from these enhancements and has been tested against three competing algorithms in the same family using the IEEE CEC2013 niching datasets, resulting in an improved peak ratio for almost all the test functions.
Similar Papers
Improved particle swarm optimization algorithm: multi-target trajectory optimization for swarm drones
Robotics
Drones fly together safely and fast.
An Explainable Framework for Particle Swarm Optimization using Landscape Analysis and Machine Learning
Neural and Evolutionary Computing
Explains how robot groups work better together.
Sequential, Parallel and Consecutive Hybrid Evolutionary-Swarm Optimization Metaheuristics
Neural and Evolutionary Computing
Boosts problem-solving for tough math puzzles