Fast Convergence Particle Swarm Optimization for Functions Optimization

作     者：Amaresh Sahu Sushanta Kumar Panigrahi Sabyasachi Pattnaik 

作者机构：Siksha ‘O’ Anusandhan University Bhubaneswar Orissa India Fakir Mohan University Balasore Orissa India 

出 版 物：《Procedia Technology》 (科技会议集)

年 卷 期：2012年第4卷

页      面：319-324页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

主　　题：Particle swarm optimization algorithm adaptive weight constriction factor Particle mean dimension 

摘      要：Time to time, many researchers have suggested modifications to the standard particle swarm optimization to find good solutions faster than the evolutionary algorithms, but they could be possibly stuck in poor region or diverge to unstable situations. For overcoming such problems, this paper proposes new Fast Convergence Particle Swarm Optimization (FCPSO) approach based on balancing the diversity of location of individual particle by introducing a new parameter, particle mean dimension (Pmd) of all particles to improve the performance of PSO. The FCPSO method is tested with five benchmark functions by variable dimensions and fixed size population and compared with PSO & Constriction factor approach of PSO (CPSO). Finally, search performances of these methods on the benchmark functions are tested.