• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种基于三种状态的多目标进化算法,用于求解多目标优化问题。

A many-objective evolutionary algorithm based on three states for solving many-objective optimization problem.

作者信息

Zhao Jiale, Zhang Huijie, Yu Huanhuan, Fei Hansheng, Huang Xiangdang, Yang Qiuling

机构信息

School of Information and Communication Engineering, Hainan University, Haikou, 570228, China.

Innovation Platform for Academicians of Hainan Province, Hainan University, Haikou, 570228, China.

出版信息

Sci Rep. 2024 Aug 19;14(1):19140. doi: 10.1038/s41598-024-70145-8.

DOI:10.1038/s41598-024-70145-8
PMID:39160336
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11333576/
Abstract

In recent years, researchers have taken the many-objective optimization algorithm, which can optimize 5, 8, 10, 15, 20 objective functions simultaneously, as a new research topic. However, the current research on many-objective optimization technology also encounters some challenges. For example: Pareto resistance phenomenon, difficult diversity maintenance. Based on the above problems, this paper proposes a many-objective evolutionary algorithm based on three states (MOEA/TS). Firstly, a feature extraction operator is proposed. It can extract the features of the high-quality solution set, and then assist the evolution of the current individual. Secondly, based on Pareto front layer, the concept of "individual importance degree" is proposed. The importance degree of an individual can reflect the importance of the individual in the same Pareto front layer, so as to further distinguish the advantages and disadvantages of different individuals in the same front layer. Then, a repulsion field method is proposed. The diversity of the population in the objective space is maintained by the repulsion field, so that the population can be evenly distributed on the real Pareto front. Finally, a new concurrent algorithm framework is designed. In the algorithm framework, the algorithm is divided into three states, and each state focuses on a specific task. The population can switch freely among these three states according to its own evolution. The MOEA/TS algorithm is compared with 7 advanced many-objective optimization algorithms. The experimental results show that the MOEA/TS algorithm is more competitive in many-objective optimization problems.

摘要

近年来,研究人员将能够同时优化5个、8个、10个、15个、20个目标函数的多目标优化算法作为一个新的研究课题。然而,当前对多目标优化技术的研究也遇到了一些挑战。例如:帕累托抗性现象、难以维持多样性。基于上述问题,本文提出了一种基于三种状态的多目标进化算法(MOEA/TS)。首先,提出了一种特征提取算子。它可以提取高质量解集的特征,进而辅助当前个体的进化。其次,基于帕累托前沿层,提出了“个体重要度”的概念。个体的重要度能够反映该个体在同一帕累托前沿层中的重要性,从而进一步区分同一前沿层中不同个体的优劣。然后,提出了一种排斥场方法。通过排斥场来维持目标空间中种群的多样性,使得种群能够均匀地分布在真实的帕累托前沿上。最后,设计了一种新的并发算法框架。在该算法框架中,算法被分为三种状态,每种状态专注于一项特定任务。种群可以根据自身的进化在这三种状态之间自由切换。将MOEA/TS算法与7种先进的多目标优化算法进行了比较。实验结果表明,MOEA/TS算法在多目标优化问题中更具竞争力。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7433e7ce946a/41598_2024_70145_Fig18_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7b547ed57e3c/41598_2024_70145_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/b356b912d743/41598_2024_70145_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/ada3294bf9a6/41598_2024_70145_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/fe4c3af5219e/41598_2024_70145_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/ba9c0cb193da/41598_2024_70145_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/669bf6eaea2c/41598_2024_70145_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/4e6097773cf0/41598_2024_70145_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/708804faf69d/41598_2024_70145_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/91484a38d211/41598_2024_70145_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/44a28e320090/41598_2024_70145_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cb824d149022/41598_2024_70145_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/86bc42544f90/41598_2024_70145_Figc_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/d4fa65e89c79/41598_2024_70145_Figd_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7f0795badb34/41598_2024_70145_Fige_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/356e66e91d83/41598_2024_70145_Figf_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/e68cac5334f2/41598_2024_70145_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cc3ed39c8022/41598_2024_70145_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/984551973382/41598_2024_70145_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/9bc1ad47d3e2/41598_2024_70145_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/a63f85a23c3d/41598_2024_70145_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7e1be4f6aaa5/41598_2024_70145_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cb17fb2c37c8/41598_2024_70145_Fig16_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/a728c78a443a/41598_2024_70145_Fig17_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7433e7ce946a/41598_2024_70145_Fig18_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7b547ed57e3c/41598_2024_70145_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/b356b912d743/41598_2024_70145_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/ada3294bf9a6/41598_2024_70145_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/fe4c3af5219e/41598_2024_70145_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/ba9c0cb193da/41598_2024_70145_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/669bf6eaea2c/41598_2024_70145_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/4e6097773cf0/41598_2024_70145_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/708804faf69d/41598_2024_70145_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/91484a38d211/41598_2024_70145_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/44a28e320090/41598_2024_70145_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cb824d149022/41598_2024_70145_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/86bc42544f90/41598_2024_70145_Figc_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/d4fa65e89c79/41598_2024_70145_Figd_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7f0795badb34/41598_2024_70145_Fige_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/356e66e91d83/41598_2024_70145_Figf_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/e68cac5334f2/41598_2024_70145_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cc3ed39c8022/41598_2024_70145_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/984551973382/41598_2024_70145_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/9bc1ad47d3e2/41598_2024_70145_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/a63f85a23c3d/41598_2024_70145_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7e1be4f6aaa5/41598_2024_70145_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/cb17fb2c37c8/41598_2024_70145_Fig16_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/a728c78a443a/41598_2024_70145_Fig17_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5b3b/11333576/7433e7ce946a/41598_2024_70145_Fig18_HTML.jpg

