一类基于Harris链的连续单步元启发式算法的收敛性分析

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Haoxin Wang, Libao Shi
{"title":"一类基于Harris链的连续单步元启发式算法的收敛性分析","authors":"Haoxin Wang,&nbsp;Libao Shi","doi":"10.1016/j.swevo.2025.102046","DOIUrl":null,"url":null,"abstract":"<div><div>As one of the most important properties to measure the optimization performance of a meta-heuristic algorithm (MA), the convergence property has been widely concerned and studied. So far, most theoretical research in this field has mainly focused on specific MAs, and the corresponding Markov chain theory has also been mainly utilized to analyze the MAs with discrete finite states. How to further investigate the convergence of a class of continuous single-step MAs from the perspective of theoretical analysis still needs in-depth and detailed exploration. In this paper, for a class of single-step MAs, the sampling distribution convergence and global convergence are elaborately analyzed based on Harris chain. Firstly, based on the similarities of the formulation of solution update operator, a class of single-step MAs are defined. Then, the corresponding transition kernel of each search agent position is derived, based on which a sufficient condition for sampling distribution convergence and global convergence is proposed and rigorously proved through Harris chain theory. Finally, some case studies are performed to verify the rationality and effectiveness of the proposed definitions, conditions, and theorems. On the basis of these cases, some meaningful conclusions are drawn to provide guidance for leveraging existing single-step MAs and designing efficient single-step MAs.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102046"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Convergence analysis for a class of continuous single-step meta-heuristic algorithms based on Harris chain\",\"authors\":\"Haoxin Wang,&nbsp;Libao Shi\",\"doi\":\"10.1016/j.swevo.2025.102046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>As one of the most important properties to measure the optimization performance of a meta-heuristic algorithm (MA), the convergence property has been widely concerned and studied. So far, most theoretical research in this field has mainly focused on specific MAs, and the corresponding Markov chain theory has also been mainly utilized to analyze the MAs with discrete finite states. How to further investigate the convergence of a class of continuous single-step MAs from the perspective of theoretical analysis still needs in-depth and detailed exploration. In this paper, for a class of single-step MAs, the sampling distribution convergence and global convergence are elaborately analyzed based on Harris chain. Firstly, based on the similarities of the formulation of solution update operator, a class of single-step MAs are defined. Then, the corresponding transition kernel of each search agent position is derived, based on which a sufficient condition for sampling distribution convergence and global convergence is proposed and rigorously proved through Harris chain theory. Finally, some case studies are performed to verify the rationality and effectiveness of the proposed definitions, conditions, and theorems. On the basis of these cases, some meaningful conclusions are drawn to provide guidance for leveraging existing single-step MAs and designing efficient single-step MAs.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102046\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225002044\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002044","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

收敛性作为衡量元启发式算法优化性能的重要性质之一,受到了广泛的关注和研究。到目前为止,该领域的理论研究大多集中在具体的MAs上,相应的马尔可夫链理论也主要用于分析离散有限状态MAs。如何从理论分析的角度进一步研究一类连续单步MAs的收敛性,还需要深入细致的探索。本文针对一类单步MAs,详细分析了基于Harris链的抽样分布收敛性和全局收敛性。首先,基于求解更新算子表述的相似性,定义了一类单步MAs;在此基础上,提出了采样分布收敛和全局收敛的充分条件,并通过Harris链理论进行了严格证明。最后,通过案例分析验证了所提定义、条件和定理的合理性和有效性。在这些案例的基础上,得出了一些有意义的结论,为利用现有的单步MAs和设计高效的单步MAs提供指导。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Convergence analysis for a class of continuous single-step meta-heuristic algorithms based on Harris chain
As one of the most important properties to measure the optimization performance of a meta-heuristic algorithm (MA), the convergence property has been widely concerned and studied. So far, most theoretical research in this field has mainly focused on specific MAs, and the corresponding Markov chain theory has also been mainly utilized to analyze the MAs with discrete finite states. How to further investigate the convergence of a class of continuous single-step MAs from the perspective of theoretical analysis still needs in-depth and detailed exploration. In this paper, for a class of single-step MAs, the sampling distribution convergence and global convergence are elaborately analyzed based on Harris chain. Firstly, based on the similarities of the formulation of solution update operator, a class of single-step MAs are defined. Then, the corresponding transition kernel of each search agent position is derived, based on which a sufficient condition for sampling distribution convergence and global convergence is proposed and rigorously proved through Harris chain theory. Finally, some case studies are performed to verify the rationality and effectiveness of the proposed definitions, conditions, and theorems. On the basis of these cases, some meaningful conclusions are drawn to provide guidance for leveraging existing single-step MAs and designing efficient single-step MAs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信