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

立即免费体验

一种改进的穷举优化算法。

An improved poor and rich optimization algorithm.

机构信息

Department of Electrical Engineering, Northeast Electric Power University, Jilin, China.

出版信息

PLoS One. 2023 Feb 9;18(2):e0267633. doi: 10.1371/journal.pone.0267633. eCollection 2023.

DOI:10.1371/journal.pone.0267633
PMID:36757967
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9910665/
Abstract

The poor and rich optimization algorithm (PRO) is a new bio-inspired meta-heuristic algorithm based on the behavior of the poor and the rich. PRO suffers from low convergence speed and premature convergence, and easily traps in the local optimum, when solving very complex function optimization problems. To overcome these limitations, this study proposes an improved poor and rich optimization (IPRO) algorithm. First, to meet the requirements of convergence speed and swarm diversity requirements across different evolutionary stages of the algorithm, the population is dynamically divided into the poor and rich sub-population. Second, for the rich sub-population, this study designs a novel individual updating mechanism that learns from the evolution information of the global optimum individual and that of the poor sub-population simultaneously, to further accelerate convergence speed and minimize swarm diversity loss. Third, for the poor sub-population, this study designs a novel individual updating mechanism that improves some evolution information by learning alternately from the rich and Gauss distribution, gradually improves evolutionary genes, and maintains swarm diversity. The IPRO is then compared with four state-of-the-art swarm evolutionary algorithms with various characteristics on the CEC 2013 test suite. Experimental results demonstrate the competitive advantages of IPRO in convergence precision and speed when solving function optimization problems.

摘要

穷人和富人优化算法(PRO)是一种新的基于穷人和富人行为的仿生元启发式算法。在解决非常复杂的函数优化问题时,PRO 算法存在收敛速度慢和早熟收敛的问题,容易陷入局部最优解。为了克服这些局限性,本研究提出了一种改进的穷人和富人优化(IPRO)算法。首先,为了满足算法不同进化阶段的收敛速度和群体多样性要求,将种群动态地划分为穷人和富人子群。其次,对于富人子群,本研究设计了一种新的个体更新机制,同时从全局最优个体和穷人子群的进化信息中学习,以进一步提高收敛速度并最小化群体多样性损失。第三,对于穷人子群,本研究设计了一种新的个体更新机制,通过从富人子群和高斯分布中交替学习来改进一些进化信息,逐渐改进进化基因,并保持群体多样性。然后,将 IPRO 与四个具有不同特点的最先进的群体进化算法在 CEC 2013 测试套件上进行比较。实验结果表明,IPRO 在解决函数优化问题时在收敛精度和速度方面具有竞争优势。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/66b004e7f215/pone.0267633.g028.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/7bbeefb958f9/pone.0267633.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/17c96c7d114f/pone.0267633.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/01ee65883604/pone.0267633.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/9adef8d7ad67/pone.0267633.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/d07ffb99d624/pone.0267633.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3c2013625508/pone.0267633.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/99c6999315fa/pone.0267633.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ab2b474cc146/pone.0267633.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ca53182f5c1d/pone.0267633.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/bf4c43e9519d/pone.0267633.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/11014302d470/pone.0267633.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ec158a34ebc6/pone.0267633.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/80d30a084150/pone.0267633.g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/6d19e9ddd4ac/pone.0267633.g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/6667f357b228/pone.0267633.g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3aeaaf42a6a6/pone.0267633.g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/518c3549c4b9/pone.0267633.g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ece95b5bf90c/pone.0267633.g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/19f7072a5b2d/pone.0267633.g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/b92d9a710257/pone.0267633.g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/bb23885434dc/pone.0267633.g021.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/a433b5bc4504/pone.0267633.g022.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/58f67261e29c/pone.0267633.g023.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3369132a055c/pone.0267633.g024.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/61cfeefee2de/pone.0267633.g025.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/376b2c34296d/pone.0267633.g026.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/23459aadc256/pone.0267633.g027.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/66b004e7f215/pone.0267633.g028.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/7bbeefb958f9/pone.0267633.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/17c96c7d114f/pone.0267633.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/01ee65883604/pone.0267633.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/9adef8d7ad67/pone.0267633.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/d07ffb99d624/pone.0267633.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3c2013625508/pone.0267633.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/99c6999315fa/pone.0267633.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ab2b474cc146/pone.0267633.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ca53182f5c1d/pone.0267633.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/bf4c43e9519d/pone.0267633.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/11014302d470/pone.0267633.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ec158a34ebc6/pone.0267633.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/80d30a084150/pone.0267633.g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/6d19e9ddd4ac/pone.0267633.g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/6667f357b228/pone.0267633.g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3aeaaf42a6a6/pone.0267633.g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/518c3549c4b9/pone.0267633.g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/ece95b5bf90c/pone.0267633.g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/19f7072a5b2d/pone.0267633.g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/b92d9a710257/pone.0267633.g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/bb23885434dc/pone.0267633.g021.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/a433b5bc4504/pone.0267633.g022.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/58f67261e29c/pone.0267633.g023.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/3369132a055c/pone.0267633.g024.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/61cfeefee2de/pone.0267633.g025.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/376b2c34296d/pone.0267633.g026.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/23459aadc256/pone.0267633.g027.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/3c5a/9910665/66b004e7f215/pone.0267633.g028.jpg

