• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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 Cross-Reference Line Method Based Multiobjective Evolutionary Algorithm to Enhance Population Diversity.

机构信息

Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, 947 Heping Avenue, Wuhan 430081, China.

Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, 947 Heping Avenue, Wuhan 430081, China.

出版信息

Comput Intell Neurosci. 2020 Jul 18;2020:7179647. doi: 10.1155/2020/7179647. eCollection 2020.

DOI:10.1155/2020/7179647
PMID:32765597
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7388677/
Abstract

Multiobjective evolutionary algorithms (MOEAs) with higher population diversity have been extensively presented in literature studies and shown great potential in the approximate Pareto front (PF). Especially, in the recent development of MOEAs, the reference line method is increasingly favored due to its diversity enhancement nature and auxiliary selection mechanism based on the uniformly distributed reference line. However, the existing reference line method ignores the nadir point and consequently causes the Pareto incompatibility problem, which makes the algorithm convergence worse. To address this issue, a multiobjective evolutionary algorithm based on the adaptive cross-reference line method, called MOEA-CRL, is proposed under the framework of the indicator-based MOEAs. Based on the dominant penalty distance (DPD) indicator, the cross-reference line method can not only solve the Pareto incompatibility problem but also enhance the population diversity on the convex PF and improve the performances of MOEA-CRL for irregular PF. In addition, the MOEA-CRL adjusts the distribution of the cross-reference lines directly defined by the DPD indicator according to the contributing solutions. Therefore, the adaptation of cross-reference lines will not be affected by the population size and the uniform distribution of cross-reference lines can be maintained. The MOEA-CRL is examined and compared with other MOEAs on several benchmark problems. The experimental results show that the MOEA-CRL is superior to several advanced MOEAs, especially on the convex PF. The MOEA-CRL exhibits the flexibility in population size setting and the great versatility in various multiobjective optimization problems (MOPs) and many-objective optimization problems (MaOPs).

摘要

多目标进化算法(MOEAs)具有更高的种群多样性,在文献研究中得到了广泛的展示,并在近似 Pareto 前沿(PF)中显示出巨大的潜力。特别是在 MOEAs 的最新发展中,由于其多样性增强的性质和基于均匀分布参考线的辅助选择机制,参考线方法越来越受到青睐。然而,现有的参考线方法忽略了极点,从而导致 Pareto 不兼容性问题,这使得算法的收敛性变差。为了解决这个问题,在基于指标的 MOEAs 框架下,提出了一种基于自适应交叉参考线方法的多目标进化算法,称为 MOEA-CRL。基于支配惩罚距离(DPD)指标,交叉参考线方法不仅可以解决 Pareto 不兼容性问题,而且可以增强凸 PF 上的种群多样性,提高 MOEA-CRL 在不规则 PF 上的性能。此外,MOEA-CRL 根据贡献解直接调整由 DPD 指标定义的交叉参考线的分布。因此,交叉参考线的自适应不会受到种群大小的影响,并且可以保持交叉参考线的均匀分布。在几个基准问题上对 MOEA-CRL 进行了检验和比较。实验结果表明,MOEA-CRL 优于几个先进的 MOEAs,特别是在凸 PF 上。MOEA-CRL 在种群大小设置上具有灵活性,在各种多目标优化问题(MOPs)和多目标优化问题(MaOPs)中具有很强的通用性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/754135336ce8/CIN2020-7179647.alg.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5fef6318580c/CIN2020-7179647.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/9d3e97d010fb/CIN2020-7179647.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5b8af3c66a9f/CIN2020-7179647.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/297e452b1b69/CIN2020-7179647.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/100d213fae48/CIN2020-7179647.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/be439ad12e0a/CIN2020-7179647.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/dcf529d764ba/CIN2020-7179647.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5ca635f42c98/CIN2020-7179647.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/42619b8903d2/CIN2020-7179647.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/4ec19dd44c79/CIN2020-7179647.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/fd9903042acc/CIN2020-7179647.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5269e59f0c43/CIN2020-7179647.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/c8d8f6326008/CIN2020-7179647.013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/53de5c5ff15f/CIN2020-7179647.014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/9dad148ea496/CIN2020-7179647.015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/be10d37c1a79/CIN2020-7179647.016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/1e408c93ab13/CIN2020-7179647.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/6ecda86735a7/CIN2020-7179647.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/43348f7778db/CIN2020-7179647.alg.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/f28d8ca59c1b/CIN2020-7179647.alg.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/754135336ce8/CIN2020-7179647.alg.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5fef6318580c/CIN2020-7179647.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/9d3e97d010fb/CIN2020-7179647.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5b8af3c66a9f/CIN2020-7179647.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/297e452b1b69/CIN2020-7179647.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/100d213fae48/CIN2020-7179647.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/be439ad12e0a/CIN2020-7179647.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/dcf529d764ba/CIN2020-7179647.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5ca635f42c98/CIN2020-7179647.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/42619b8903d2/CIN2020-7179647.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/4ec19dd44c79/CIN2020-7179647.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/fd9903042acc/CIN2020-7179647.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/5269e59f0c43/CIN2020-7179647.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/c8d8f6326008/CIN2020-7179647.013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/53de5c5ff15f/CIN2020-7179647.014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/9dad148ea496/CIN2020-7179647.015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/be10d37c1a79/CIN2020-7179647.016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/1e408c93ab13/CIN2020-7179647.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/6ecda86735a7/CIN2020-7179647.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/43348f7778db/CIN2020-7179647.alg.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/f28d8ca59c1b/CIN2020-7179647.alg.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aed5/7388677/754135336ce8/CIN2020-7179647.alg.005.jpg

