检索结果-内蒙古大学图书馆

Variational graph autoencoder-driven balancing strategy for multimodal multi-objective optimization

INFORMATION SCIENCES 2025年 712卷

作者： Yang, Lei Zhang, Erlei Dang, Qianlong Northwest A&F Univ Coll Informat Engn Yangling 712100 Peoples R China Northwest A&F Univ Coll Sci Yangling 712100 Peoples R China

multimodal multi-objective optimization aims to balance the diversity and the convergence to obtain multiple complete and uniform Pareto optimal solution sets. In recent years, using machine learning models to improve the performance of evolutionary algorithms has become a hot topic. However, few studies utilize machine learning models to solve the imbalance problem between the diversity and the convergence in multimodal multi-objective optimization. Therefore, this paper proposes a multimodal multi-objective evolutionary algorithm driven by variational graph autoencoder (VGAE), which can reproduce diversified offspring with good convergence by reconstructing the parent population. In reproduction, the parent population is constructed into graph data, and the VGAE is adopted to map the graph data to the latent space, obtaining the distribution information represented by the low-dimensional vector. By sampling the distribution, the VGAE can generate the offspring with the similar distribution to the parent, which can fill the less dense regions in the decision space and improve the exploitation ability. In archive updating, the convergence state based on the inverted generation distance between the non-dominated solutions and the worst dominated solutions is defined, and the state information of the convergence archive is transferred to the diversity archive to determine the dynamic niche. This niche comprehensively considers the distribution state and convergence degree of solutions in the diversity and convergence archives, which is employed to calculate the local convergence quality, retaining more promising solutions. The results of 48 benchmark problems and a practical application show that the proposed algorithm outperforms eight competitive algorithms.

关键词： multimodal multi-objective optimization Imbalance problem Variational graph autoencoder Inverted generation distance Dynamic niche

来源：评论

学校读者我要写书评

暂无评论

Learnable self-supervised support vector machine based individual selection strategy for multimodal multi-objective optimization

引用

INFORMATION SCIENCES 2025年 690卷

作者： Gao, Xiaochuan Bai, Weiting Dang, Qianlong Yang, Shuai Zhang, Guanghui Northwest A&F Univ Coll Sci Yangling 712100 Shaanxi Peoples R China Anhui Agr Univ Sch Informat & Artificial Intelligence Hefei 230036 Peoples R China Hebei Agr Univ Sch Informat Sci & Technol Baoding 071001 Peoples R China

multimodal multi-objective optimization problem (MMOP) is a frontier research problem, which can provide decision makers with more choices without making trade-offs. Many multimodal multi-objective evolutionary algorithms (MMOEAs) have been proposed to solve MMOP. However, most MMOEAs tend to prioritize the objective dominance of individuals in the process of individual selection, and only individuals with the same objective dominance will be considered the diversity, which leads to the loss of many promising solutions. To solve the above problem, this paper proposes a learnable self-supervised support vector machine (SVM) based multimodal multi-objective optimization algorithm (SVMEA). Support vector machine can learn the knowledge about distinguishing the advantages and disadvantages of individuals from the data in the existing training set and select individuals, in which the objective dominance of individuals is as important as diversity. Moreover, a crowding distance calculation method based on Manhattan distance is designed. Compared with the traditional method using Euclidean distance to calculate crowding distance, it can better evaluate the diversity of individuals in the decision space and assist the selection of elite solutions. Experimental results show that the proposed SVMEA is competitive with seven other advanced MMOEAs on 34 benchmark problems and a practical application problem.

关键词： multimodal multi-objective optimization Learnable self-supervised support vector machine Individual selection Manhattan distance Crowding distance

来源：评论

学校读者我要写书评

暂无评论

A multi-population competitive evolutionary algorithm based on genotype preference for multimodal multi-objective optimization

引用

SWARM AND EVOLUTIONARY COMPUTATION 2025年 92卷

作者： Zhong, Keyu Xiao, Fen Gao, Xieping Hunan Normal Univ Minist Educ Key Lab Comp & Stochast Math Changsha 410081 Peoples R China Hunan Normal Univ Sch Math & Stat Changsha 410081 Peoples R China Xiangtan Univ Sch Comp Sci Xiangtan 411105 Peoples R China Hunan Normal Univ Coll Informat Sci & Engn Changsha 410081 Peoples R China

