A note on teaching-learning-based optimization algorithm

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.

[1]  Angel Eduardo Muñoz Zavala,et al.  Constrained optimization via particle evolutionary swarm optimization algorithm (PESO) , 2005, GECCO '05.

[2]  Ling Wang,et al.  An effective co-evolutionary differential evolution for constrained optimization , 2007, Appl. Math. Comput..

[3]  Ali Ahrari,et al.  Grenade Explosion Method - A novel tool for optimization of multimodal functions , 2010, Appl. Soft Comput..

[4]  Zbigniew Michalewicz,et al.  Parameter control in evolutionary algorithms , 1999, IEEE Trans. Evol. Comput..

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Daniel J. Woods,et al.  Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm , 1985 .

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[8]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[9]  R. Venkata Rao,et al.  Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems , 2012, Inf. Sci..

[10]  Marjan Mernik,et al.  To explore or to exploit: An entropy-driven approach for evolutionary algorithms , 2009, Int. J. Knowl. Based Intell. Eng. Syst..

[11]  Faizan Javed,et al.  A memetic grammar inference algorithm for language learning , 2012, Appl. Soft Comput..

[12]  Giovanni Iacca,et al.  Ockham's Razor in memetic computing: Three stage optimal memetic exploration , 2012, Inf. Sci..

[13]  Jing J. Liang,et al.  Niching particle swarm optimization with local search for multi-modal optimization , 2012, Inf. Sci..

[14]  Domen Mongus,et al.  A hybrid evolutionary algorithm for tuning a cloth-simulation model , 2012, Appl. Soft Comput..

[15]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[16]  Elena Marchiori,et al.  Evolutionary Algorithms with On-the-Fly Population Size Adjustment , 2004, PPSN.

[17]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[18]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[19]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[20]  Yangguang Liu,et al.  GRAPH CLASSIFICATION USING COMPLEMENT INFORMATION , 2009 .

[21]  Iztok Fister,et al.  A hybrid self-adaptive evolutionary algorithm for marker optimization in the clothing industry , 2010, Appl. Soft Comput..

[22]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[23]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[24]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[25]  Peter Merz,et al.  Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.

[26]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[27]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[28]  Fernando G. Lobo,et al.  A parameter-less genetic algorithm , 1999, GECCO.

[29]  Ali Wagdy Mohamed,et al.  Constrained optimization based on modified differential evolution algorithm , 2012, Inf. Sci..

[30]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[31]  Marjan Mernik,et al.  Analysis of exploration and exploitation in evolutionary algorithms by ancestry trees , 2011 .

[32]  Qingfu Zhang,et al.  Enhancing the search ability of differential evolution through orthogonal crossover , 2012, Inf. Sci..

[33]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

[34]  Shu-Kai S. Fan,et al.  A hybrid simplex search and particle swarm optimization for unconstrained optimization , 2007, Eur. J. Oper. Res..

[35]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[36]  Leo Liberti,et al.  Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem , 2009, GECCO.

[37]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[38]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[39]  C. Coello,et al.  Cultured differential evolution for constrained optimization , 2006 .

[40]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[41]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[42]  Hamed Shah-Hosseini,et al.  The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm , 2009, Int. J. Bio Inspired Comput..

[43]  Thomas Bäck,et al.  An Empirical Study on GAs "Without Parameters" , 2000, PPSN.