A Multi-Strategy Population-Based Optimizer for High-Dimensional Engineering Design Problems

Authors

  • G. T. Shakila Devi * Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences (SIMATS), Saveetha University, Chennai, Tamil Nadu, India.

https://doi.org/10.48313/maa.v1i3.103

Abstract

Metaheuristic optimization algorithms are indispensable tools for solving complex engineering design problems, yet most existing methods suffer from premature convergence and an inadequate exploration–exploitation balance when applied to high-dimensional search spaces. The curse of dimensionality causes exponential growth of the feasible region, rendering algorithms that perform well at 30–50 dimensions increasingly ineffective at 100 dimensions and beyond. This paper proposes the Multi-Strategy Population-based Optimizer (MSPO), a novel metaheuristic that addresses these challenges through three synergistic search strategies coordinated by an adaptive selection controller. Strategy 1 Lévy-Enhanced Global Exploration (LEGE) employs Lévy flight-driven position updates with adaptive, dimensionality-scaled step sizes to enable long-range exploration of multimodal landscapes. Strategy 2 Opposition-Based Directional Exploitation (OBDE) combines opposition-based learning with a multi-reference directional exploitation vector that targets a convex combination of the global best, local neighborhood best, and elite centroid, thereby avoiding single-attractor stagnation. Strategy 3 Stochastic Dimensional Crossover (SDC) performs dimension-wise recombination with adaptive Bernoulli masks driven by per-dimension population variance, preserving diversity in unconverged dimensions while accelerating convergence in settled ones. A dynamic strategy selection controller activates strategies based on real-time population diversity, fitness improvement rate, and individual stagnation indicators. Critical dimensionality-scaling mechanisms automatically adjust strategy parameters for problems ranging from 10 to 1000 dimensions. MSPO is comprehensively evaluated on the CEC 2017 benchmark suite (30D, 50D, 100D), the CEC 2022 suite (10D, 20D), extended high-dimensional tests (500D, 1000D), and eight constrained real-world engineering design problems against 12 state-of-the-art algorithms. MSPO achieves the top Friedman rank across all benchmark suites, with the performance advantage widening significantly at higher dimensions attaining 2–5 orders of magnitude better convergence accuracy than the best competitor at 500D and 1000D. On all eight engineering design problems, MSPO finds optimal or best-known feasible solutions with the lowest variance across independent runs.

Keywords:

Metaheuristic optimization, Multi-strategy optimizer, High-dimensional optimization, Engineering design, Exploration–exploitation balance, Population-based algorithm, Lévy flight, Opposition-based learning