Many existing multimodal multi-objective evolutionary algorithms (MMOEAs) exhibit poor performance in addressing multimodal multi-objective optimization problems (MMOPs), mainly due to limited genetic diversity in environmental selection. In this paper, we propose a multi-population competitive evolutionary algorithm based on genotype preference (MPCEA-GP) to solve MMOPs. Firstly, we propose a population selection strategy based on genotype preference to maintain the genetic diversity of the population. This strategy utilizes the spectral radius to assess the overall convergence quality of the population, rather than evaluating each individual separately, and favors selecting the population with the minimum spectral radius, thereby preserving the genotypes of both optimal and suboptimal individuals. Secondly, to address the challenge of diminished genetic diversity during the evolutionary process, we incorporate historical survival population with substantial genetic diversity into the competition between parent and offspring, and preferentially select individuals with significant genotype differences to recombine into a new population. By merging two selected populations, a joint population with sufficient genetic diversity is constructed. Finally, a genotype-phenotype-based fitness criterion is devised to evaluate the fitness of individuals. This criterion not only compares genotypes using the Pareto dominance principle but also concurrently considers both genotype and phenotype diversity, aiding the population in more precisely identifying individuals with both good convergence and diversity. Empirical results show that MPCEA-GP outperforms state-of-the-art MMOEAs for 40 chosen benchmark functions and two complex real- world applications.

关键词： multimodal multi-objective optimization Genotype Phenotype Historical survival population

来源：评论

学校读者我要写书评

暂无评论

multimodal multi-objective optimization via determinantal point process-assisted evolutionary algorithm

引用

NEURAL COMPUTING & APPLICATIONS 2024年第3期36卷 1381-1411页

作者： Cheng, Xinyu Gong, Wenyin Ming, Fei Zhu, Xiaofang China Univ Geosci Sch Comp Sci Wuhan 430074 Hubei Peoples R China Wuhan Univ Technol Sch Comp Sci & Artificial Intelligence Wuhan 430071 Hubei Peoples R China

multimodal multi-objective optimization problems (MMOPs) are widely present in real life. Due to the need of balancing between convergence and diversity in multi-objective optimization, as well as the need of balancing between diversities in objective and decision spaces, exploring the Pareto optimal front and Pareto optimal solution set becomes rather difficult in solving MMOPs. Recently, some multimodal multi-objective optimization algorithms have emerged. However, most of them are convergence-first, which may result in poor diversity of the solution set in decision space. To remedy this defect, in this paper, a determinantal point process (DPP)-assisted evolutionary algorithm is proposed to effectively solve MMOPs. In the proposed method, i) the DPPs are used to select subsets to consider convergence and diversity in both objective and decision spaces;ii) a kernel matrix is designed to retain solutions with poor convergence but good diversity in the decision space to explore the equivalent Pareto optimal solution sets;and iii) we propose a framework that combines the population and archive to better solve MMOPs. The results show that the proposed algorithm achieves the best performance in 18 of the 28 benchmark problems compared to six state-of-the-art algorithms.

关键词： multimodal multi-objective optimization Evolutionary algorithm Determinantal point processes Subset selection Decision space diversity.

来源：评论

学校读者我要写书评

暂无评论

multimodal multi-objective optimization based on local optimal neighborhood crowding distance differential evolution algorithm

引用

NEURAL COMPUTING & APPLICATIONS 2024年第1期36卷 461-481页

作者： Gu, Qinghua Peng, Yifan Wang, Qian Jiang, Song Xian Univ Architecture & Technol Sch Resources Engn Xian 710055 Shaanxi Peoples R China Xian Univ Architecture & Technol Xian Key Lab Intelligent Ind Percept Calculat & De Xian 710055 Peoples R China Xian Univ Architecture & Technol Sch Management Xian 710055 Shaanxi Peoples R China

In practical applications, the optimal solutions of multi-objective optimization are not unique. Some problems exist different Pareto Sets (PSs) in the decision space mapped to the same Pareto Front (PF) in the objective space, which are called multimodal multi-objective problems (MMOPs). To tackle this issue, this paper proposes a multimodal multi-objective optimization based on a local optimal neighborhood crowding distance differential evolution algorithm. First, an adaptive partitioning strategy in the initialization phase is proposed by using the characteristics of the heuristic stochastic search. That ensures the local optimal solution is quickly found among multiple PSs. Second, opposition-based learning is combined with differential mutation to generate vectors, which accelerate the convergence of the population to the optimal solution. Finally, a method for neighborhood crowding distances on different Pareto ranks is designed. The distance is computed by a weighted sum of Euclidean distances for the nearest neighbors. While reducing computational complexity, this strategy reflects realistic crowding degree. With these methods, balances the diversity performance of the decision and the objective space, while improving the search capability. multiple PSs reveal the problem's potential characteristics and meet the needs of the decision-maker. The practical significance is verified by the application of actual distance minimization problem. According to experimental results, the proposed method can achieve a high level of comprehensive performance.

