A Multi-objective Generalized Teacher-Learning-Based-Optimization Algorithm

Teaching–Learning-Based Optimization (TLBO) was developed to solve single-objective optimization problems. It is inspired by the theory of teaching–learning mechanism, which works better for unimodal problems. However, TLBO’s exploration is weak, and hence its performance is not better for multimoda...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Institution of Engineers (India). Series B, Electrical Engineering, Electronics and telecommunication engineering, Computer engineering Vol. 103; no. 5; pp. 1415 - 1430
Main Authors Ram, Satya Deo Kumar, Srivastava, Shashank, Mishra, K. K.
Format Journal Article
LanguageEnglish
Published New Delhi Springer India 01.10.2022
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2250-2106
2250-2114
DOI10.1007/s40031-022-00731-9

Cover

More Information
Summary:Teaching–Learning-Based Optimization (TLBO) was developed to solve single-objective optimization problems. It is inspired by the theory of teaching–learning mechanism, which works better for unimodal problems. However, TLBO’s exploration is weak, and hence its performance is not better for multimodal problems. To solve multimodal problems and maintain good exploration, we made significant changes to the operators of basic TLBO. The changes we made are to add multiple teachers in the Teacher phase and Euclidean distance in the Student phase. With this modification to TLBO, we developed a multi-objective variant of TLBO to produce more diverse solutions to solve multi-objective optimization problems. The proposed algorithm, named multi-objective generalized TLBO (MOGTLBO), is tested on standard benchmark test problems. The simulated result of the proposed algorithm is compared with the other existing multi-objective optimization algorithms, and it is found that MOGTLBO performs better comparatively.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2250-2106
2250-2114
DOI:10.1007/s40031-022-00731-9