Abstract

Teaching–learning-based optimization (TLBO) algorithms is one of the swarm-based optimization search algorithms. It develops based on the teaching–learning procedures at a classroom to solve multi-dimensional and nonlinear problems. In this paper, convergence and stability analysis of TLBO are studied. The stability of individual dynamics is analyzed by Lyapunov stability theorem and the concept of system dynamics. Stability conditions are achieved and utilized for adapting parameters of the TLBO. The TLBO algorithm is modified based on stability analysis. The modified TLBO is compared with the standard TLBO, particle swarm optimization (PSO), real genetic algorithm (RGA), and gravitational search algorithm (GSA). Simulation results confirm the validity and feasibility of the proposed modified TLBO. The appropriate performance is achieved for multi-dimensional and nonlinear standard bench functions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call