References

  1. [1] Arora, J. S. (2004). Introduction to optimum design. Elsevier. https://www.researchgate.net/publication/273120102
  2. [2] Yang, X. S. (2010). Nature-inspired metaheuristic algorithms. Luniver Press. https://www.scirp.org/reference/referencespapers?referenceid=715424
  3. [3] 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
  4. [4] 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
  5. [5] 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
  6. [6] 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
  7. [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. [8] Faramarzi, A., Heidarinejad, M., Mirjalili, S., & Gandomi, A. H. (2020). Marine predators algorithm: A nature-inspired metaheuristic. Expert systems with applications, 152, 113377. https://doi.org/10.1016/j.eswa.2020.113377
  9. [9] Holland, J. H. (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. University Michigan Press, Ann Arbor, MI, USA. https://www.scirp.org/reference/referencespapers?referenceid=1919484
  10. [10] 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
  11. [11] Hansen, N. (2006). The CMA evolution strategy: A comparing review. Towards a new evolutionary computation: Advances in the estimation of distribution algorithms, 75–102. https://doi.org/10.1007/3-540-32494-1_4
  12. [12] Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al Qaness, M. A. A., & Gandomi, A. H. (2021). Aquila optimizer: A novel meta-heuristic optimization algorithm. Computers & industrial engineering, 157, 107250. https://doi.org/10.1016/j.cie.2021.107250
  13. [13] Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., & Gandomi, A. H. (2021). The arithmetic optimization algorithm. Computer methods in applied mechanics and engineering, 376, 113609. https://doi.org/10.1016/j.cma.2020.113609
  14. [14] Ahmadianfar, I., Heidari, A. A., Noshadian, S., Chen, H., & Gandomi, A. H. (2022). INFO: An efficient optimization algorithm based on weighted mean of vectors. Expert systems with applications, 195, 116516. https://doi.org/10.1016/j.eswa.2022.116516
  15. [15] Su, H., Zhao, D., Heidari, A. A., Liu, L., Zhang, X., Mafarja, M., & Chen, H. (2023). RIME: A physics-based optimization. Neurocomputing, 532, 183–214. https://doi.org/10.1016/j.neucom.2023.02.010
  16. [16] Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019). A survey on new generation metaheuristic algorithms. Computers & industrial engineering, 137, 106040. https://doi.org/10.1016/j.cie.2019.106040
  17. [17] Del Ser, J., Osaba, E., Molina, D., Yang, X. S., Salcedo Sanz, S., Camacho, D., & Herrera, F. (2019). Bio-inspired computation: Where we stand and what’s next. Swarm and evolutionary computation, 48, 220–250. https://doi.org/10.1016/j.swevo.2019.04.008
  18. [18] Bellman, R. E. (2015). Adaptive control processes: A guided tour. Princeton University Press. https://press.princeton.edu/books/hardcover/9780691652214
  19. [19] Omidvar, M. N., Li, X., Mei, Y., & Yao, X. (2013). Cooperative co-evolution with differential grouping for large scale optimization. IEEE transactions on evolutionary computation, 18(3), 378–393. https://doi.org/10.1109/TEVC.2013.2281543
  20. [20] Engelbrecht, A. (2012). Particle swarm optimization: Velocity initialization. 2012 IEEE congress on evolutionary computation (pp. 1–8). IEEE. https://doi.org/10.1109/CEC.2012.6256112
  21. [21] Faris, H., Aljarah, I., Al Betar, M. A., & Mirjalili, S. (2018). Grey wolf optimizer: A review of recent variants and applications. Neural computing and applications, 30(2), 413–435. https://doi.org/10.1007/s00521-017-3272-5
  22. [22] Chakraborty, S., Saha, A. K., Sharma, S., Mirjalili, S., & Chakraborty, R. (2021). A novel enhanced whale optimization algorithm for global optimization. Computers & industrial engineering, 153, 107086. https://doi.org/10.1016/j.cie.2020.107086
  23. [23] Das, S., & Suganthan, P. N. (2010). Differential evolution: A survey of the state-of-the-art. IEEE transactions on evolutionary computation, 15(1), 4–31. https://doi.org/10.1109/TEVC.2010.2059031
  24. [24] Črepinšek, M., Liu, S.-H., & Mernik, M. (2013). Exploration and exploitation in evolutionary algorithms: A survey. ACM computing surveys (CSUR), 45(3), 1–33. https://doi.org/10.1145/2480741.2480752
  25. [25] Gao, C., Li, T., Gao, Y., & Zhang, Z. (2024). A comprehensive multi-strategy enhanced biogeography-based optimization algorithm for high-dimensional optimization and engineering design problems. Mathematics, 12(3), 435. https://doi.org/10.3390/math12030435
  26. [26] Salgotra, R., Sharma, P., Kundu, K., Raju, S., & Gandomi, A. H. (2025). Enhancing differential evolution algorithm for CEC 2014, CEC 2017, CEC 2021, and CEC 2022 test suites. Neural computing and applications, 37(33), 27593–27630. https://doi.org/10.1007/s00521-025-11678-5
  27. [27] Han, T., Li, T., Liu, Q., Huang, Y., & Song, H. (2024). A multi-strategy improved honey badger algorithm for engineering design problems. Algorithms, 17(12), 573. https://doi.org/10.3390/a17120573
  28. [28] Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006). Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE transactions on evolutionary computation, 10(3), 281–295. https://doi.org/10.1109/TEVC.2005.857610
  29. [29] Gong, Y. J., Li, J. J., Zhou, Y., Li, Y., Chung, H. S. H., Shi, Y. H., & Zhang, J. (2015). Genetic learning particle swarm optimization. IEEE transactions on cybernetics, 46(10), 2277–2290. https://doi.org/10.1109/TCYB.2015.2475174
  30. [30] Cheng, R., & Jin, Y. (2015). A social learning particle swarm optimization algorithm for scalable optimization. Information sciences, 291, 43–60. https://doi.org/10.1016/j.ins.2014.08.039
  31. [31] Mirjalili, S. (2016). SCA: A sine cosine algorithm for solving optimization problems. Knowledge-based systems, 96, 120–133. https://doi.org/10.1016/j.knosys.2015.12.022
  32. [32] Deb, K., & Agrawal, R. B. (1995). Simulated binary crossover for continuous search space. Complex systems, 9(2), 115–148. https://www.researchgate.net/publication/2333106
  33. [33] Zhang, J., & Sanderson, A. C. (2009). JADE: Adaptive differential evolution with optional external archive. IEEE transactions on evolutionary computation, 13(5), 945–958. https://doi.org/10.1109/TEVC.2009.2014613
  34. [34] 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
  35. [35] Tanabe, R., & Fukunaga, A. S. (2014). Improving the search performance of shade using linear population size reduction. 2014 IEEE congress on evolutionary computation (CEC) (pp. 1658–1665). IEEE. https://doi.org/10.1109/CEC.2014.6900380
  36. [36] Stanovov, V., Akhmedova, S., & Semenkin, E. (2022). NL-SHADE-LBC algorithm with linear parameter adaptation bias change for CEC 2022 numerical optimization. 2022 IEEE congress on evolutionary computation (CEC) (pp. 1–8). IEEE. https://doi.org/10.1109/CEC55065.2022.9870295
  37. [37] Akimoto, Y., Nagata, Y., Ono, I., & Kobayashi, S. (2012). Theoretical foundation for CMA-ES from information geometry perspective. Algorithmica, 64(4), 698–716. https://doi.org/10.1007/s00453-011-9564-8
  38. [38] Zhang, Q., Gao, H., Zhan, Z. H., Li, J., & Zhang, H. (2023). Growth optimizer: A powerful metaheuristic algorithm for solving continuous and discrete global optimization problems. Knowledge-based systems, 261, 110206. https://doi.org/10.1016/j.knosys.2022.110206
  39. [39] Deng, L., & Liu, S. (2023). Snow ablation optimizer: A novel metaheuristic technique for numerical optimization and engineering design. Expert systems with applications, (225). https://doi.org/10.1016/j.eswa.2023.120069
  40. [40] Lian, J., Hui, G., Ma, L., Zhu, T., Wu, X., Heidari, A. A., & Chen, H. (2024). Parrot optimizer: Algorithm and applications to medical problems. Computers in biology and medicine, 172, 108064. https://doi.org/10.1016/j.compbiomed.2024.108064
  41. [41] Wolpert, D. H., & Macready, W. G. (2002). No free lunch theorems for optimization. IEEE transactions on evolutionary computation, 1(1), 67–82. https://doi.org/10.1109/4235.585893
  42. [42] DaCosta, L., Fialho, A., Schoenauer, M., & Sebag, M. (2008). Adaptive operator selection with dynamic multi-armed bandits. Proceedings of the 10th annual conference on genetic and evolutionary computation (pp. 913–920). ACM. https://doi.org/10.1145/1389095.1389272
  43. [43] Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011). Differential evolution algorithm with ensemble of parameters and mutation strategies. Applied soft computing, 11(2), 1679–1696. https://doi.org/10.1016/j.asoc.2010.04.024
  44. [44] Brest, J., Greiner, S., Boskovic, B., Mernik, M., & Zumer, V. (2006). Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE transactions on evolutionary computation, 10(6), 646–657. https://doi.org/10.1109/TEVC.2006.872133
  45. [45] Qin, A. K., Huang, V. L., & Suganthan, P. N. (2008). Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE transactions on evolutionary computation, 13(2), 398–417. https://doi.org/10.1109/TEVC.2008.927706
  46. [46] Li, X., Engelbrecht, A., & Epitropakis, M. G. (2013). Benchmark functions for the CEC’2008 special session and competition on large scale global optimization. https://www.epitropakis.co.uk/content/benchmark-functions-cec2013-special-session-and-competition-niching-methods-multimodal
  47. [47] Potter, M. A., & De Jong, K. A. (1994). A cooperative coevolutionary approach to function optimization. International conference on parallel problem solving from nature (pp. 249–257). Springer. https://doi.org/10.1007/3-540-58484-6_269
  48. [48] Yang, Z., Tang, K., & Yao, X. (2008). Large scale evolutionary optimization using cooperative coevolution. Information sciences, 178(15), 2985–2999. https://doi.org/10.1016/j.ins.2008.02.017
  49. [49] Sun, Y., Kirley, M., & Halgamuge, S. K. (2017). A recursive decomposition method for large scale continuous optimization. IEEE transactions on evolutionary computation, 22(5), 647–661. https://doi.org/10.1109/TEVC.2017.2778089
  50. [50] Brest, J., Maučec, M. S., & Bošković, B. (2021). Self-adaptive differential evolution algorithm with population size reduction for single objective bound-constrained optimization: Algorithm j21. 2021 IEEE congress on evolutionary computation (CEC) (pp. 817–824). IEEE. https://doi.org/10.1109/CEC45853.2021.9504782
  51. [51] Cheng, R., & Jin, Y. (2014). A competitive swarm optimizer for large scale optimization. IEEE transactions on cybernetics, 45(2), 191–204. https://doi.org/10.1109/TCYB.2014.2322602
  52. [52] Ragsdell, K. M., & Phillips, D. T. (1976). Optimal design of a class of welded structures using geometric programming. Journal of manufacturing science and engineering, 98(3), 1021–1025. https://doi.org/10.1115/1.3438995
  53. [53] Kannan, B. K., & Kramer, S. N. (1994). An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. Journal of mechanical design, 116(2), 405–411. https://doi.org/10.1115/1.2919393
  54. [54] Belegundu, A. D. (1982). A study of mathematical programming methods for structural optimization [Thesis]. https://www.me.psu.edu/department/directory-detail-g.aspx?q=ADB3
  55. [55] Golinski, J. (1973). An adaptive optimization system applied to machine synthesis. Mechanism and machine theory, 8(4), 419–436. https://doi.org/10.1016/0094-114X(73)90018-9
  56. [56] Nowacki, H. (1973). Optimization in pre-contract ship design. North-Holland / Elsevier. https://trid.trb.org/View/14541
  57. [57] Fleury, C. (1979). Structural weight optimization by dual methods of convex programming. International journal for numerical methods in engineering, 14(12), 1761–1783. https://doi.org/10.1002/nme.1620141203
  58. [58] Sandgren, E. (1988). Nonlinear integer and discrete programming in mechanical design. International design engineering technical conferences and computers and information in engineering conference (Vol. 26584, pp. 95–105). American Society of Mechanical Engineers (ASME). https://doi.org/10.1115/1.2912596
  59. [59] Gupta, S., Tiwari, R., & Nair, S. B. (2007). Multi-objective design optimisation of rolling bearings using genetic algorithms. Mechanism and machine theory, 42(10), 1418–1443. https://doi.org/10.1016/j.mechmachtheory.2006.10.002
  60. [60] Coello, C. A. C. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer methods in applied mechanics and engineering, 191(11–12), 1245–1287. https://doi.org/10.1016/S0045-7825(01)00323-1
  61. [61] Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer methods in applied mechanics and engineering, 186(2–4), 311–338. https://doi.org/10.1016/S0045-7825(99)00389-8
  62. [62] Takahama, T., & Sakai, S. (2010). Constrained optimization by the $varepsilon$ constrained differential evolution with an archive and gradient-based mutation. IEEE congress on evolutionary computation (pp. 1–9). IEEE. https://doi.org/10.1109/CEC.2010.5586545
  63. [63] Runarsson, T. P., & Yao, X. (2000). Stochastic ranking for constrained evolutionary optimization. IEEE transactions on evolutionary computation, 4(3), 284–294. https://doi.org/10.1109/4235.873238
  64. [64] Kumar, A., Das, S., & Zelinka, I. (2020). A self-adaptive spherical search algorithm for real-world constrained optimization problems. Proceedings of the 2020 genetic and evolutionary computation conference companion (pp. 13–14). ACM. https://doi.org/10.1145/3377929.3398186
  65. [65] Kazimipour, B., Li, X., & Qin, A. K. (2014). A review of population initialization techniques for evolutionary algorithms. 2014 IEEE congress on evolutionary computation (CEC) (pp. 2585–2592). IEEE. https://doi.org/10.1109/CEC.2014.6900618
  66. [66] Tavazoei, M. S., & Haeri, M. (2007). Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Applied mathematics and computation, 187(2), 1076–1085. https://doi.org/10.1016/j.amc.2006.09.087
  67. [67] Yang, X. S., & Deb, S. (2010). Engineering optimisation by cuckoo search. International journal of mathematical modelling and numerical optimisation, 1(4), 330–343. https://doi.org/10.1504/IJMMNO.2010.03543
  68. [68] 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
  69. [69] Tizhoosh, H. R. (2005). Opposition-based learning: A new scheme for machine intelligence. International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (cimca-iawtic’06) (Vol. 1, pp. 695–701). IEEE. https://doi.org/10.1109/CIMCA.2005.1631345
  70. [70] Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2008). Opposition-based differential evolution. IEEE transactions on evolutionary computation, 12(1), 64–79. https://doi.org/10.1109/TEVC.2007.894200
  71. [71] Awad, N. H., Ali, M. Z., & Suganthan, P. N. (2017). Ensemble sinusoidal differential covariance matrix adaptation with euclidean neighborhood for solving cec2017 benchmark problems. 2017 IEEE congress on evolutionary computation (CEC) (pp. 372–379). IEEE. https://doi.org/10.1109/CEC.2017.7969336
  72. [72] Kumar, A., Price, K. V, Mohamed, A. W., Hadi, A. A., & Suganthan, P. N. (2022). Problem definitions and evaluation criteria for the CEC 2022 special session on single objective bound constrained numerical optimization. https://github.com/P-N-Suganthan/2022-SO-BO/blob/main/CEC2022 TR.pdf
  73. [73] Derrac, J., Garcia, 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

Published

2024-09-21

Issue

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

Section

Articles

How to Cite

Devi, G. T. S. . (2024). A Multi-Strategy Population-Based Optimizer for High-Dimensional Engineering Design Problems. Metaheuristic Algorithms With Applications, 1(3), 316-341. https://doi.org/10.48313/maa.v1i3.103