关键词： multimodal multi-objective optimization Local optimal Crowding distance Differential evolution

来源：评论

学校读者我要写书评

暂无评论

multimodal multi-objective optimization with multi-stage-based evolutionary algorithm

引用

MEMETIC COMPUTING 2023年第4期15卷 377-389页

作者： Wu, Tianyong Ming, Fei Zhang, Hao Yang, Qiying Gong, Wenyin China Univ Geosci Coll Marine Sci & Technol Wuhan 430074 Hubei Peoples R China China Univ Geosci Sch Comp Sci Wuhan 430074 Hubei Peoples R China China Univ Geosci Fac Engn Wuhan 430074 Hubei Peoples R China China Univ Geosci Inst Adv Marine Res CUG Guangzhou 511466 Guangdong Peoples R China

A key issue in tackling multimodal multi-objective optimization problems (MMOPs) is achieving the balance between objective space diversity and decision space diversity to obtain multiple Pareto sets (PSs) while guaranteeing convergence to the Pareto front (PF). However, most of the existing methods for MMOPs face the following two shortages: (i) they put insufficient emphasis on improving decision space diversity, resulting in missing some PSs or PS segments;and (ii) they lack the utilization of promising historical individuals which may help search the PSs. To alleviate these limitations, this paper proposes a novel multi-stage evolutionary algorithm with two improved optimization strategies. Specifically, the proposed method decomposes solving MMOP into two tasks, i.e., the Exploration task and the Exploitation task. The Exploration task first aims to explore the decision space to detect the multiple PSs, then, the Exploitation task aims to enhance the diversities on both objective and decision spaces (i.e., exploiting the PF and PSs). To better search PSs, historical individuals that are well-distributed in the decision space are stored as the evolutionary experience, and then used to generate offspring individuals. Moreover, a new differential evolution is designed to force crowded individuals to move to sparse and undetected regions on the PSs to enhance the diversity of PSs. Extensive experimental studies compare the proposed method with five state-of-the-art methods tailored for MMOPs on two benchmark test suites. The results demonstrate that the proposed method can outperform others in terms of three performance indicators.

关键词： multimodal multi-objective optimization Evolutionary algorithms multi-stage strategy Historical evolutionary experience Differential evolution Exploration and exploitation

来源：评论

学校读者我要写书评

暂无评论

multimodal multi-objective optimization Using A Density-based One-by-One Update Strategy

Multimodal Multi-objective Optimization Using A Density-base...

引用

IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Shi, Ruizhi Lin, Wu Lin, Qiuzhen Zhu, Zexuan Chen, Jianyong Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781728121536

For real-world optimization problems, a uniformly and widely distributed Pareto optimal set (PS) in the decision space can provide more choices for decision makers. However, most of multi-objective evolutionary algorithms (MOEAs) only consider convergence and diversity in the objective space, which rarely pay attention to diversity in the decision space. Especially for multimodal multi-objective optimization problems (MMOPs), there may exist multiple distinct PSs corresponding to the same Pareto front (PF). Thus, we propose a novel multimodal multi-objective evolutionary algorithm using a density-based one-by-one update strategy in this paper, which considers diversity in both the objective and decision spaces. In the proposed algorithm, once an offspring is generated during evolution, the most crowded subregion with the largest niche count in the objective space has to be identified again, helpful to maintain diversity in the objective space. Furthermore, the harmonic average distance approach is used to estimate the global density of solutions in the decision space, trying to maintain the population's diversity in the decision space. Our proposed algorithm is compared with several state-of-the-art algorithms on MMOPs. The experimental results demonstrate that our algorithm is capable of preserving promising solutions with even distribution in both of decision space and objective space and also shows the superiority on solving the adopted MMOPs.

关键词： multi-objective evolutionary algorithms multimodal multi-objective optimization global density harmonic average distance

来源：评论

学校读者我要写书评

