{"title":"一类基于Harris链的连续单步元启发式算法的收敛性分析","authors":"Haoxin Wang, 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, 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}
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 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.