相似文献

1
An improved poor and rich optimization algorithm.一种改进的穷举优化算法。
PLoS One. 2023 Feb 9;18(2):e0267633. doi: 10.1371/journal.pone.0267633. eCollection 2023.
2
Modified Marine Predators Algorithm hybridized with teaching-learning mechanism for solving optimization problems.结合教学学习机制的改进海洋捕食者算法用于求解优化问题
Math Biosci Eng. 2023 Jan;20(1):93-127. doi: 10.3934/mbe.2023006. Epub 2022 Sep 29.
3
Swarming genetic algorithm: A nested fully coupled hybrid of genetic algorithm and particle swarm optimization.群体遗传算法:遗传算法和粒子群优化的嵌套完全耦合混合算法。
PLoS One. 2022 Sep 23;17(9):e0275094. doi: 10.1371/journal.pone.0275094. eCollection 2022.
4
Rank-driven salp swarm algorithm with orthogonal opposition-based learning for global optimization.基于正交反向学习的秩驱动樽海鞘群算法用于全局优化
Appl Intell (Dordr). 2022;52(7):7922-7964. doi: 10.1007/s10489-021-02776-7. Epub 2021 Oct 15.
5
An improved firefly algorithm with dynamic self-adaptive adjustment.带动态自适应调整的萤火虫算法改进版。
PLoS One. 2021 Oct 7;16(10):e0255951. doi: 10.1371/journal.pone.0255951. eCollection 2021.
6
Multi/Many-Objective Particle Swarm Optimization Algorithm Based on Competition Mechanism.基于竞争机制的多/多目标粒子群优化算法。
Comput Intell Neurosci. 2020 Feb 19;2020:5132803. doi: 10.1155/2020/5132803. eCollection 2020.
7
Particle Swarm Optimization with Double Learning Patterns.具有双学习模式的粒子群优化算法
Comput Intell Neurosci. 2016;2016:6510303. doi: 10.1155/2016/6510303. Epub 2015 Dec 27.
8
An Improved Chicken Swarm Optimization Algorithm for Solving Multimodal Optimization Problems.一种改进的鸡群优化算法求解多模态优化问题。
Comput Intell Neurosci. 2022 Nov 22;2022:5359732. doi: 10.1155/2022/5359732. eCollection 2022.
9
An improved group teaching optimization algorithm for global function optimization.一种用于全局函数优化的改进群组教学优化算法。
Sci Rep. 2022 Jul 4;12(1):11267. doi: 10.1038/s41598-022-15170-1.
10
A Novel Particle Swarm Optimization Algorithm for Global Optimization.一种用于全局优化的新型粒子群优化算法。
Comput Intell Neurosci. 2016;2016:9482073. doi: 10.1155/2016/9482073. Epub 2016 Jan 21.

引用本文的文献

1
Optimal truss design with MOHO: A multi-objective optimization perspective.基于 MOHO 的最优桁架设计:多目标优化视角。
PLoS One. 2024 Aug 19;19(8):e0308474. doi: 10.1371/journal.pone.0308474. eCollection 2024.

本文引用的文献

1
Artificial Fish Swarm Optimization Based Method to Identify Essential Proteins.基于人工鱼群优化算法的鉴定必需蛋白的方法
IEEE/ACM Trans Comput Biol Bioinform. 2020 Mar-Apr;17(2):495-505. doi: 10.1109/TCBB.2018.2865567. Epub 2018 Aug 15.
2
Recurrent neural network-based modeling of gene regulatory network using elephant swarm water search algorithm.基于循环神经网络并采用大象群水搜索算法的基因调控网络建模
J Bioinform Comput Biol. 2017 Aug;15(4):1750016. doi: 10.1142/S0219720017500160. Epub 2017 Jun 13.
3
Regulation of pattern recognition receptor signalling in plants.
植物模式识别受体信号转导的调控。
Nat Rev Immunol. 2016 Sep;16(9):537-52. doi: 10.1038/nri.2016.77. Epub 2016 Aug 1.