{"title":"猴痘优化器:TinyML生物启发的进化优化算法及其工程应用","authors":"Marwa F. Mohamed , Ahmed Hamed","doi":"10.1016/j.iswa.2025.200557","DOIUrl":null,"url":null,"abstract":"<div><div>High-dimensional optimization remains a key challenge in computational intelligence, especially under resource constraints. Evolutionary algorithms, which mimic the change in heritable characteristics of biological populations, have been proposed to address this. These algorithms apply selection pressure to favor better solutions over generations, and stochastic variations may occasionally introduce suboptimal candidates to preserve population diversity. However, they often struggle to balance exploration and exploitation, leading to suboptimal solutions, premature convergence, and significant computational demands, making them unsuitable for resource-constrained environments. This paper introduces Monkeypox Optimization (MO), a novel evolutionary algorithm inspired by the infection and replication lifecycle of the monkeypox virus. MO mimics the virus’s rapid spread by employing virus-to-cell infection, where the virus persistently seeks out vulnerable cells to penetrate—representing global exploration of the search space. Once inside, cell-to-cell transmission enables fast local propagation, modeling the refinement of high-potential solutions through accelerated replication. To conserve resources, MO continuously deletes the least effective virion copies, maintaining a compact and memory-efficient population. This biologically grounded design not only accelerates convergence but also aligns MO with TinyML principles, making it ideally suited for low-power, resource-constrained IoT environments. MO is benchmarked against 21 recent algorithms across 90 functions from CEC-2017, CEC-2019, and CEC-2020, and validated on three engineering design problems. Results show MO achieves up to 13% lower energy consumption and 34% shorter execution time compared to state-of-the-art competitors, while maintaining robust accuracy. A theoretical analysis reveals MO’s time complexity is <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>m</mi><mi>n</mi><mo>+</mo><mi>R</mi><mi>T</mi><mi>n</mi><mo>)</mo></mrow></mrow></math></span>, confirming its scalability. Statistical validation via Friedman and Fisher tests further supports MO’s performance gains.</div></div>","PeriodicalId":100684,"journal":{"name":"Intelligent Systems with Applications","volume":"27 ","pages":"Article 200557"},"PeriodicalIF":4.3000,"publicationDate":"2025-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Monkeypox optimizer: A TinyML bio-inspired evolutionary optimization algorithm and its engineering applications\",\"authors\":\"Marwa F. Mohamed , Ahmed Hamed\",\"doi\":\"10.1016/j.iswa.2025.200557\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>High-dimensional optimization remains a key challenge in computational intelligence, especially under resource constraints. Evolutionary algorithms, which mimic the change in heritable characteristics of biological populations, have been proposed to address this. These algorithms apply selection pressure to favor better solutions over generations, and stochastic variations may occasionally introduce suboptimal candidates to preserve population diversity. However, they often struggle to balance exploration and exploitation, leading to suboptimal solutions, premature convergence, and significant computational demands, making them unsuitable for resource-constrained environments. This paper introduces Monkeypox Optimization (MO), a novel evolutionary algorithm inspired by the infection and replication lifecycle of the monkeypox virus. MO mimics the virus’s rapid spread by employing virus-to-cell infection, where the virus persistently seeks out vulnerable cells to penetrate—representing global exploration of the search space. Once inside, cell-to-cell transmission enables fast local propagation, modeling the refinement of high-potential solutions through accelerated replication. To conserve resources, MO continuously deletes the least effective virion copies, maintaining a compact and memory-efficient population. This biologically grounded design not only accelerates convergence but also aligns MO with TinyML principles, making it ideally suited for low-power, resource-constrained IoT environments. MO is benchmarked against 21 recent algorithms across 90 functions from CEC-2017, CEC-2019, and CEC-2020, and validated on three engineering design problems. Results show MO achieves up to 13% lower energy consumption and 34% shorter execution time compared to state-of-the-art competitors, while maintaining robust accuracy. A theoretical analysis reveals MO’s time complexity is <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>m</mi><mi>n</mi><mo>+</mo><mi>R</mi><mi>T</mi><mi>n</mi><mo>)</mo></mrow></mrow></math></span>, confirming its scalability. Statistical validation via Friedman and Fisher tests further supports MO’s performance gains.</div></div>\",\"PeriodicalId\":100684,\"journal\":{\"name\":\"Intelligent Systems with Applications\",\"volume\":\"27 \",\"pages\":\"Article 200557\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Intelligent Systems with Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2667305325000833\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Intelligent Systems with Applications","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667305325000833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Monkeypox optimizer: A TinyML bio-inspired evolutionary optimization algorithm and its engineering applications
High-dimensional optimization remains a key challenge in computational intelligence, especially under resource constraints. Evolutionary algorithms, which mimic the change in heritable characteristics of biological populations, have been proposed to address this. These algorithms apply selection pressure to favor better solutions over generations, and stochastic variations may occasionally introduce suboptimal candidates to preserve population diversity. However, they often struggle to balance exploration and exploitation, leading to suboptimal solutions, premature convergence, and significant computational demands, making them unsuitable for resource-constrained environments. This paper introduces Monkeypox Optimization (MO), a novel evolutionary algorithm inspired by the infection and replication lifecycle of the monkeypox virus. MO mimics the virus’s rapid spread by employing virus-to-cell infection, where the virus persistently seeks out vulnerable cells to penetrate—representing global exploration of the search space. Once inside, cell-to-cell transmission enables fast local propagation, modeling the refinement of high-potential solutions through accelerated replication. To conserve resources, MO continuously deletes the least effective virion copies, maintaining a compact and memory-efficient population. This biologically grounded design not only accelerates convergence but also aligns MO with TinyML principles, making it ideally suited for low-power, resource-constrained IoT environments. MO is benchmarked against 21 recent algorithms across 90 functions from CEC-2017, CEC-2019, and CEC-2020, and validated on three engineering design problems. Results show MO achieves up to 13% lower energy consumption and 34% shorter execution time compared to state-of-the-art competitors, while maintaining robust accuracy. A theoretical analysis reveals MO’s time complexity is , confirming its scalability. Statistical validation via Friedman and Fisher tests further supports MO’s performance gains.