{"title":"A distributed individuals based multimodal multi-objective optimization differential evolution algorithm","authors":"Wei Wang, Zhifang Wei, Tianqi Huang, Xiaoli Gao, Weifeng Gao","doi":"10.1007/s12293-024-00413-7","DOIUrl":null,"url":null,"abstract":"<p>There may exist a one-to-many mapping between objective and decision spaces in multimodal multi-objective optimization problems (MMOPs), which requires the evolutionary algorithm to locate multiple non-dominated solution sets. In order to enhance the diversity of the population, we develop a multimodal multi-objective differential evolution algorithm based on distributed individuals and lifetime mechanism. First, every individual can be seen as a distributed unit to locate multiple non-dominated solutions. The solutions with the good diversity are generated by adopting virtual population, and the range of virtual population is adjusted by an adaptive adjustment strategy to locate more non-dominated solutions. Second, it is considered that each individual has a limited lifespan inspired by natural phenomenon. As the search area of individuals becoming adaptively smaller, the individuals with good quality are archived and they can reinitialize with a new lifespan for enhancing diversity of the search space. Then the probability selection strategy is applied in the environment selection to balance exploration and exploitation. The test results on 22 multimodal multi-objective benchmark test functions verify the superior performance of the proposed method.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"19 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memetic Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12293-024-00413-7","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
There may exist a one-to-many mapping between objective and decision spaces in multimodal multi-objective optimization problems (MMOPs), which requires the evolutionary algorithm to locate multiple non-dominated solution sets. In order to enhance the diversity of the population, we develop a multimodal multi-objective differential evolution algorithm based on distributed individuals and lifetime mechanism. First, every individual can be seen as a distributed unit to locate multiple non-dominated solutions. The solutions with the good diversity are generated by adopting virtual population, and the range of virtual population is adjusted by an adaptive adjustment strategy to locate more non-dominated solutions. Second, it is considered that each individual has a limited lifespan inspired by natural phenomenon. As the search area of individuals becoming adaptively smaller, the individuals with good quality are archived and they can reinitialize with a new lifespan for enhancing diversity of the search space. Then the probability selection strategy is applied in the environment selection to balance exploration and exploitation. The test results on 22 multimodal multi-objective benchmark test functions verify the superior performance of the proposed method.
Memetic ComputingCOMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-OPERATIONS RESEARCH & MANAGEMENT SCIENCE
CiteScore
6.80
自引率
12.80%
发文量
31
期刊介绍:
Memes have been defined as basic units of transferrable information that reside in the brain and are propagated across populations through the process of imitation. From an algorithmic point of view, memes have come to be regarded as building-blocks of prior knowledge, expressed in arbitrary computational representations (e.g., local search heuristics, fuzzy rules, neural models, etc.), that have been acquired through experience by a human or machine, and can be imitated (i.e., reused) across problems.
The Memetic Computing journal welcomes papers incorporating the aforementioned socio-cultural notion of memes into artificial systems, with particular emphasis on enhancing the efficacy of computational and artificial intelligence techniques for search, optimization, and machine learning through explicit prior knowledge incorporation. The goal of the journal is to thus be an outlet for high quality theoretical and applied research on hybrid, knowledge-driven computational approaches that may be characterized under any of the following categories of memetics:
Type 1: General-purpose algorithms integrated with human-crafted heuristics that capture some form of prior domain knowledge; e.g., traditional memetic algorithms hybridizing evolutionary global search with a problem-specific local search.
Type 2: Algorithms with the ability to automatically select, adapt, and reuse the most appropriate heuristics from a diverse pool of available choices; e.g., learning a mapping between global search operators and multiple local search schemes, given an optimization problem at hand.
Type 3: Algorithms that autonomously learn with experience, adaptively reusing data and/or machine learning models drawn from related problems as prior knowledge in new target tasks of interest; examples include, but are not limited to, transfer learning and optimization, multi-task learning and optimization, or any other multi-X evolutionary learning and optimization methodologies.