作者: Seyedali Mirjalili , Andrew Lewis
DOI: 10.1016/J.SWEVO.2012.09.002
关键词:
摘要: Particle Swarm Optimization (PSO) is one of the most widely used heuristic algorithms. The simplicity and inexpensive computational cost makes this algorithm very popular powerful in solving a wide range problems. binary version has been introduced for main part transfer function which responsible to map continuous search space discrete space. Currently there appears be insufficient focus on literature despite its apparent importance. In study six new functions divided into two families, s-shaped v-shaped, are evaluated. Twenty-five benchmark optimization provided by CEC 2005 special session employed evaluate these select best terms avoiding local minima convergence speed. order validate performance function, comparative with recent modifications BPSO as well. results prove that v-shaped family significantly improves original PSO.