A note on teaching-learning-based optimization algorithm

作者：Crepinsek Matej^*; Liu Shih Hsi; Mernik Luka

来源：Information Sciences, 2012, 212: 79-93.

DOI：10.1016/j.ins.2012.05.009

• Teaching-learning-based optimization
• Constrained optimization problems
• Unconstrained optimization problems
• Experimental replication

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%26apos;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%26apos; 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.

• 出版日期2012-12-1