• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

AMOBH:自适应多目标黑洞算法。

AMOBH: Adaptive Multiobjective Black Hole Algorithm.

机构信息

School of Automation, China University of Geosciences, Wuhan 430074, China.

Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems, Wuhan 430074, China.

出版信息

Comput Intell Neurosci. 2017;2017:6153951. doi: 10.1155/2017/6153951. Epub 2017 Nov 23.

DOI:10.1155/2017/6153951
PMID:29348741
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5733773/
Abstract

This paper proposes a new multiobjective evolutionary algorithm based on the black hole algorithm with a new individual density assessment (cell density), called "adaptive multiobjective black hole algorithm" (AMOBH). Cell density has the characteristics of low computational complexity and maintains a good balance of convergence and diversity of the Pareto front. The framework of AMOBH can be divided into three steps. Firstly, the Pareto front is mapped to a new objective space called parallel cell coordinate system. Then, to adjust the evolutionary strategies adaptively, Shannon entropy is employed to estimate the evolution status. At last, the cell density is combined with a dominance strength assessment called cell dominance to evaluate the fitness of solutions. Compared with the state-of-the-art methods SPEA-II, PESA-II, NSGA-II, and MOEA/D, experimental results show that AMOBH has a good performance in terms of convergence rate, population diversity, population convergence, subpopulation obtention of different Pareto regions, and time complexity to the latter in most cases.

摘要

本文提出了一种新的基于黑洞算法的多目标进化算法,该算法具有新的个体密度评估(细胞密度),称为“自适应多目标黑洞算法”(AMOBH)。细胞密度具有计算复杂度低的特点,并保持了帕累托前沿的收敛性和多样性之间的良好平衡。AMOBH 的框架可以分为三个步骤。首先,将帕累托前沿映射到一个称为平行细胞坐标系的新目标空间。然后,为了自适应地调整进化策略,使用香农熵来估计进化状态。最后,将细胞密度与称为细胞优势的优势强度评估相结合,以评估解决方案的适应性。与最先进的 SPEA-II、PESA-II、NSGA-II 和 MOEA/D 方法相比,实验结果表明,在大多数情况下,AMOBH 在收敛速度、种群多样性、种群收敛性、不同 Pareto 区域的子种群获取以及时间复杂度等方面都具有良好的性能。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/c82bc679e708/CIN2017-6153951.alg.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/ae63bae1e16e/CIN2017-6153951.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/05ef747cd740/CIN2017-6153951.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/51c92c710c92/CIN2017-6153951.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/213e5889e5e9/CIN2017-6153951.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/88a8aa328642/CIN2017-6153951.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/3d03c4e6d49d/CIN2017-6153951.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/94aa38fbb7e4/CIN2017-6153951.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/79903a61b1b0/CIN2017-6153951.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/3e81e3a0d567/CIN2017-6153951.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/02ae7703e37d/CIN2017-6153951.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/5e6d024c7bd8/CIN2017-6153951.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/e57a04a59fc4/CIN2017-6153951.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/2d73bb8ebfcd/CIN2017-6153951.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/e1df2f8d9e53/CIN2017-6153951.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/c82bc679e708/CIN2017-6153951.alg.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/ae63bae1e16e/CIN2017-6153951.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/05ef747cd740/CIN2017-6153951.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/51c92c710c92/CIN2017-6153951.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/213e5889e5e9/CIN2017-6153951.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/88a8aa328642/CIN2017-6153951.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/3d03c4e6d49d/CIN2017-6153951.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/94aa38fbb7e4/CIN2017-6153951.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/79903a61b1b0/CIN2017-6153951.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/3e81e3a0d567/CIN2017-6153951.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/02ae7703e37d/CIN2017-6153951.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/5e6d024c7bd8/CIN2017-6153951.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/e57a04a59fc4/CIN2017-6153951.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/2d73bb8ebfcd/CIN2017-6153951.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/e1df2f8d9e53/CIN2017-6153951.alg.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/aa05/5733773/c82bc679e708/CIN2017-6153951.alg.003.jpg

相似文献

1
AMOBH: Adaptive Multiobjective Black Hole Algorithm.AMOBH:自适应多目标黑洞算法。
Comput Intell Neurosci. 2017;2017:6153951. doi: 10.1155/2017/6153951. Epub 2017 Nov 23.
2
Evaluating the epsilon-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions.评估基于ε-支配的多目标进化算法以快速计算帕累托最优解。
Evol Comput. 2005 Winter;13(4):501-25. doi: 10.1162/106365605774666895.
3
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.
4
Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.全局WASF-GA:一种用于逼近整个帕累托最优前沿的多目标优化进化算法。
Evol Comput. 2017 Summer;25(2):309-349. doi: 10.1162/EVCO_a_00175. Epub 2016 Feb 8.
5
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit.可调节难度和可扩展约束多目标测试问题工具包。
Evol Comput. 2020 Fall;28(3):339-378. doi: 10.1162/evco_a_00259. Epub 2019 May 23.
6
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.
7
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.
8
Combining convergence and diversity in evolutionary multiobjective optimization.进化多目标优化中收敛性与多样性的结合
Evol Comput. 2002 Fall;10(3):263-82. doi: 10.1162/106365602760234108.
9
A Two-Stage Multiobjective Evolutionary Algorithm for Multiobjective Multidepot Vehicle Routing Problem With Time Windows.一种用于带时间窗的多目标多配送中心车辆路径问题的两阶段多目标进化算法。
IEEE Trans Cybern. 2019 Jul;49(7):2467-2478. doi: 10.1109/TCYB.2018.2821180. Epub 2018 Apr 16.
10
A Many-Objective Optimization Algorithm Based on Weight Vector Adjustment.基于权重向量调整的多目标优化算法。
Comput Intell Neurosci. 2018 Oct 22;2018:4527968. doi: 10.1155/2018/4527968. eCollection 2018.

本文引用的文献

1
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy.一种使用逐一选择策略的多目标进化算法。
IEEE Trans Cybern. 2017 Sep;47(9):2689-2702. doi: 10.1109/TCYB.2016.2638902. Epub 2017 Jan 9.
2
Adaptive particle swarm optimization.自适应粒子群优化算法
IEEE Trans Syst Man Cybern B Cybern. 2009 Dec;39(6):1362-81. doi: 10.1109/TSMCB.2009.2015956. Epub 2009 Apr 7.
3
Comparison of multiobjective evolutionary algorithms: empirical results.多目标进化算法的比较:实证结果
Evol Comput. 2000 Summer;8(2):173-95. doi: 10.1162/106365600568202.