{"title":"再生种群策略- 1:一种动态方法来减轻元启发式算法中的结构偏差","authors":"Kanchan Rajwar , Kusum Deep","doi":"10.1016/j.ins.2025.122444","DOIUrl":null,"url":null,"abstract":"<div><div>Structural bias in metaheuristic algorithms is a critical issue, characterized by an inherent tendency to excessively exploit certain regions of the search space, even when unsupported by the objective function. This bias can distort the exploration process, negatively impacting the efficiency and effectiveness of the algorithms. Although many studies focus on understanding and identifying structural bias, effective mitigation strategies remain scarce. To address this gap, this study introduces the Regenerative Population Strategy-I (RPS-I), a methodology designed to counteract structural bias by dynamically redistributing the population. RPS-I integrates seamlessly into existing metaheuristic frameworks without altering their core mechanisms, providing a practical solution to reduce structural bias. The effectiveness of RPS-I is demonstrated by applying it to six metaheuristic algorithms: Genetic Algorithm, Differential Evolution, Particle Swarm Optimization, Grey Wolf Optimizer, Whale Optimization Algorithm, and Harris Hawks Optimization. The Generalized Signature Test is used to quantify the structural bias of these algorithms after incorporating RPS-I. The results indicate that the RPS-I-enhanced versions exhibit a significant reduction in bias compared to their original counterparts. Furthermore, these enhanced versions are validated using the IEEE CEC 2022 benchmark functions and two classical engineering problems, where they demonstrate improved search capabilities. This study highlights the importance of mitigating structural bias in metaheuristic algorithms, preserving the strengths of existing methods while extending their applicability and robustness. The source code for RPS-I is publicly available at <span><span>https://github.com/kanchan999/RPS-I_Code.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"719 ","pages":"Article 122444"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Regenerative population strategy-I: A dynamic methodology to mitigate structural bias in metaheuristic algorithms\",\"authors\":\"Kanchan Rajwar , Kusum Deep\",\"doi\":\"10.1016/j.ins.2025.122444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Structural bias in metaheuristic algorithms is a critical issue, characterized by an inherent tendency to excessively exploit certain regions of the search space, even when unsupported by the objective function. This bias can distort the exploration process, negatively impacting the efficiency and effectiveness of the algorithms. Although many studies focus on understanding and identifying structural bias, effective mitigation strategies remain scarce. To address this gap, this study introduces the Regenerative Population Strategy-I (RPS-I), a methodology designed to counteract structural bias by dynamically redistributing the population. RPS-I integrates seamlessly into existing metaheuristic frameworks without altering their core mechanisms, providing a practical solution to reduce structural bias. The effectiveness of RPS-I is demonstrated by applying it to six metaheuristic algorithms: Genetic Algorithm, Differential Evolution, Particle Swarm Optimization, Grey Wolf Optimizer, Whale Optimization Algorithm, and Harris Hawks Optimization. The Generalized Signature Test is used to quantify the structural bias of these algorithms after incorporating RPS-I. The results indicate that the RPS-I-enhanced versions exhibit a significant reduction in bias compared to their original counterparts. Furthermore, these enhanced versions are validated using the IEEE CEC 2022 benchmark functions and two classical engineering problems, where they demonstrate improved search capabilities. This study highlights the importance of mitigating structural bias in metaheuristic algorithms, preserving the strengths of existing methods while extending their applicability and robustness. The source code for RPS-I is publicly available at <span><span>https://github.com/kanchan999/RPS-I_Code.git</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"719 \",\"pages\":\"Article 122444\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525005766\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525005766","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
摘要
结构偏差是元启发式算法中的一个关键问题,其特点是即使在目标函数不支持的情况下,也会过度利用搜索空间的某些区域。这种偏差会扭曲探索过程,对算法的效率和有效性产生负面影响。尽管许多研究侧重于理解和识别结构性偏见,但有效的缓解策略仍然很少。为了解决这一差距,本研究引入了再生种群策略- i (RPS-I),这是一种通过动态重新分配种群来抵消结构性偏见的方法。RPS-I无缝集成到现有的元启发式框架中,而不改变其核心机制,为减少结构偏差提供了实用的解决方案。通过将RPS-I应用于遗传算法、差分进化算法、粒子群优化算法、灰狼优化算法、鲸鱼优化算法和哈里斯鹰优化算法等六种元启发式算法,证明了RPS-I的有效性。在纳入RPS-I后,使用广义签名测试来量化这些算法的结构偏差。结果表明,与原始版本相比,rps - i增强版本显着减少了偏差。此外,使用IEEE CEC 2022基准函数和两个经典工程问题验证了这些增强版本,其中它们展示了改进的搜索功能。本研究强调了减轻元启发式算法中的结构偏差的重要性,在保留现有方法的优势的同时扩展其适用性和鲁棒性。RPS-I的源代码可在https://github.com/kanchan999/RPS-I_Code.git上公开获得。
Regenerative population strategy-I: A dynamic methodology to mitigate structural bias in metaheuristic algorithms
Structural bias in metaheuristic algorithms is a critical issue, characterized by an inherent tendency to excessively exploit certain regions of the search space, even when unsupported by the objective function. This bias can distort the exploration process, negatively impacting the efficiency and effectiveness of the algorithms. Although many studies focus on understanding and identifying structural bias, effective mitigation strategies remain scarce. To address this gap, this study introduces the Regenerative Population Strategy-I (RPS-I), a methodology designed to counteract structural bias by dynamically redistributing the population. RPS-I integrates seamlessly into existing metaheuristic frameworks without altering their core mechanisms, providing a practical solution to reduce structural bias. The effectiveness of RPS-I is demonstrated by applying it to six metaheuristic algorithms: Genetic Algorithm, Differential Evolution, Particle Swarm Optimization, Grey Wolf Optimizer, Whale Optimization Algorithm, and Harris Hawks Optimization. The Generalized Signature Test is used to quantify the structural bias of these algorithms after incorporating RPS-I. The results indicate that the RPS-I-enhanced versions exhibit a significant reduction in bias compared to their original counterparts. Furthermore, these enhanced versions are validated using the IEEE CEC 2022 benchmark functions and two classical engineering problems, where they demonstrate improved search capabilities. This study highlights the importance of mitigating structural bias in metaheuristic algorithms, preserving the strengths of existing methods while extending their applicability and robustness. The source code for RPS-I is publicly available at https://github.com/kanchan999/RPS-I_Code.git.
期刊介绍:
Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions.
Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.