Enforced Mutation to Enhancing the Capability of Particle Swarm Optimization Algorithms

Particle Swarm Optimization (PSO), proposed by Professor Kennedy and Eberhart in 1995, attracts many attentions to solve for a lot of optimization problems nowadays. Due to its simplicity of setting-parameters and computational efficiency, it becomes one of the most popular algorithms in optimizations. However, the discrepancy of PSO is the low dimensionality of the problem can be solved. Once the optimized function becomes complicated, the efficiency gained in PSO degradates rapidly. More complex algorithms on PSO required. Therefore, different algorithms will be applied to different problems with difficulties. Three different algorithms are suggested to solve different problems accordinately. In summary, proposed PSO algorithms apply well to problems with different difficulties in the final simulations.

[1]  Hassan M. Elkamchouchi,et al.  Application of Particle Swarm Optimization Algorithm in Smart Antenna Array Systems , 2009 .

[2]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  Zhihua Cui,et al.  Individual Parameter Selection Strategy for Particle Swarm Optimization , 2009 .

[4]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  PenChen Chou,et al.  A proposal for improved Particle Swarm Optimization , 2010, 2010 International Symposium on Computer, Communication, Control and Automation (3CA).

[6]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[7]  Omar Hegazy,et al.  Swarm Intelligence Applications in Electric Machines , 2009 .

[8]  Andries P. Engelbrecht,et al.  Computational Intelligence: An Introduction , 2002 .