相似文献

1
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.
2
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.
3
A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm.一种基于简约快速超体积指标的多目标进化算法。
IEEE Trans Cybern. 2015 Oct;45(10):2202-13. doi: 10.1109/TCYB.2014.2367526. Epub 2014 Dec 2.
4
Guiding Evolutionary Multiobjective Optimization With Generic Front Modeling.基于通用前沿建模的引导式进化多目标优化
IEEE Trans Cybern. 2020 Mar;50(3):1106-1119. doi: 10.1109/TCYB.2018.2883914. Epub 2018 Dec 18.
5
MOEA/HD: A Multiobjective Evolutionary Algorithm Based on Hierarchical Decomposition.MOEA/HD:一种基于层次分解的多目标进化算法。
IEEE Trans Cybern. 2019 Feb;49(2):517-526. doi: 10.1109/TCYB.2017.2779450. Epub 2017 Dec 25.
6
Hybrid selection based multi/many-objective evolutionary algorithm.基于混合选择的多目标/多目标进化算法。
Sci Rep. 2022 Apr 27;12(1):6861. doi: 10.1038/s41598-022-10997-0.
7
MOEA/D with adaptive weight adjustment.带自适应权重调整的 MOEA/D。
Evol Comput. 2014 Summer;22(2):231-64. doi: 10.1162/EVCO_a_00109. Epub 2014 Feb 6.
8
An Evolutionary Algorithm with Double-Level Archives for Multiobjective Optimization.具有双层档案的进化算法用于多目标优化。
IEEE Trans Cybern. 2015 Sep;45(9):1851-63. doi: 10.1109/TCYB.2014.2360923. Epub 2014 Oct 16.
9
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.
10
A hierarchical evolutionary algorithm for multiobjective optimization in IMRT.用于调强放射治疗中多目标优化的分层进化算法。
Med Phys. 2010 Sep;37(9):4986-97. doi: 10.1118/1.3478276.

本文引用的文献

1
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.
2
MOEA/D with adaptive weight adjustment.带自适应权重调整的 MOEA/D。
Evol Comput. 2014 Summer;22(2):231-64. doi: 10.1162/EVCO_a_00109. Epub 2014 Feb 6.