{"title":"A differential evolution algorithm considering multi-population based on birth & death process and opposition-based learning with condition","authors":"Xiaolin Yi, Xianfeng Ding, Qian Chen","doi":"10.1016/j.swevo.2025.101966","DOIUrl":null,"url":null,"abstract":"<div><div>Differential evolution algorithm with multi-population cooperation and multi-strategy integration (MPMSDE) has been proven to be a better efficient evolutionary algorithm for global optimization. In MPMSDE, dynamic resource allocation and multi-population cooperation are introduced to distribute computational resources rationally. However, there is no effective escape mechanism when MPMSDE falls into a locally optimal solution. Thus, to achieve automatic escape from the local optimum, a differential evolution algorithm considering multi-population based on B&D process and opposition-based learning with condition (MPNBDE) is proposed in this paper. Different from MPMSDE, MPNBDE develops a B&D process and an opposition-based learning mechanism with condition to automatically search high-efficiency for optimal solutions. Also, a Fermi rule in MPNBDE is utilized to control the extent of the maximum computational resource, which is affected by global information. In MPNBDE, a new mutation strategy, ”DE/pbad-to-pbest-gbest-Fermi/1”, is proposed. The new strategy can not only control the extent of information exchanged by the Fermi rule, However, it also can significantly accelerate the convergence of the algorithm. Meanwhile, compared with other differential evolution algorithms, e.g., MPMSDE and SMLDE, our MPNBDE shows better performance in searching optimum, especially in the calculation accuracy and convergence speed on 21 benchmark functions.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101966"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-12","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/S2210650225001245","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Differential evolution algorithm with multi-population cooperation and multi-strategy integration (MPMSDE) has been proven to be a better efficient evolutionary algorithm for global optimization. In MPMSDE, dynamic resource allocation and multi-population cooperation are introduced to distribute computational resources rationally. However, there is no effective escape mechanism when MPMSDE falls into a locally optimal solution. Thus, to achieve automatic escape from the local optimum, a differential evolution algorithm considering multi-population based on B&D process and opposition-based learning with condition (MPNBDE) is proposed in this paper. Different from MPMSDE, MPNBDE develops a B&D process and an opposition-based learning mechanism with condition to automatically search high-efficiency for optimal solutions. Also, a Fermi rule in MPNBDE is utilized to control the extent of the maximum computational resource, which is affected by global information. In MPNBDE, a new mutation strategy, ”DE/pbad-to-pbest-gbest-Fermi/1”, is proposed. The new strategy can not only control the extent of information exchanged by the Fermi rule, However, it also can significantly accelerate the convergence of the algorithm. Meanwhile, compared with other differential evolution algorithms, e.g., MPMSDE and SMLDE, our MPNBDE shows better performance in searching optimum, especially in the calculation accuracy and convergence speed on 21 benchmark functions.
期刊介绍:
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.