Xinfang Ji , Jingwei Jia , Xiaofeng Wang , Jiaxing Yao , Lixia Fang , Jinxin Cheng , Yong Zhang
{"title":"Surrogate-assisted two-stage cooperative differential evolution for expensive constrained multimodal optimization problems","authors":"Xinfang Ji , Jingwei Jia , Xiaofeng Wang , Jiaxing Yao , Lixia Fang , Jinxin Cheng , Yong Zhang","doi":"10.1016/j.swevo.2025.102014","DOIUrl":null,"url":null,"abstract":"<div><div>The expensive calculation, constrained solution space and multimodal properties of expensive constrained multimodal optimization problems pose significant challenges for effective problem solving. Therefore, this study proposed a surrogate-assisted two-stage cooperative differential evolution algorithm, aiming to locate multiple optimal solutions at a low computational cost. The algorithm initially established a two-stage master–auxiliary problem cooperative framework to balance the search focus at various stages: the first stage emphasizes finding feasible regions, while the second stage focuses on tracking multiple modalities and locating the optimal solution within each modality. Then, to balance the feasibility, diversity, and accuracy of the solutions, a multi-indicator guided two-stage surrogate model management mechanism was proposed. Furthermore, a two-stage local search strategy for elite solutions was presented, which implements different local search schemes based on the existence of feasible solutions, in order to improve the quality of solutions while mining feasible ones. Finally, the proposed algorithm was compared with five existing expensive constrained surrogate-assisted evolutionary algorithms (SAEAs), one constrained multimodal evolutionary algorithm, and one expensive constrained multimodal SAEA. Experimental results on 21 benchmark problems and 1 rotor airfoil aerodynamic instance show that the proposed algorithm can obtain multiple highly competitive optimal solutions with less computational cost.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102014"},"PeriodicalIF":8.2000,"publicationDate":"2025-06-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/S2210650225001725","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
The expensive calculation, constrained solution space and multimodal properties of expensive constrained multimodal optimization problems pose significant challenges for effective problem solving. Therefore, this study proposed a surrogate-assisted two-stage cooperative differential evolution algorithm, aiming to locate multiple optimal solutions at a low computational cost. The algorithm initially established a two-stage master–auxiliary problem cooperative framework to balance the search focus at various stages: the first stage emphasizes finding feasible regions, while the second stage focuses on tracking multiple modalities and locating the optimal solution within each modality. Then, to balance the feasibility, diversity, and accuracy of the solutions, a multi-indicator guided two-stage surrogate model management mechanism was proposed. Furthermore, a two-stage local search strategy for elite solutions was presented, which implements different local search schemes based on the existence of feasible solutions, in order to improve the quality of solutions while mining feasible ones. Finally, the proposed algorithm was compared with five existing expensive constrained surrogate-assisted evolutionary algorithms (SAEAs), one constrained multimodal evolutionary algorithm, and one expensive constrained multimodal SAEA. Experimental results on 21 benchmark problems and 1 rotor airfoil aerodynamic instance show that the proposed algorithm can obtain multiple highly competitive optimal solutions with less computational cost.
期刊介绍:
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.