相似文献

1
A many-objective evolutionary algorithm based on three states for solving many-objective optimization problem.一种基于三种状态的多目标进化算法,用于求解多目标优化问题。
Sci Rep. 2024 Aug 19;14(1):19140. doi: 10.1038/s41598-024-70145-8.
2
A Decomposition-Based Evolutionary Algorithm with Correlative Selection Mechanism for Many-Objective Optimization.一种基于分解且具有相关选择机制的多目标优化进化算法。
Evol Comput. 2021 Jun 1;29(2):269-304. doi: 10.1162/evco_a_00279.
3
A hierarchical evolutionary algorithm for multiobjective optimization in IMRT.用于调强放射治疗中多目标优化的分层进化算法。
Med Phys. 2010 Sep;37(9):4986-97. doi: 10.1118/1.3478276.
4
A Clustering-Based Adaptive Evolutionary Algorithm for Multiobjective Optimization With Irregular Pareto Fronts.一种基于聚类的多目标优化自适应进化算法,用于处理不规则帕累托前沿。
IEEE Trans Cybern. 2019 Jul;49(7):2758-2770. doi: 10.1109/TCYB.2018.2834466. Epub 2018 Jun 5.
5
Solving Many-Objective Optimization Problems by a Pareto-Based Evolutionary Algorithm With Preprocessing and a Penalty Mechanism.基于帕累托的带预处理和惩罚机制的进化算法求解多目标优化问题
IEEE Trans Cybern. 2021 Nov;51(11):5585-5594. doi: 10.1109/TCYB.2020.2988896. Epub 2021 Nov 9.
6
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts.基于分解的复杂 Pareto 前沿改进多目标优化进化算法。
IEEE Trans Cybern. 2016 Feb;46(2):421-37. doi: 10.1109/TCYB.2015.2403131. Epub 2015 Mar 13.
7
A Cross-Reference Line Method Based Multiobjective Evolutionary Algorithm to Enhance Population Diversity.基于交叉参考线的多目标进化算法增强种群多样性。
Comput Intell Neurosci. 2020 Jul 18;2020:7179647. doi: 10.1155/2020/7179647. eCollection 2020.
8
A Multiobjective Evolutionary Algorithm Based on Coordinate Transformation.一种基于坐标变换的多目标进化算法。
IEEE Trans Cybern. 2019 Jul;49(7):2732-2743. doi: 10.1109/TCYB.2018.2834363. Epub 2018 May 28.
9
Resetting Weight Vectors in MOEA/D for Multiobjective Optimization Problems With Discontinuous Pareto Front.针对具有不连续帕累托前沿的多目标优化问题,在多目标进化算法/分解法(MOEA/D)中重置权重向量
IEEE Trans Cybern. 2022 Sep;52(9):9770-9783. doi: 10.1109/TCYB.2021.3062949. Epub 2022 Aug 18.
10
Combining Crowding Estimation in Objective and Decision Space With Multiple Selection and Search Strategies for Multi-Objective Evolutionary Optimization.在客观和决策空间中结合拥挤估计,以及多目标进化优化中的多种选择和搜索策略。
IEEE Trans Cybern. 2014 Mar;44(3):378-93. doi: 10.1109/TCYB.2013.2256418. Epub 2013 May 27.

引用本文的文献

1
Colonial bacterial memetic algorithm and its application on a darts playing robot.群体细菌模因算法及其在飞镖机器人中的应用。
Sci Rep. 2025 Mar 28;15(1):10757. doi: 10.1038/s41598-025-94245-1.

本文引用的文献

1
NSCSO: a novel multi-objective non-dominated sorting chicken swarm optimization algorithm.NSCSO:一种新型多目标非支配排序鸡群优化算法
Sci Rep. 2024 Feb 21;14(1):4310. doi: 10.1038/s41598-024-54991-0.
2
A non-dominated sorting based multi-objective neural network algorithm.一种基于非支配排序的多目标神经网络算法。
MethodsX. 2023 Mar 26;10:102152. doi: 10.1016/j.mex.2023.102152. eCollection 2023.
3
Improved multi-objective differential evolution algorithm based on a decomposition strategy for multi-objective optimization problems.
基于分解策略的改进多目标差分进化算法用于多目标优化问题。
Sci Rep. 2022 Dec 7;12(1):21176. doi: 10.1038/s41598-022-25440-7.
4
Multipopulation-Based Differential Evolution for Large-Scale Many-Objective Optimization.基于多群体的差分进化算法用于大规模多目标优化
IEEE Trans Cybern. 2023 Dec;53(12):7596-7608. doi: 10.1109/TCYB.2022.3178929. Epub 2023 Nov 29.
5
An improved farmland fertility algorithm for many-objective optimization problems.一种改进的多目标优化问题农田肥力算法。
Sci Rep. 2022 Feb 15;12(1):2545. doi: 10.1038/s41598-022-06329-x.
6
Many-Objective Job-Shop Scheduling: A Multiple Populations for Multiple Objectives-Based Genetic Algorithm Approach.
IEEE Trans Cybern. 2023 Mar;53(3):1460-1474. doi: 10.1109/TCYB.2021.3102642. Epub 2023 Feb 15.
7
Evolutionary Many-Objective Optimization Based on Adversarial Decomposition.基于对抗分解的进化多目标优化。
IEEE Trans Cybern. 2020 Feb;50(2):753-764. doi: 10.1109/TCYB.2018.2872803. Epub 2018 Oct 19.