A Caltech Library Service

A note on teaching–learning-based optimization algorithm

Črepinšek, Matej and Liu, Shih-Hsi and Mernik, Luka (2012) A note on teaching–learning-based optimization algorithm. Information Sciences, 212 . pp. 79-93. ISSN 0020-0255.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


Teaching–Learning-Based Optimization (TLBO) seems to be a rising star from amongst a number of metaheuristics with relatively competitive performances. It is reported that it outperforms some of the well-known metaheuristics regarding constrained benchmark functions, constrained mechanical design, and continuous non-linear numerical optimization problems. Such a breakthrough has steered us towards investigating the secrets of TLBO’s dominance. This paper reports our findings on TLBO qualitatively and quantitatively through code-reviews and experiments, respectively. Our findings have revealed three important mistakes regarding TLBO: (1) at least one unreported but important step; (2) incorrect formulae on a number of fitness function evaluations; and (3) misconceptions about parameter-less control. Additionally, unfair experimental settings/conditions were used to conduct experimental comparisons (e.g., different stopping criteria). The experimental results for constrained and unconstrained benchmark functions under fairly equal conditions failed to validate its performance supremacy. The ultimate goal of this paper is to provide reminders for metaheuristics’ researchers and practitioners in order to avoid similar mistakes regarding both the qualitative and quantitative aspects, and to allow fair comparisons of the TLBO algorithm to be made with other metaheuristic algorithms.

Item Type:Article
Related URLs:
URLURL TypeDescription DOIArticle
Additional Information:© 2012 Elsevier Inc. Received 13 October 2011. Received in revised form 10 May 2012. Accepted 16 May 2012. Available online 28 May 2012. The third author’s work was partly sponsored by the Slovene Human Resources Development and Scholarship Fund. The authors would also like to thank Marjan Mernik for fruitful discussions and guidelines.
Funding AgencyGrant Number
Slovene Human Resources Development and Scholarship FundUNSPECIFIED
Subject Keywords:Teaching–learning-based optimization; Constrained optimization problems; Unconstrained optimization problems; Experimental replication
Record Number:CaltechAUTHORS:20120912-154406041
Persistent URL:
Official Citation:Matej Črepinšek, Shih-Hsi Liu, Luka Mernik, A note on teaching–learning-based optimization algorithm, Information Sciences, Volume 212, 1 December 2012, Pages 79-93, ISSN 0020-0255, 10.1016/j.ins.2012.05.009.
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:34045
Deposited By: Tony Diaz
Deposited On:12 Sep 2012 22:55
Last Modified:03 Oct 2019 04:15

Repository Staff Only: item control page