A hybrid attractive and repulsive particle swarm optimization based on gradient search

Authors:
Qing Liu;Fei Han
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Jiangsu, Zhenjiang, China;School of Computer Science and Telecommunication Engineering, Jiangsu University, Jiangsu, Zhenjiang, China
Venue:
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Year:
2013

Citing 4
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A novel global optimization technique for high dimensional functions

International Journal of Intelligent Systems
A new gradient based particle swarm optimization algorithm for accurate computation of global minimum

Applied Soft Computing
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

As an evolutionary computing technique, particle swarm optimization (PSO) has good global search ability, but its search performance is restricted because of stochastic search and premature convergence. In this paper, attractive and repulsive PSO (ARPSO) accompanied by gradient search is proposed to perform hybrid search. On one hand, ARPSO keeps the reasonable search space by controlling the swarm not to lose its diversity. On the other hand, gradient search makes the swarm converge to local minima quickly. In a proper solution space, gradient search certainly finds the optimal solution. In theory, The hybrid PSO converges to the global minima with higher probability than some stochastic PSO such as ARPSO. Finally, the experiment results show that the proposed hybrid algorithm has better convergence performance with better diversity than some classical PSOs.