Constrained function optimization using PSO with polynomial mutation

Authors:
Tapas Si;Nanda Dulal Jana;Jaya Sil
Affiliations:
Department of Information Technology, National Institute of Technology, Durgapur, West Bengal, India;Department of Information Technology, National Institute of Technology, Durgapur, West Bengal, India;Department of Computer Science and Technology, BESU, West Bengal, India
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 5
Cited 1

Particle swarm optimization method in multiobjective problems

Proceedings of the 2002 ACM symposium on Applied computing
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Adaptive Particle Swarm Optimization Algorithm With Genetic Mutation Operation

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 02
Particle Swarm Optimization with Adaptive Mutation

ICIE '09 Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02
A fast particle swarm optimization algorithm with cauchy mutation and natural selection strategy

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence

Particle swarm optimisation with differential mutation

International Journal of Intelligent Systems Technologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constrained function optimization using particle swarm optimization (PSO) with polynomial mutation is proposed in this work. In this method non-stationary penalty function approach is adopted and polynomial mutation is performed on global best solution in PSO. The proposed method is applied on 6 benchmark problems and obtained results are compared with the results obtained from basic PSO. The experimental results show the efficiency and effectiveness of the method.