猴痘优化器:TinyML生物启发的进化优化算法及其工程应用

IF 4.3
Marwa F. Mohamed , Ahmed Hamed
{"title":"猴痘优化器:TinyML生物启发的进化优化算法及其工程应用","authors":"Marwa F. Mohamed ,&nbsp;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 ,&nbsp;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}
引用次数: 0

摘要

高维优化仍然是计算智能的一个关键挑战,特别是在资源限制下。为了解决这个问题,已经提出了模拟生物种群遗传特征变化的进化算法。这些算法施加选择压力,在几代人中倾向于更好的解决方案,随机变化可能偶尔会引入次优候选方案,以保持种群多样性。然而,它们往往难以平衡勘探和开发,导致次优解决方案、过早收敛和大量的计算需求,使它们不适合资源受限的环境。猴痘优化算法(Monkeypox Optimization, MO)是一种受猴痘病毒感染和复制生命周期启发的新型进化算法。MO通过病毒对细胞感染来模拟病毒的快速传播,病毒持续寻找易受攻击的细胞进行渗透——这代表了对搜索空间的全球探索。一旦进入细胞内部,细胞间传输可以实现快速本地传播,通过加速复制模拟高潜力解决方案的改进。为了节省资源,MO不断地删除最无效的病毒粒子副本,保持紧凑和内存高效的种群。这种基于生物的设计不仅加速了融合,而且使MO与TinyML原则保持一致,使其非常适合低功耗,资源受限的物联网环境。MO以21种最新算法为基准,涵盖cecc -2017、cecc -2019和cecc -2020的90个功能,并在三个工程设计问题上进行了验证。结果表明,与最先进的竞争对手相比,MO的能耗降低了13%,执行时间缩短了34%,同时保持了强大的准确性。理论分析表明,MO的时间复杂度为0 (mn+RTn),证实了其可扩展性。通过Friedman和Fisher测试的统计验证进一步支持MO的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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 O(mn+RTn), confirming its scalability. Statistical validation via Friedman and Fisher tests further supports MO’s performance gains.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.60
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信