Forest Growth Optimization: An Ecological-Succession-Inspired Metaheuristic with Pioneer-Intermediate-Climax Stage Progression

Authors

https://doi.org/10.48313/maa.vi.79

Abstract

This paper proposes Forest Growth Optimization (FGO), a novel nature-inspired metaheuristic algorithm for solving continuous global optimization problems. The algorithm is inspired by Forest ecological succession: Pioneer species colonization, canopy closure, climax community emergence, and it incorporates Multi-stage succession (pioneer -> intermediate -> climax), gap dynamics, seed dispersal as its core search mechanism. Unlike existing metaheuristics that rely on a single update rule applied uniformly across the population, FGO introduces a set of named operators that collectively capture the multi-phase dynamics of its biological inspiration. Each operator is formalized as a mathematically defined update rule, and the interaction between operators is controlled by adaptive parameters that respond to the local geometry of the search landscape. The proposed algorithm is evaluated on the CEC 2017 benchmark suite (29 test functions) and the CEC 2020 benchmark suite (10 test functions), and its performance is compared against 11 state-of-the-art metaheuristic algorithms: PSO, GA, DE, GWO, WOA, ABC, BBO, FA, CS, FPA, GSA. The experimental results demonstrate that FGO achieves the best mean fitness on 24 out of 29 CEC 2017 functions and on 8 out of 10 CEC 2020 functions. The Friedman test ranks FGO first with an average rank of 1.34, and the Wilcoxon rank-sum test confirms that the improvements are statistically significant at p < 0.05 on at least 22 of the 29 CEC 2017 functions. An ablation study quantifies the contribution of each operator to the algorithm's overall performance, with the most critical operator producing a degradation of up to 27.3% when removed. The algorithm is further validated on two classical engineering design problems (welded beam design and pressure vessel design), on which it obtains solutions competitive with the best known optima. A Sobol sensitivity analysis confirms that the algorithm's parameters are well-balanced, with no single parameter dominating the algorithm's behavior. A scalability analysis on problem dimensions D = 10, 50, 100, 500, and 1000 demonstrates near-linear scaling of wall-clock time with the problem dimension. The results collectively demonstrate that FGO is a competitive metaheuristic for continuous global optimization, with broad applicability to engineering design, Machine Learning (ML) hyperparameter tuning, and scientific computing.

Keywords:

Metaheuristic optimization, Forest growth optimization, Forest ecological succession: Pioneer species colonization, canopy closure, climax community emergence, Global optimization, CEC 2017 benchmark, Engineering design

References

  1. [1] 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 [Technical report]. IEEE Congress on Evolutionary Computation, Centro Congressi Padova, Italy. file:///C:/Users/Admin/Downloads/CEC2022 TR (1).pdf
  2. [2] Yang, X. S. (2009). Firefly algorithms for multimodal optimization. International Symposium on Stochastic Algorithms (pp. 169-178). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-04944-6_14
  3. [3] Yang, X. S. (2010). A new metaheuristic bat-inspired algorithm. Nature Inspired Cooperative Strategies for Optimization (NICSO) (pp. 65–74). Springer. https://doi.org/10.1007/978-3-642-12538-6_6
  4. [4] 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
  5. [5] Zhang, Q., & Li, H. (2007). MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation, 11(6), 712–731. https://doi.org/10.1109/TEVC.2007.892759
  6. [6] Sobol, I. M. (2001). Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates. Mathematics and Computers in Simulation, 55(1–3), 271–280. https://doi.org/10.1016/S0378-4754(00)00270-6
  7. [7] Passino, K. M. (2002). Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Systems Magazine, 22(3), 52–67. https://doi.org/10.1109/MCS.2002.1004010
  8. [8] Rashedi, E., Nezamabadi-Pour, H., & Saryazdi, S. (2009). GSA: A gravitational search algorithm. Information Sciences, 179(13), 2232–2248. https://doi.org/10.1016/j.ins.2009.03.004
  9. [9] 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
  10. [10] 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
  11. [11] Daliri, A., Asghari, A., Azgomi, H., & Alimoradi, M. (2022). The water optimization algorithm: A novel metaheuristic for solving optimization problems. Applied Intelligence, 52(15), 17990–18029. https://doi.org/10.1007/s10489-022-03397-4
  12. [12] Yang, X. S., & Deb, S. (2009). Cuckoo search via Lévy flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) (pp. 210-214). IEEE. https://doi.org/10.1109/NABIC.2009.5393690
  13. [13] Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82. https://doi.org/10.1109/4235.585893
  14. [14] Grimaccia, F., Mussetta, M., Niccolai, A., & Zich, R. E. (2018). Comparison of binary evolutionary algorithms for optimization of thinned array antennas. 2018 IEEE Congress on Evolutionary Computation (CEC) (pp. 1-8). IEEE. https://doi.org/10.1109/CEC.2018.8477897
  15. [15] Mirjalili, S. (2015). The ant lion optimizer. Advances in Engineering Software, 83, 80–98. https://doi.org/10.1016/j.advengsoft.2015.01.010
  16. [16] Simon, D. (2008). Biogeography-based optimization. IEEE Transactions on Evolutionary Computation, 12(6), 702–713. https://doi.org/10.1109/TEVC.2008.919004
  17. [17] Gong, W., Cai, Z., & Ling, C. X. (2010). DE/BBO: A hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Computing, 15(4), 645–665. https://doi.org/10.1007/s00500-010-0591-1
  18. [18] Silva, A., Neves, A., & Costa, E. (2002). An empirical comparison of particle swarm and predator prey optimisation. Irish Conference on Artificial Intelligence and Cognitive Science (pp. 103-110). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45750-X_13
  19. [19] Mehrabian, A. R., & Lucas, C. (2006). A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics, 1(4), 355–366. https://doi.org/10.1016/j.ecoinf.2006.07.003
  20. [20] Ghaemi, M., & Feizi-Derakhshi, M. R. (2014). Forest optimization algorithm. Expert Systems with Applications, 41(15), 6676–6687. https://doi.org/10.1016/j.eswa.2014.05.009
  21. [21] Yang, X. S. (2012). Flower pollination algorithm for global optimization. International Conference on Unconventional Computing and Natural Computation (pp. 240-249). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_27
  22. [22] Alatas, B. (2011). Photosynthetic algorithm approaches for bioinformatics. Expert Systems with Applications, 38(8), 10541–10546. https://doi.org/10.1016/j.eswa.2011.02.102
  23. [23] Merrikh-Bayat, F. (2015). The runner-root algorithm: A metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Applied Soft Computing, 33, 292–303. https://doi.org/10.1016/j.asoc.2015.04.048
  24. [24] Cowles, H. C. (1899). The ecological relations of the vegetation on the sand dunes of Lake Michigan. Part I.-Geographical relations of the dune Floras. Botanical Gazette, 27(2), 95–117. https://doi.org/10.1086/327796

Downloads

Published

2026-03-02

Issue

Vol. 3 No. 1 (2026): Metaheuristic Algorithms with Applications (MAA)

Section

Articles

How to Cite

Mishra, P. ., & Kefas, H. M. . (2026). Forest Growth Optimization: An Ecological-Succession-Inspired Metaheuristic with Pioneer-Intermediate-Climax Stage Progression. Metaheuristic Algorithms With Applications, 3(1), 33-60. https://doi.org/10.48313/maa.vi.79

Similar Articles

1-10 of 69

You may also start an advanced similarity search for this article.