LADPSO: using fuzzy logic to conduct PSO algorithm

被引:25
作者
Norouzzadeh, Mohammad Sadegh [1 ]
Ahmadzadeh, Mohammad Reza [1 ]
Palhang, Maziar [1 ]
机构
[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan, Iran
关键词
Particle swarm optimization; Fuzzy control; Random search; Numerical function optimization; Premature convergence; PARTICLE SWARM;
D O I
10.1007/s10489-011-0328-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Optimization plays a critical role in human modern life. Nowadays, optimization is used in many aspects of human modern life including engineering, medicine, agriculture and economy. Due to the growing number of optimization problems and their growing complexity, we need to improve and develop theoretical and practical optimization methods. Stochastic population based optimization algorithms like genetic algorithms and particle swarm optimization are good candidates for solving complex problems efficiently. Particle swarm optimization (PSO) is an optimization algorithm that has received much attention in recent years. PSO is a simple and computationally inexpensive algorithm inspired by the social behavior of bird flocks and fish schools. However, PSO suffers from premature convergence, especially in high dimensional multi-modal functions. In this paper, a new method for improving PSO has been introduced. The Proposed method which has been named Light Adaptive Particle Swarm Optimization is a novel method that uses a fuzzy control system to conduct the standard algorithm. The suggested method uses two adjunct operators along with the fuzzy system in order to improve the base algorithm on global optimization problems. Our approach is validated using a number of common complex uni-modal/multi-modal benchmark functions and results have been compared with the results of Standard PSO (SPSO2011) and some other methods. The simulation results demonstrate that results of the proposed approach is promising for improving the standard PSO algorithm on global optimization problems and also improving performance of the algorithm.
引用
收藏
页码:290 / 304
页数:15
相关论文
共 38 条
[1]   Using selection to improve particle swarm optimization [J].
Angeline, PJ .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :84-89
[2]  
[Anonymous], 2002, Computational Intelligence an Introduction
[3]  
Auger A, 2005, IEEE C EV COMP CEC20, V2, P1785
[4]  
Blackwell T.M., 2002, P GEN EV COMP C, P19
[5]   A novel particle swarm optimizer hybridized with extremal optimization [J].
Chen, Min-Rong ;
Li, Xia ;
Zhang, Xi ;
Lu, Yong-Zai .
APPLIED SOFT COMPUTING, 2010, 10 (02) :367-373
[6]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[7]  
Clerc M., 2001, Think Locally, Act Locally: The Way of Life of Cheap-PSO
[8]  
Fan E, 2002, THESIS MCMASTER U
[9]  
Gibbons J.D., 1985, NONPARAMETRIC STAT I
[10]   An infeasible point method for minimizing the Lennard-Jones potential [J].
Gockenbach, MS ;
Kearsley, AJ ;
Symes, WW .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 8 (03) :273-286