Multi Tier Cooperative Population Search for Continuous Black Box Optimization
Downloads
Abstract
Structured populations can combine local adaptation, information exchange and global resource allocation. We formulate Multi Tier Cooperative Population Search (MTCPS), which combines four proposal operators, per-deme recent-improvement credits, elite migration and a coordinator that retains elites and redistributes individuals. The revised specification preserves population size, distinguishes population cycles from objective calls and separates changing penalty scores from fixed-objective incumbents. The supplied main table gives MTCPS ten strict minima and two tied minima across twelve displayed cases. However, the aggregate case count, benchmark dimensions, rank sums, correction outputs and two source figures are inconsistent, so the report does not establish verified aggregate superiority. A conditional hitting proposition replaces the unsupported population-convergence argument; it requires explicit sublevel-set coverage and indefinitely continued trials. The contribution is an inspectable combination of population organization and operator allocation, with reported numerical observations preserved for reconstruction rather than certified as independently reproduced experiments.
Keywords
Structured population search Adaptive operator selection Elite migration Evaluation budgeting Conditional convergence Benchmark interpretationReferences (25)
- [1] Holland, J. H. (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. MIT Press. https://doi.org/10.7551/mitpress/1090.001.0001
- [2] 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
- [3] Kennedy, J., & Eberhart, R. (1995, November). Particle swarm optimization. Proceedings of ICNN'95-international conference on neural networks (pp. 1942-1948). IEEE. https://doi.org/10.1109/icnn.1995.488968
- [4] Hansen, N. (2006). The CMA Evolution Strategy: A Comparing Review. In Towards a New Evolutionary Computation (pp. 75–102). Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32494-1_4
- [5] Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46-61. https://doi.org/10.1016/j.advengsoft.2013.12.007
- [6] 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
- [7] Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & 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
- [8] Fialho, Á., Da Costa, L., Schoenauer, M., Sebag, M. (2010). Analyzing bandit-based adaptive operator selection mechanisms. Annals of mathematics and artificial intelligence, 60(1-2), 25–64. https://doi.org/10.1007/s10472-010-9213-y
- [9] Tanabe, R., & Fukunaga, A. (2013). Success-history based parameter adaptation for differential evolution. In 2013 IEEE congress on evolutionary computation (pp. 71-78). IEEE. https://doi.org/10.1109/cec.2013.6557555
- [10] Skolicki, Z., & De Jong, K. (2005, June). The influence of migration sizes and intervals on island models. In Proceedings of the 7th annual conference on Genetic and evolutionary computation (pp. 1295-1302). Association for Computing Machinery. https://doi.org/10.1145/1068009.1068219
- [11] Zhao, F., Ji, F., Xu, T., & Zhu, N. (2024). Hierarchical parallel search with automatic parameter configuration for particle swarm optimization. Applied Soft Computing, 151, 111126. https://doi.org/10.1016/j.asoc.2023.111126
- [12] Potter, M. A., & De Jong, K. A. (1994). A cooperative coevolutionary approach to function optimization. In International conference on parallel problem solving from nature (pp. 249-257). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-58484-6_269
- [13] Soto Calvo, M., & Lee, H. S. (2025). Systematic taxonomic framework of metaheuristic algorithms using hierarchical clustering and structural criteria: how novel is the novelty?. Artificial intelligence review, 59(2), 61. https://doi.org/10.1007/s10462-025-11456-8
- [14] Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003). Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary computation, 11(1), 1-18. https://doi.org/10.1162/106365603321828970
- [15] Brest, J., Maučec, M. S., & Bošković, B. (2017). Single objective real-parameter optimization: Algorithm jSO. In 2017 IEEE congress on evolutionary computation (CEC) (pp. 1311-1318). IEEE. https://doi.org/10.1109/cec.2017.7969456
- [16] Li, Y., Han, T., Zhou, H., Tang, S., & Zhao, H. (2022). A novel adaptive L-SHADE algorithm and its application in UAV swarm resource configuration problem. Information sciences, 606, 350-367. https://doi.org/10.1016/j.ins.2022.05.058
- [17] Bujok, P., & Kolenovsky, P. (2022). Eigen crossover in cooperative model of evolutionary algorithms applied to CEC 2022 single objective numerical optimisation. In 2022 IEEE congress on evolutionary computation (CEC) (pp. 1-8). IEEE. https://doi.org/10.1109/cec55065.2022.9870433
- [18] Kumar, A., Price, K. V., Mohamed, A. W., Hadi, A. A., & Suganthan, P. N. (2021). Problem definitions and evaluation criteria for the CEC 2022 special session and competition on single objective bound constrained numerical optimization. https://github.com/P-N-Suganthan/2022-SO-BO
- [19] 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
- [20] Mantegna, R. N. (1994). Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes. Physical review E, 49(5), 4677. https://doi.org/10.1103/physreve.49.4677
- [21] Morris, M. D. (1991). Factorial sampling plans for preliminary computational experiments. Technometrics, 33(2), 161–174. https://doi.org/10.1080/00401706.1991.10484804
- [22] 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
- [23] Vargha, A., Delaney, H. D. (2000). A critique and improvement of the CL common language effect size statistics of McGraw and Wong. Journal of educational and behavioral statistics, 25(2), 101–132. https://doi.org/10.3102/10769986025002101
- [24] Wu, G., Mallipeddi, R., & Suganthan, P. N. (2017). Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization. https://github.com/P-N-Suganthan/CEC2017-BoundContrained
- [25] Paleari, L., Movedi, E., Zoli, M., Burato, A., Cecconi, I., Errahouly, J., ... & Confalonieri, R. (2021). Sensitivity analysis using Morris: Just screening or an effective ranking method?. Ecological modelling, 455, 109648. https://doi.org/10.1016/j.ecolmodel.2021.109648
