Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alec B, Jonathan V, Chukwudi A (2007) A review of particle swarm optimization. part i: background and development. Nat Comput 6(4):467–484
Alec B, Jonathan V, Chukwudi A (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications Nat comput 7(1):109–124
Ali MM, Kaelo P (2008) Improved particle swarm algorithms for global optimization. Appl Math Comput 196:578–593
Barnard CJ, Sibly RM (1981) Producers and scroungers: a general model and its application to captive flocks of house sparrows. Anim Behav 29:543–550
Box GE-P, Hunter JS, Hunter WG (2005) Statistics for experiments: design, innovation, and discovery, 2nd edn. Wiley, New York
Èrepinšek M, Liu SH, Mernik L (2012) A note on teaching–learning-base optimization algorithm. Inf Sci 212:79–93
Floudas CA, Gounaris CE (2009) A review of recent advances in global optimization. J Global Optim 45:3–38
He S, Wu QH, Saunders JR (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973–990
Hossein H, Taher N, Seyed IT (2011) A Modified TLBO algorithm for Placement of AVRs considering DGs. In: 26th international power system conference, pp 1–8
Hu X, Eberhart R, Shi Y (2003) Swarm intelligence for permutation optimization: a case study on n-Queens problem. In: Proc. of IEEE swarm intelligence symposium, pp 243–246
Kennedy J, Eberhart R (1995) Particle swarm optimization, In: IEEE Service Center (ed) Proceedings of the 4th IEEE international conference on neural networks, Piscataway, pp 1942–1948
Li C, Liu Y, Zhao A et al (2007) A fast particle swarm algorithm with cauchy mutation and natural selection strategy. LNCS 4683:334–343
Omkar SN, Khandelwal R, Ananth TVS et al (2009) Quantum behaved particle swarm optimization (qpso) for multi-objective design optimization of composite structures. Expert Syst Appl 36(8):11312–11322
Pant M, Thangaraj R, Singh VP (2009) Sobol mutated quantum particle swarm optimization. Int J Recent Trends Eng 1(1):95–99
Park SY, Lee JJ (2013) An efficient differential evolution using speeded-up k-nearest neighbor estimator. SOCO. doi:10.1007/s00500-013-1030-x
Pham DT, Castellani M (2013) Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms. SOCO. doi:10.1007/s00500-013-1104-9
Sabat SL, Ali L, Udgata SK (2011) Integrated learning particle swarm optimizer for global optimization. Appl Soft Comput 11:574–584
Sandeep R, Sanjay J, Rajesh K (2011) A review on particle swarm optimization algorithms and their applications to data clustering. Artif Intell Rev 35(3):211–222
Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE international conference on evolutionary computation, Anchorage, pp 69–73
Stacey A, Jancic M, Grundy I (2003) Particle swarm optimization with mutation. In: Proceedings Congress Evolutionary Computation, pp 1425–1430
Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report for CEC2005 special session. http://www3.ntu.edu.sg/home/EPNSugan
Sun J, Feng B, Xu WB (2004) Particle swarm optimization with particles having quantum behavior. In: IEEE Proceedings of Congress on Evolutionary Computation, pp 325–331
Sun J, Xu W, Feng B (2004) A global search strategy of quantum-behaved particle swarm optimization. In: Proceedings of the 2004 IEEE conference on cybernetics and intelligent systems, Singapore, pp 111–116
Suresh CS, Anima N (2011) Based data clustering, on teaching-learning-based optimization SEMCCO Part II. LNCS, vol 7077, pp 148–156
Ting TO, Rao MVC, Loo CK, Ngu SS (2003) A new class of operators to accelerate particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, vol 4, pp 2406–2410
Vedat T (2012) Design of planar steel frames using teaching–learning based optimization. Eng Struct 34:225–232
Venkata Rao R, savasni VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aid Design 43(3):303–315
Venkata Rao R, savasni VJ, Bilac J (2012) Teaching-learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems. Inf Sci 183(1):1–15
Venkata Rao R, savasni VJ, Vakharia DP (2012) Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15
Venkata Rao R, vivek P (2012) An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems. Int J Ind Eng Comput 3(4):535–560
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82
Xi ML, Sun J, Xu WB (2008) An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Appl Math Comput 205:751–759
Yao X, Liu Y, Lin GM (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102
Zhan ZH, Zhang J (2008) Adaptive particle swarm optimization. Lecture Notes in Computer Science 52(17):227–234
Zhan ZH, Zhang J, Li Y et al (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B Cybern 39(6):1362–1381
Zhang DG (2012) A new approach and system for attentive mobile learning based on seamless migration. Appl Intell 36(1):75–89
Zhang DG, Li G, Pan ZH (2014) An energy-balanced routing method based on forward-aware factor for wireless sensor network. IEEE Trans Ind Inf 10(1):766–773
Zhang Y, Gong DW, Sun XY, Geng N (2013) Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis. SOCO. doi:10.1007/s00500-013-1147-y
Acknowledgments
This work is partially supported by Natural Science Foundation of Anhui Province, China, (Grant No. 1308085MF82), National Natural Science Foundation of China (Grants No. 61304082, 61203272), Sci-tech talents cultivation Fund projects of HuaiBei city (Grant No. 20110304).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by E. Viedma.
Rights and permissions
About this article
Cite this article
Chen, D., Zou, F., Wang, J. et al. A teaching–learning-based optimization algorithm with producer–scrounger model for global optimization. Soft Comput 19, 745–762 (2015). https://doi.org/10.1007/s00500-014-1298-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-014-1298-5