A novel hybrid teaching learning based multi-objective particle swarm optimization

被引:52
作者
Cheng, Tingli [1 ]
Chen, Minyou [1 ]
Fleming, Peter J. [2 ]
Yang, Zhile [3 ]
Gan, Shaojun [3 ]
机构
[1] Chongqing Univ, Sch Elect Engn, Chongqing, Peoples R China
[2] Univ Sheffield, Dept Automat Control & Syst Engn, Sheffield S10 2TN, S Yorkshire, England
[3] Queens Univ Belfast, Sch Elect Elect Engn & Comp Sci, Belfast BT7 1NN, Antrim, North Ireland
基金
中国国家自然科学基金;
关键词
Multi-objective optimization; Particle swarm optimization; Teaching learning based optimization; Crowded sorting; MULTIPLE OBJECTIVES; ALGORITHM; EVOLUTIONARY; PSO;
D O I
10.1016/j.neucom.2016.10.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
How to obtain a good convergence and well-spread optimal Pareto front is still a major challenge for most meta heuristic multi-objective optimization (MOO) methods. In this paper, a novel hybrid teaching learning based particle swarm optimization (HTL-PSO) with circular crowded sorting (CCS), named HTL-MOPSO, is proposed for solving MOO problems. Specifically, the new HTL-MOPSO combines the canonical PSO search with a teaching-learning-based optimization (TLBO) algorithm in order to promote the diversity and improve search ability. Also, CCS technique is developed to improve the diversity and spread of solutions when truncating the external elitism archive. The performance of HTL-MOPSO algorithm was tested on several well-known benchmarks problems and compared with other state-of-the-art MOO algorithms in respect of convergence and spread of final solutions to the true Pareto front. Also, the individual contributions made by the strategies of HTL-PSO and CCS are analyzed. Experimental results validate the effectiveness of HTL-MOPSO and demonstrate its superior ability to find solutions of better spread and diversity, while assuring a good convergence.
引用
收藏
页码:11 / 25
页数:15
相关论文
共 37 条
[1]   Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method [J].
Abu Arqub, Omar ;
AL-Smadi, Mohammed ;
Momani, Shaher ;
Hayat, Tasawar .
SOFT COMPUTING, 2016, 20 (08) :3283-3302
[2]   Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm [J].
Abu Arqub, Omar ;
Abo-Hammour, Zaer .
INFORMATION SCIENCES, 2014, 279 :396-415
[3]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[4]  
[Anonymous], 2005, SCALABLE TEST PROBLE
[5]  
Barr R. S., 1995, Journal of Heuristics, V1, P9, DOI 10.1007/BF02430363
[6]   Improved multi-objective particle swarm optimization with preference strategy for optimal DG integration into the distribution system [J].
Cheng, Shan ;
Chen, Min-You ;
Fleming, Peter J. .
NEUROCOMPUTING, 2015, 148 :23-29
[7]   An innovative hybrid multi-objective particle swarm optimization with or without constraints handling [J].
Cheng, Shixin ;
Zhan, Hao ;
Shu, Zhaoxin .
APPLIED SOFT COMPUTING, 2016, 47 :370-388
[8]   A Multiobjective Evolutionary Algorithm That Diversifies Population by Its Density [J].
Chow, Chi Kin ;
Yuen, Shiu Yin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2012, 16 (02) :149-172
[9]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[10]   MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm [J].
Cooren, Yann ;
Clerc, Maurice ;
Siarry, Patrick .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2011, 49 (02) :379-400