Teaching and peer-learning particle swarm optimization

• Published in: Applied soft computing Vol. 18; pp. 39 - 58
• Main Authors: Lim, Wei Hong, Mat Isa, Nor Ashidi
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.05.2014
• Subjects: Global optimization; Metaheuristic search; Teaching and peer-learning particle swarm optimization (TPLPSO); Teaching–learning-based optimization (TLBO); Teaching and peer-learning particle swarm optimization (TPLPSO); Global optimization; Teaching–learning-based optimization (TLBO); Metaheuristic search
• DOI: 10.1016/j.asoc.2014.01.009
• ISSN: 1568-4946

The graphical illustration of the proposed teaching and peer-learning PSO (TPLPSO), consisting of the teaching phase, the peer-learning phase, and the stagnation prevention strategy (SPS). •A PSO algorithm's variant, abbreviated as TPLPSO, is proposed.•Teaching and peer-learning framework is proposed to improve PSO's performance.•Stagnation prevention strategy is proposed to mitigate the premature convergence.•TPLPSO has higher searching accuracy and convergence speed during the optimization.•Results show that TPLPSO outperforms other state-of-the-art PSO variants. Most of the recent proposed particle swarm optimization (PSO) algorithms do not offer the alternative learning strategies when the particles fail to improve their fitness during the searching process. Motivated by this fact, we improve the cutting edge teaching–learning-based optimization (TLBO) algorithm and adapt the enhanced framework into the PSO, thereby develop a teaching and peer-learning PSO (TPLPSO) algorithm. To be specific, the TPLPSO adopts two learning phases, namely the teaching and peer-learning phases. The particle firstly enters into the teaching phase and updates its velocity based on its historical best and the global best information. Particle that fails to improve its fitness in the teaching phase then enters into the peer-learning phase, where an exemplar is selected as the guidance particle. Additionally, a stagnation prevention strategy (SPS) is employed to alleviate the premature convergence issue. The proposed TPLPSO is extensively evaluated on 20 benchmark problems with different features, as well as one real-world problem. Experimental results reveal that the TPLPSO exhibits competitive performances when compared with ten other PSO variants and seven state-of-the-art metaheuristic search algorithms.