S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization

被引:802
作者
Mirjalili, Seyedali [1 ]
Lewis, Andrew [1 ]
机构
[1] Griffith Univ, Sch Informat & Commun Technol, Brisbane, Qld 4111, Australia
关键词
PSO; Particle swarm; Transfer function; Evolutionary algorithm; Heuristic algorithm; BPSO; GLOBAL OPTIMIZATION; ALGORITHM; EVOLUTIONARY;
D O I
10.1016/j.swevo.2012.09.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Particle Swarm Optimization (PSO) is one of the most widely used heuristic algorithms. The simplicity and inexpensive computational cost makes this algorithm very popular and powerful in solving a wide range of problems. The binary version of this algorithm has been introduced for solving binary problems. The main part of the binary version is a transfer function which is responsible to map a continuous search space to a discrete search space. Currently there appears to be insufficient focus on the transfer function in the literature despite its apparent importance. In this study six new transfer functions divided into two families, s-shaped and v-shaped, are introduced and evaluated. Twenty-five benchmark optimization functions provided by CEC 2005 special session are employed to evaluate these transfer functions and select the best one in terms of avoiding local minima and convergence speed. In order to validate the performance of the best transfer function, a comparative study with six recent modifications of BPSO is provided as well. The results prove that the new introduced v-shaped family of transfer functions significantly improves the performance of the original binary PSO. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 37 条
[1]  
[Anonymous], 1997, P IEEE INT C COMP CY
[2]  
[Anonymous], GRID SCHEDULING USIN
[3]  
Chandra Satish, 2009, Proceedings of the 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), P666, DOI 10.1109/NABIC.2009.5393455
[4]   Improved binary particle swarm optimization using catfish effect for feature selection [J].
Chuang, Li-Yeh ;
Tsai, Sheng-Wei ;
Yang, Cheng-Hong .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (10) :12699-12707
[5]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[6]  
Eberhart R., 1995, MHS 95, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[7]  
Eberhart R.C., 2001, C EV COMP 2001 SEOUL
[8]   Parameter tuning for configuring and analyzing evolutionary algorithms [J].
Eiben, A. E. ;
Smit, S. K. .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :19-31
[9]   Particle swarm optimisation based video abstraction [J].
Fayk, Magda B. ;
El Nemr, Heba A. ;
Moussa, Mona M. .
JOURNAL OF ADVANCED RESEARCH, 2010, 1 (02) :163-167
[10]   A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization [J].
Garcia, Salvador ;
Molina, Daniel ;
Lozano, Manuel ;
Herrera, Francisco .
JOURNAL OF HEURISTICS, 2009, 15 (06) :617-644