Transition from particle swarm optimization to individual particle optimization
Authors:
- 1 July 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10851992,p. 1409-1414
Abstract
This paper proposes a novel optimization method in order to real time implementation based on standard particle swarm optimization idea and characteristics of chaotic maps which is named as individual particle optimization (IPO). Three typical benchmark functions are used to validate the proposed algorithm performance and runtime and then compare with that of the other algorithms known as modified PSOs. Six functions reported in SIS2005 are used to better verification of the proposed algorithm. Numerical results indicate that IPO is competitive due to its more competitive convergence rate and ability to find the functions' global optimum.Keywords
This publication has 25 references indexed in Scilit:
- Fuzzy Parameter Particle Swarm Optimization2008
- Adaptive diversity in PSO2006
- Novel composition test functions for numerical global optimization2005
- Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration CoefficientsIEEE Transactions on Evolutionary Computation, 2004
- A Cooperative Approach to Particle Swarm OptimizationIEEE Transactions on Evolutionary Computation, 2004
- Evaluation of Comprehensive Learning Particle Swarm Optimizer2004
- Particle swarm optimisation with spatial particle extension2003
- Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)Evolutionary Computation, 2003
- A Computationally Efficient Evolutionary Algorithm for Real-Parameter OptimizationEvolutionary Computation, 2002
- Fuzzy adaptive particle swarm optimization2002