暂无评论

multimodal multi-objective optimization: A Preliminary Study

Multimodal Multi-objective Optimization: A Preliminary Study

引用

IEEE Congress on Evolutionary Computation (CEC) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Liang, J. J. Yue, C. T. Qu, B. Y. Zhengzhou Univ Sch Elect Engn Zhengzhou 450001 Peoples R China Zhongyuan Univ Technol Sch Elect & Informat Engn Zhengzhou 450007 Peoples R China

ISBN: (纸本)9781509006229

In real world applications, there are many multi-objective optimization problems. Most existing multi-objective optimization algorithms focus on improving the diversity, spread and convergence of the solutions in the objective space. Few works study the distribution of solutions in the decision space. In practical applications, some multi-objective problems have different Pareto sets with the same objective values and these problems are defined as multimodal multi-objective optimization problems. It is of great significance to provide all the Pareto sets for the decision maker. This paper describes the concept of multimodal multi-objective optimization problems in detail. Novel test functions are also designed to judge the performance of different algorithms. Moreover, some existing multi-objective algorithms are tested and compared. Finally, a decision space based niching multi-objective evolutionary algorithm is proposed to solve these problems. The experimental results suggest that existing multi-objective optimization algorithms fail to find all the Pareto sets while the proposed algorithm is able to find almost all the Pareto sets without deteriorating the distribution of solutions in the objective space.

关键词： Evolutionary algorithms multimodal multi-objective optimization niching

来源：评论

学校读者我要写书评

暂无评论

Exploring a Promising Region and Enhancing Decision Space Diversity for multimodal multi-objective optimization

引用

Tsinghua Science and Technology 2024年第2期29卷 325-342页

作者： Fei Ming Wenyin Gong School of Computer Science China University of GeosciencesWuhan 430074China

During the past decade,research efforts have been gradually directed to the widely existing yet less noticed multimodal multi-objective optimization problems(MMOPs)in the multi-objective optimization ***,researchers have begun to investigate enhancing the decision space diversity and preserving valuable dominated solutions to overcome the shortage caused by a preference for objective space ***,many existing methods still have limitations,such as giving unduly high priorities to convergence and insufficient ability to enhance decision space *** overcome these shortcomings,this article aims to explore a promising region(PR)and enhance the decision space diversity for handling *** traditional methods,we propose the use of non-dominated solutions to determine a limited region in the PR in the decision space,where the Pareto sets(PSs)are included,and explore this region to assist in solving ***,we develop a novel neighbor distance measure that is more suitable for the complex geometry of PSs in the decision space than the crowding *** on the above methods,we propose a novel dual-population-based coevolutionary *** studies on three benchmark test suites demonstrates that our proposed methods can achieve promising performance and versatility on different *** effectiveness of the proposed neighbor distance has also been justified through comparisons with crowding distance methods.

关键词： multimodal multi-objective optimization evolutionary algorithms promising region neighbor distance decision space coevolution

来源：评论

学校读者我要写书评

暂无评论

Zoning Search With Adaptive Resource Allocating Method for Balanced and Imbalanced multimodal multi-objective optimization

引用

IEEE/CAA Journal of Automatica Sinica 2021年第6期8卷 1163-1176页

作者： Qinqin Fan Okan K.Ersoy Logistics Research Center Shanghai Maritime UniversityShanghai 201306China School of Electronic and Computer Engineering Purdue UniversityWest LafayetteIN 47906 USA

Maintaining population diversity is an important task in the multimodal multi-objective *** the zoning search(ZS)can improve the diversity in the decision space,assigning the same computational costs to each search subspace may be wasteful when computational resources are limited,especially on imbalanced *** alleviate the above-mentioned issue,a zoning search with adaptive resource allocating(ZS-ARA)method is proposed in the current *** the proposed ZS-ARA,the entire search space is divided into many subspaces to preserve the diversity in the decision space and to reduce the problem ***,the computational resources can be automatically allocated among all the *** ZS-ARA is compared with seven algorithms on two different types of multimodal multi-objective problems(MMOPs),namely,balanced and imbalanced *** results indicate that,similarly to the ZS,the ZS-ARA achieves high performance with the balanced ***,it can greatly assist a“regular”algorithm in improving its performance on the imbalanced MMOPs,and is capable of allocating the limited computational resources dynamically.

关键词： Computational resource allocation decision space decomposition evolutionary computation multimodal multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：