Main Article Content
Multidimensional scalable test functions are very important in testing the capabilities of new optimization methods, especially in evaluating their response to the increase of the search space dimension. As a continuation of a previous published paper, new sets of test functions for continuous optimization are proposed, both unconstrained (or only box constrained, 7 new test functions) and constrained (10 new test functions).
Hock W, Schittkowski K. Test examples for nonlinear programming codes. Springer-Verlag Berlin Heidelberg, Berlin; 1981.
Schittkowski K. More test examples for nonlinear programming codes. Springer-Verlag Berlin Heidelberg, Berlin; 1987.
Momin J, Xin-She Yang. A literature survey of benchmark functions for global optimization problems. Int. Journal of Mathematical Modelling and Numerical Optimisation. 2013;4:150-194.
Molga M, Smutnicki C. Test functions for optimization needs. 2005;1-43.
(Last time accessed in November, 2019)
Anescu G. Scalable test functions for multidimensional continuous optimization. U.P.B. Sci.Bull., Series C. 2017;79(4):27-42.
Glvez J, Cuevas E, Hinojosa S, Avalos O, Prez-Cisnerosa M. A reactive model based on neighborhood consensus for continuous optimization. Expert Systems with Applications. 2019;121:115-141.
Cuevas E, Glvez J. An optimization algorithm guided by a machine learning approach. International Journal of Machine Learning and Cybernetics. 2019;10:129.
Cuevas E, Glvez J, Avalos O. Knowledge-based optimization algorithm. In Book: Recent Metaheuristics Algorithms for Parameter Identification, Springer International Publishing;2020.
Cuevas E, Glvez J, Avalos O. Neighborhood based optimization algorithm. In Book: Recent Metaheuristics Algorithms for Parameter Identification, Springer International Publishing;2020.
Pint er JD. Global optimization: Software, test problems, and applications. Ch. 15 in Handbook of Global Optimization, (Ed. P. M. Pardalos and H. F. Romeijn), Kluwer Academic Publishers, Dordrecht, Boston, London. 2002;2:515-569.
Anescu G, Prisecaru I. NSC-PSO, a novel PSO variant without speeds and coefficients. In: Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania: September 2124. 2015;460-467.
Anescu G. Gradual and cumulative improvements to the classical differential evolution scheme through experiments. Annals of West University of Timisoara - Mathematics and Computer Science. 2016;54(2):13-36.
Anescu G. A fast artificial bee colony algorithm variant for continuous global optimization problems. U.P.B. Sci. Bull., Series C. 2017;79(1):83-98.
Anescu G. A heuristic fast gradient descent method for unimodal optimization. Journal of
Advances in Mathematics and Computer Science. 2018;26(5):1-20.