Abstract
Generally speaking, it is not fully understood why and how metaheuristic algorithms work very well under what conditions. It is the intention of this paper to clarify the performance characteristics of some of popular algorithms depending on the fitness landscape of specific problems. This study shows the performance of each considered algorithm on the fitness landscapes with different problem characteristics. The conclusions made in this study can be served as guidance on selecting algorithms to the problem of interest.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barr, R., Golden, B., Kelly, J.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1(1), 9–32 (1995)
Merz, P.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. Evolutionary Computation, IEEE 4(4), 337–352 (2000)
Yuan, B., Gallagher, M.: On building a principled framework for evaluating and testing evolutionary algorithms: a continuous landscape generator. In: Proceedings of the 2003 Congress on Evolutionary Computation, pp. 451–458. IEEE, Canberra (2003)
Yuan, B., Gallagher, M.: Statistical racing techniques for improved empirical evaluation of evolutionary algorithms. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 172–181. Springer, Heidelberg (2004)
Gallagher, M., Yuan, B.: A General-purpose tunable landscape generator. IEEE Transactions on Evolutionary Computation (2006) (to appear)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)
Eskandar, H., Sadollah, A., Bahreininejad, A., Hamdi, M.: Water cycle algorithm–A novel metaheuristic optimization method for solving constrained engineering optimization problems. Computers & Structures 110, 151–166 (2012)
Golberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addion Wesley (1989)
Storn, R., Price, K.: Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)
Kim, J.H., Geem, Z.W., Kim, E.S.: Parameter estimation of the nonlinear Muskingum model using harmony search. Journal of the American Water Resources Association 37(5), 1131–1138 (2001)
Yang, X.S., Deb, S.: Cuckoo search via Lévy flights. In: World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 210–214. IEEE (2009)
Bäck, T.: Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford university press (1996)
Digalakis, J.G., Margaritis, K.G.: An experimental study of benchmarking functions for genetic algorithms. International Journal of Computer Mathematics 79(4), 403–416 (2002)
Im, S.S., Yoo, D.G., Kim, J.H.: Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems. Journal of Applied Mathematics (2013)
Milad, A.: Harmony search algorithm: strengths and weaknesses. Journal of Computer Engineering and Information Technology (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, J.H., Lee, H.M., Jung, D., Sadollah, A. (2016). Performance Measures of Metaheuristic Algorithms. In: Kim, J., Geem, Z. (eds) Harmony Search Algorithm. Advances in Intelligent Systems and Computing, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47926-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-47926-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47925-4
Online ISBN: 978-3-662-47926-1
eBook Packages: EngineeringEngineering (R0)