Common Benchmark Functions for Metaheuristic Evaluation: A Review

Kashif Hussain - Universiti Tun Hussein Onn Malaysia, Johor, Malaysia
Mohd Najib Mohd Salleh - Universiti Tun Hussein Onn Malaysia, Johor, Malaysia
Shi Cheng - Shaanxi Normal University, Xi’an, China
Rashid Naseem - City University of Science and Information Technology, Peshawar, Pakistan

Citation Format:



In literature, benchmark test functions have been used for evaluating performance of metaheuristic algorithms. Algorithms that perform well on a set of numerical optimization problems are considered as effective methods for solving real-world problems. Different researchers choose different set of functions with varying configurations, as there exists no standard or universally agreed test-bed. This makes hard for researchers to select functions that can truly gauge the robustness of a metaheuristic algorithm which is being proposed. This review paper is an attempt to provide researchers with commonly used experimental settings, including selection of test functions with different modalities, dimensions, the number of experimental runs, and evaluation criteria. Hence, the proposed list of functions, based on existing literature, can be handily employed as an effective test-bed for evaluating either a new or modified variant of any existing metaheuristic algorithm. For embedding more complexity in the problems, these functions can be shifted or rotated for enhanced robustness.


benchmark test functions; numerical optimization; metaheuristic algorithms; optimization.

Full Text:



R. W. Garden and A. P. Engelbrecht, “Analysis and classification of optimisation benchmark functions and benchmark suites,†in Proc. IEEE CEC 2014, pp. 1641-1649.

M. Jamil and X. S. Yang, “A literature survey of benchmark functions for global optimisation problems,†International Journal of Mathematical Modelling and Numerical Optimisation., vol. 4, pp. 150-194, Jan. 2013.

S. Surjanovic and D. Bingham. (2013) Virtual library of simulation experiments: test functions and datasets. [Online]. Available: http://www. sfu. ca/~ ssurjano/optimization. html

A. Rehman. (2017) Global Optimization Test Problems. [Online].

(2017) IEEE Congress on Evolutionary Computation (CEC). [Online].Available:

Y. Shi, “Brain storm optimization algorithm,†in Proc. International Conference in Swarm Intelligence 2011, pp. 303-309.

D. Karaboga and B. Gorkemli, “A quick artificial bee colony-qABC-algorithm for optimization problems,†in Proc. International Symposium on Innovations in Intelligent Systems and Applications (INISTA) 2012, pp. 1-5.

D. Karaboga and B. Akay, “Artificial bee colony (ABC), harmony search and bees algorithms on numerical optimization,†in Proc. Innovative production machines and systems virtual conference 2009.

S. He, Q. H. Wu, and J. R. Saunders, “A novel group search optimizer inspired by animal behavioural ecology,†in Proc. IEEE Congress on Evolutionary Computation (CEC 2009)2009, pp. 272-1278.

O. S. Soliman and A. Rassem, “A bio inspired estimation of distribution algorithm for global optimization,†in Proc. International Conference on Neural Information Processing 2012, pp. 645-652.

R. Tang, S. Fong, X. S. Yang, and S. Deb, “Wolf search algorithm with ephemeral memory,†in Proc. IEEE Seventh International Conference on Digital Information Management (ICDIM) 2012, pp. 165-172.

X. S. Yang, “A new metaheuristic bat-inspired algorithm,†Nature inspired cooperative strategies for optimization (NICSO 2010), 2010.

X. S. Yang and S. Deb, “Cuckoo search via Lévy flights,†in Proc. IEEE World Congress on Nature & Biologically Inspired Computing (NaBIC) 2009, pp. 210-214.

J. A. Koupaei, M. M. S. Hosseini, and F. M. Ghaini, “A new optimization algorithm based on chaotic maps and golden section search method,†Engineering Applications of Artificial Intelligence, vol. 50, pp. 201-214, Apr. 2016.

R. Rahmani and R. Yusof, “A new simple, fast and efficient algorithm for global optimization over continuous search-space problems: Radial Movement Optimizationâ€, Applied Mathematics and Computation, vol. 248, pp. 287-300, Dec. 2014.

W. Li, L. Wang, Q. Yao, Q. Jiang, L. Yu, B. Wang, and X. Hei, “Cloud particles differential evolution algorithm: a novel optimization method for global numerical optimization,†Mathematical Problems in Engineering, Dec. 2015.

L. Wen, L. Gao, X. Li, and L. Zhang, “Free Pattern Search for global optimization,†Applied Soft Computing, vol. 13(9), pp. 3853-3863, Sep. 2013.

R. Q. Zhao and W. S. Tang, “Monkey algorithm for global numerical optimization,†Journal of Uncertain Systems, vol. 2(3), pp. 165-176, 2008.

M. A. Munoz, J. A. López, and E. Caicedo, “An artificial beehive algorithm for continuous optimization,†International Journal of Intelligent Systems, vol. 24(11), pp. 1080-1093, Nov. 2009.

X. Meng, Y. Liu, X. Gao, and H. Zhang, “A new bio-inspired algorithm: chicken swarm optimization,†in Proc. International Conference in Swarm Intelligence 2014, pp. 86-94.

L. Zhang, L. Liu, X. S. Yang, and Y. Dai, “A novel hybrid firefly algorithm for global optimization,†PloS One, vol. 11(9), Sep. 2016.

Y. J. Zheng, H. F. Ling, and J. Y. Xue, “Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations,†Computers & Operations Research, vol. 50, pp. 115-127, Oct. 2014.

A. H. Gandomi and A. H. Alavi, “Krill herd: a new bio-inspired optimization algorithm,†Communications in Nonlinear Science and Numerical Simulation, vol. 17(12), pp. 4831-4845, Dec. 2012.

L. Cui, G. Li, Z. Zhu, Q. Lin, Z. Wen, Z. Lu, … and J. Chen, “A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization,†Information Sciences, 2017.

W. L. Xiang, Y. Z. Li, X. L. Meng, C. M. Zhang, and M. Q. An, “A grey artificial bee colony algorithm,†Applied Soft Computing, Jun. 2017.

B. Doğan and T. Ömez, “A new metaheuristic for numerical function optimization: Vortex Search algorithm,†Information Sciences, vol. 293, pp. 125-145, Feb. 2015.