In typical optimization problems, the number of design variables may be large and their influence on the specific objective function can be complicated; the objective function may have some local optima while most chemical engineers are interested only in the global optimum. For any new optimization algorithms, it is essential to validate their performance, compare with other existing algorithms and check whether they provide the global optimum solutions, which can be done effectively by solving benchmark problems. In this work, seven typical optimization algorithms including the newly proposed TLBO (Teaching-learning-based optimization) based algorithms such as the TLSO (Teaching-learning-self-study optimization) algorithm have been reviewed and tested by using a set of 20 benchmark functions for unconstrained optimization problems to validate the performance and to assess these optimization algorithms. It was found that the TLSO algorithm shows the fastest convergence speed to the optimum and outperforms other algorithms for most test functions.

Optimization Teaching-learning-self-study Benchmark Function Teaching-learning-based Optimization Comparative Study

Goldberg DE, Genetic algorithms in search optimization and machine learning (Vol. 412), Reading Menlo Park Addison-Wesley (1989).
Storn R, Price K, J. Global Optimization, 11(4), 341 (1997)
Runarsson TP, Yao X, IEEE Transactions on Evolutionary Computation, 4(3), 284 (2000)
Farmer JD, Packard NH, Perelson AS, Physica D: Nonlinear Phenomena, 22(1), 187 (1986)
Passino KM, IEEE Control Systems, 22(3), 52 (2002)
Clerc M, Particle swarm optimization (Vol. 93), Wiley (2010).
Dorigo M, Birattari M, Stutzle T, IEEE Computational Intelligence, 1(4), 28 (2006)
Blum C, Physics of Life Reviews, 2(4), 353 (2005)
Karaboga D, An idea based on honey bee swarm for numerical optimization, Technical report-tr06, Erciyes University, Computer Engineering Department (2005).
Karaboga D, Basturk B, Applied Soft Computing, 8(1), 687 (2008)
Mirjalili S, Mirjalili SM, Hatamlou A, Neural Computing and Applications, 1 (2015).
Yazdani M, Jolai F, J. of Computational Design and Eng., 3(1), 24 (2016)
Rao RV, Savsani VJ, Vakharia DP, Computer-Aided Design, 43(3), 303 (2011)
Verma A, Agrawal S, Agrawal J, Sharma S, in Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics, Springer, India (2016).
Chen D, Zou F, Li Z, Wang J, Li S, Information Sciences, 297, 171 (2015)
Chen D, Lu R, Zou F, Li S, Neurocomputing, 173, 1096 (2016)
Satapathy SC, Naik A, Recent Patents on Computer Science, 6(1), 60 (2013)
Satapathy SC, Naik A, Parvathi K, SpringerPlus, 2(1), 130 (2013)
Brest J, Greiner S, Boskovic B, Mernik M, Zumer V, IEEE Transactions on Evolutionary Computation, 10(6), 646 (2006)
Patel N, Padhiyar N, J. Process Control, 26, 35 (2015)
Li G, Niu P, Zhang W, Liu Y, Chemometrics Intell. Lab. Syst., 126, 11 (2013)
Faisal A, Ph. D. Dissertation, Hanyang University (2016).
Whitley D, Statistics and Computing, 4(2), 65 (1994)
Afshar M, Gholami A, Asoodeh M, Korean J. Chem. Eng., 31(3), 496 (2014)
Rao R, Patel V, International J. Industrial Eng. Computations, 4(1), 29 (2013)
Zheng LG, Zhou H, Cen KF, Wang CL, Expert Systems with Applications, 36(2), 2780 (2009)
de Araujo Padilha CE, de Araujo NK, de Santana Souza DF, de Oliveira JA, de Macedo GR, dos Santos ES, Korean J. Chem. Eng., 33(9), 2650 (2016)
Sumathi S, Surekha P, Computational Intelligence Paradigms, CRC Press (2010).
Jamil M, Yang XS, International J. Mathematical Modelling and Numerical Optimization, 4(2), 150 (2013)
Friedman M, J. the American Statistical Association, 32, 674 (1937)
Friedman M, Annals of Mathematical Statistics, 11, 86 (1940)
Quade D, J. the American Statistical Association, 74, 680 (1979)
Derrac J, Garcia S, Molina D, Herrera F, Swarm and Evolutionary Computation, 1(1), 3 (2011)
Adidharma H, Temyanko V, Mathcad for chemical engineers, 2nd Ed., Trafford Publishing (2009).
Jaya RR, Int. J. Ind. Eng. Computations, 7(1), 19 (2016)