Transparency in Population-Based Search: A Methodological Review of Interpretable Search Components
Downloads
Abstract
This methodological review examines how population-based search mechanisms can be made interpretable through explicit state variables, proposal rules, operator credits and evaluation criteria. Representative evolutionary and swarm methods provide the literature context. A reported adaptive-search sketch is analyzed without treating its placeholder label as an implemented new optimizer or a bilevel solver. Its equations distinguish operator-selection entropy from population diversity, bounded penalty schedules from feasibility guarantees, and conditional coverage from global convergence claims. A frozen-attractor example shows why an inertia coefficient below one alone does not establish particle-swarm stability. Supplied numerical tables and figures are retained as reported illustrations, with unresolved campaign identity, inconsistent rank summaries and absent run-level evidence made explicit. No systematic-search protocol is supplied, and exhaustive literature coverage, new experiments, significance, robustness and scalability are not established. The contribution is a focused methodological account of the information needed to connect a search component to a reproducible explanation of optimization performance.
Keywords
Population-based search Methodological review Interpretable mechanisms Adaptive operator selection Evidence quality ReproducibilityReferences (15)
- [1] Tanabe, R., & Fukunaga, A. (2013). Success-history based parameter adaptation for differential evolution. 2013 IEEE congress on evolutionary computation (pp. 71-78). IEEE. https://doi.org/10.1109/CEC.2013.6557555
- [2] Hansen, N. (2006). The CMA evolution strategy: A comparing review. In Towards a new evolutionary computation: Advances in the estimation of distribution algorithms (Studies in Fuzziness and Soft Computing, Vol. 192, pp. 75–102). Springer. https://doi.org/10.1007/3-540-32494-1_4
- [3] Holland, J. H. (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press. https://doi.org/10.7551/mitpress/1090.001.0001
- [4] Storn, R., & Price, K. (1997). Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4), 341–359. https://doi.org/10.1023/A:1008202821328
- [5] Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95-international conference on neural networks (Vol. 4, pp. 1942-1948). IEEE. https://doi.org/10.1109/ICNN.1995.488968
- [6] Mirjalili, S., Mirjalili, S. M., and Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007.
- [7] Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in engineering software, 95, 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008
- [8] Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., & Mirjalili, S. M. (2017). Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Advances in engineering software, 114, 163–191. https://doi.org/10.1016/j.advengsoft.2017.07.002
- [9] Stanimirović, P. S., Ivanov, B., Stanujkić, D., Katsikis, V. N., Mourtas, S. D., Kazakovtsev, L. A., and Edalatpanah, S. A. (2023). Improvement of unconstrained optimization methods based on symmetry involved in neutrosophy. Symmetry, 15(1), 250. https://doi.org/10.3390/sym15010250
- [10] Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., and Chen, H. (2019). Harris hawks optimization: Algorithm and applications. Future generation computer systems, 97, 849–872. https://doi.org/10.1016/j.future.2019.02.028.
- [11] Friedman, M. (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American statistical association, 32(200), 675–701. https://doi.org/10.2307/2279372
- [12] Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of machine learning research, 7, 1–30. https://doi.org/10.5555/1248547.1248548
- [13] Derrac, J., García, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and evolutionary computation, 1(1), 3-18. https://doi.org/10.1016/j.swevo.2011.02.002
- [14] Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80–83. https://doi.org/10.2307/3001968
- [15] Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandinavian journal of statistics, 6(2), 65–70. https://doi.org/10.2307/4615733
Article Metrics
- Published 2026-09-28
- Issue Vol. 3 No. 3 (2026): Optimality
- Section Articles
- Document Type Research Article
- Views 0
- Downloads 0
License
Copyright (c) 2026 Optimality
This work is licensed under a Creative Commons Attribution 4.0 International License.