Abstract
Metaheuristic Search is a successful strategy for solving optimization problems, leading to over two hundred published metaheuristic algorithms. Consequently, there is an interest in understanding the similarities between metaheuristics. Previous studies have done theoretical analyses based on components and search strategies, providing insights into the relationship between different algorithms. In this paper, we argue that it is also important to consider the classes of optimization problems that the algorithms are capable of solving. To this end, we propose a method to measure the similarity between metaheuristics based on their performance on a set of optimization functions. We then use the proposed method to analyze the similarity between different algorithms as well as the similarity between the same algorithm but with different parameter settings. Our method can show if parameter settings of the same algorithm are more similar between themselves than to other algorithms and suggest a clustering based on the performance profile.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Code available at the following Github repository: https://github.com/jair-pereira/mhcmp/tree/bioma2022.
References
de Armas, J., Lalla-Ruiz, E., Tilahun, S.L., Voß, S.: Similarity in metaheuristics: a gentle step towards a comparison methodology. Natural Computing, pp. 1–23 (2021)
Campelo, F., Aranha, C.: EC Bestiary: A bestiary of evolutionary, swarm and other metaphor-based algorithms, June 2018. https://doi.org/10.5281/zenodo.1293352. https://doi.org/10.5281/zenodo.1293352
Chen, T., Wang, Y., Li, J.: Artificial tribe algorithm and its performance analysis. J. Softw. 7(3), 651–656 (2012)
Finck, S., Hansen, N., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2010: Presentation of the noisy functions. Tech. rep, Citeseer (2010)
Fleetwood, K.: An introduction to differential evolution. In: Proceedings of Mathematics and Statistics of Complex Systems (MASCOS) One Day Symposium, 26th November, Brisbane, Australia, pp. 785–791 (2004)
Hansen, N., et al.: COmparing Continuous Optimizers: numbbo/COCO on Github (2019)
Havens, T.C., Spain, C.J., Salmon, N.G., Keller, J.M.: Roach infestation optimization. In: 2008 IEEE Swarm Intelligence Symposium, pp. 1–7. IEEE (2008)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks. vol. 4, pp. 1942–1948. IEEE (1995)
Lones, M.A.: Metaheuristics in nature-inspired algorithms. In: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 1419–1422 (2014)
Lones, M.A.: Mitigating metaphors: a comprehensible guide to recent nature-inspired algorithms. SN Comput. Sci. 1(1), 1–12 (2020)
López-Ibáñez, M., Cáceres, L.P., Dubois-Lacoste, J., Stützle, T.G., Birattari, M.: The irace package: User guide. Institut de Recherches Interdisciplinaires et de Développements en \(\ldots \) IRIDIA (2016)
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: iterated racing for automatic algorithm configuration. Operations Res. Perspectives 3, 43–58 (2016)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987)
Sörensen, K.: Metaheuristics-the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3–18 (2015)
Van Laarhoven, P.J., Aarts, E.H.: Simulated annealing. In: Simulated annealing: Theory and applications, pp. 7–15. Springer (1987)
Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 169–178. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04944-6_14
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Pereira Junior, J., Aranha, C. (2022). Empirical Similarity Measure for Metaheuristics. In: Mernik, M., Eftimov, T., Črepinšek, M. (eds) Bioinspired Optimization Methods and Their Applications. BIOMA 2022. Lecture Notes in Computer Science, vol 13627. Springer, Cham. https://doi.org/10.1007/978-3-031-21094-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-21094-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21093-8
Online ISBN: 978-3-031-21094-5
eBook Packages: Computer ScienceComputer Science (R0)