A teaching-learning-based optimization algorithm with producer-scrounger model for global optimization

被引:21
作者
Chen, Debao [1 ]
Zou, Feng [1 ]
Wang, Jiangtao [1 ]
Yuan, Wujie [1 ]
机构
[1] HuaiBei Normal Univ, Sch Phys & Elect Informat, Huaibei 235000, Peoples R China
基金
中国国家自然科学基金;
关键词
Teaching-learning-based optimization (TLBO); Particle swarm optimization (PSO); Global optimization; Benchmark problems; Producer-scrounger model; PARTICLE SWARM OPTIMIZATION; DESIGN OPTIMIZATION;
D O I
10.1007/s00500-014-1298-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to decrease the computation cost and improve the global performance of the original teaching-learning-based optimization (TLBO) algorithm, the area-copying operator of the producer-scrounger (PS) model is introduced into TLBO for global optimization problems. In the proposed method, the swarm is divided into three parts: the producer, scroungers and remainders. The producer is the best individual selected from current population and it exploits the new solution with a random angle and a maximal radius. Some individuals, which are different from the producer, are randomly selected according to a predefined probability as scroungers. The scroungers update their position with an area-copying operator, which is used in the PS model. The remainders are updated by means of teaching and learning operators as they are used in the TLBO algorithm. In each iteration, the computation cost of the proposed algorithm is less than that of the original TLBO algorithm, because the individuals of the PS model are only evaluated once and the individuals of the TLBO algorithm are evaluated two times in each iteration. The proposed algorithm is tested on different kinds of benchmark problems, and the results indicate that the proposed algorithm has competitive performance to some other algorithms in terms of accuracy, convergence speed and success rate.
引用
收藏
页码:745 / 762
页数:18
相关论文
共 37 条
[11]   Swarm intelligence for permutation optimization: A case study of n-queens problem [J].
Hu, XH ;
Eberhart, RC ;
Shi, YH .
PROCEEDINGS OF THE 2003 IEEE SWARM INTELLIGENCE SYMPOSIUM (SIS 03), 2003, :243-246
[12]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[13]  
Li CH, 2007, LECT NOTES COMPUT SC, V4683, P334
[14]   Quantum behaved Particle Swarm Optimization (QPSO) for multi-objective design optimization of composite structures [J].
Omkar, S. N. ;
Khandelwal, Rahul ;
Ananth, T. V. S. ;
Naik, G. Narayana ;
Gopalakrishnan, S. .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (08) :11312-11322
[15]  
Pant Millie, 2009, International Journal of Recent Trends in Engineering, V1, P95
[16]  
Park SY, 2013, EFFICIENT DIFFERENTI, DOI [10.1007/s00500-013-1030-x, DOI 10.1007/S00500-013-1030-X]
[17]  
Pham DT, 2013, BENCHMARKING COMP NA, DOI [10.1007/s00500-013-1104-9, DOI 10.1007/S00500-013-1104-9]
[18]   A review on particle swarm optimization algorithms and their applications to data clustering [J].
Rana, Sandeep ;
Jasola, Sanjay ;
Kumar, Rajesh .
ARTIFICIAL INTELLIGENCE REVIEW, 2011, 35 (03) :211-222
[19]  
Rao R., 2012, international journal of industrial engineering computations, V3, P535
[20]   Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems [J].
Rao, R. V. ;
Savsani, V. J. ;
Vakharia, D. P. .
INFORMATION SCIENCES, 2012, 183 (01) :1-15