Cargando…
An improved poor and rich optimization algorithm
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 probl...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9910665/ https://www.ncbi.nlm.nih.gov/pubmed/36757967 http://dx.doi.org/10.1371/journal.pone.0267633 |
_version_ | 1784884831185797120 |
---|---|
author | Wang, Yanjiao Zhou, Shengnan |
author_facet | Wang, Yanjiao Zhou, Shengnan |
author_sort | Wang, Yanjiao |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-9910665 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-99106652023-02-10 An improved poor and rich optimization algorithm Wang, Yanjiao Zhou, Shengnan PLoS One Research Article 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. Public Library of Science 2023-02-09 /pmc/articles/PMC9910665/ /pubmed/36757967 http://dx.doi.org/10.1371/journal.pone.0267633 Text en © 2023 Wang, Zhou https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Wang, Yanjiao Zhou, Shengnan An improved poor and rich optimization algorithm |
title | An improved poor and rich optimization algorithm |
title_full | An improved poor and rich optimization algorithm |
title_fullStr | An improved poor and rich optimization algorithm |
title_full_unstemmed | An improved poor and rich optimization algorithm |
title_short | An improved poor and rich optimization algorithm |
title_sort | improved poor and rich optimization algorithm |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9910665/ https://www.ncbi.nlm.nih.gov/pubmed/36757967 http://dx.doi.org/10.1371/journal.pone.0267633 |
work_keys_str_mv | AT wangyanjiao animprovedpoorandrichoptimizationalgorithm AT zhoushengnan animprovedpoorandrichoptimizationalgorithm AT wangyanjiao improvedpoorandrichoptimizationalgorithm AT zhoushengnan improvedpoorandrichoptimizationalgorithm |