{"title":"Self-organizing surrogate-assisted non-dominated sorting differential evolution","authors":"Aluizio F.R. Araújo , Lucas R.C. Farias , Antônio R.C. Gonçalves","doi":"10.1016/j.swevo.2024.101703","DOIUrl":null,"url":null,"abstract":"<div><p>Multi-objective optimization problems (MOPs) involve optimizing multiple conflicting objectives simultaneously, resulting in a set of Pareto optimal solutions. Due to the high computational or financial cost associated with evaluating fitness, expensive multi-objective optimization problems (EMOPs) further complicate the optimization process. Surrogate-assisted evolutionary algorithms (SAEAs) have emerged as a promising approach to address EMOPs by substituting costly evaluations with computationally efficient surrogate models. This paper introduces the self-organizing surrogate-assisted non-dominated sorting differential evolution (SSDE), which uses surrogate model based on a self-organizing map (SOM) to approximate the fitness function. SSDE offers advantages such as reduced computational cost, improved accuracy, and the speed of enhanced convergence. The SOM-based surrogate models effectively capture the underlying structure of the Pareto optimal set and Pareto optimal front, leading to superior approximations of the fitness function. Experimental results on benchmark functions and real-world problems, including Model-Free Adaptive Control (MFAC) and the Yagi-Uda Antenna design, demonstrate the competitiveness and efficiency of SSDE compared to other algorithms.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101703"},"PeriodicalIF":8.2000,"publicationDate":"2024-08-20","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/S2210650224002414","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
Multi-objective optimization problems (MOPs) involve optimizing multiple conflicting objectives simultaneously, resulting in a set of Pareto optimal solutions. Due to the high computational or financial cost associated with evaluating fitness, expensive multi-objective optimization problems (EMOPs) further complicate the optimization process. Surrogate-assisted evolutionary algorithms (SAEAs) have emerged as a promising approach to address EMOPs by substituting costly evaluations with computationally efficient surrogate models. This paper introduces the self-organizing surrogate-assisted non-dominated sorting differential evolution (SSDE), which uses surrogate model based on a self-organizing map (SOM) to approximate the fitness function. SSDE offers advantages such as reduced computational cost, improved accuracy, and the speed of enhanced convergence. The SOM-based surrogate models effectively capture the underlying structure of the Pareto optimal set and Pareto optimal front, leading to superior approximations of the fitness function. Experimental results on benchmark functions and real-world problems, including Model-Free Adaptive Control (MFAC) and the Yagi-Uda Antenna design, demonstrate the competitiveness and efficiency of SSDE compared to other algorithms.
期刊介绍:
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.