Particle swarm optimization algorithm with asymmetric time varying acceleration coefficients

Authors:
G. Q. Bao;K. F. Mao
Affiliations:
Electrical Engineering Department, Gansu University of Technology, China;Electrical Engineering Department, Gansu University of Technology, China
Venue:
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Year:
2009

Citing 5
Cited 0

The annealing algorithm

The annealing algorithm
New ideas in optimization

New ideas in optimization
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Using the particle swarm optimization technique to train a recurrent neural model

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To update the performance of the standard optimization method, a modified particle swarm optimization (MPSO) algorithm is proposed based on the earlier works. An asymmetric time-varying acceleration coefficients adjusting strategy introduced in this paper is to keep the balance between the global search and the local search with the great advantages of convergence property and robustness compared with basic PSO algorithm. The relationship between swarm average velocity and convergence is studied through Benchmark test functions simulation. All the merits mentioned above are demonstrated by the compound gear transmission ratio optimization in transmission systems.