Affiliations: Department of Computer Science and Engineering, NIT Raipur, Chhattisgarh (C.G), India
Correspondence:
[*]
Corresponding author. Alok Kumar Shukla, Department of Computer Science and Engineering, NIT Raipur, Chhattisgarh (C.G), 492010, India. E-mail: akshukla.phd2015.cs@nitrr.ac.in.
Abstract: In the recent era, evolutionary meta-heuristic algorithms is popular research area in engineering and scientific field. One of the intelligent evolutionary meta-heuristic algorithms is Teaching Learning Based Optimization (TLBO). The basic TLBO algorithm follows the isolated learning strategy for the whole population. This invariable learning strategy may cause the misconception of knowledge for a specific learner, which makes it unable to deal with different complex situations. For solving the complex non-linear optimization problems, local optimum frequently happens in the generating process. To resolve these kinds of problem, this paper introduces Neighbour based TLBO (NTLBO) and differential mutation. The concept of neighbour learning and differential mutation is introduced to improve the convergence solution after each run of experiment. Neighbour learning method maintains the explorative and exploitation search of the population and discourages the premature convergence. The efficiency of the proposed algorithm is evaluated on eight benchmark functions of Congress on Evolutionary Computation (CEC) 2006. The proposed NTLBO present extensive comparative study with the state-of-the-art forms of the meta-heuristic algorithms for standard benchmark functions. The result shows that the proposed NTLBO gives the superior performance over recent meta-heuristic algorithms.
