Flower pollination algorithm with pollinator attraction
Mergos, Panagiotis E. 
ORCID: https://orcid.org/0000-0003-3817-9520 and Yang, Xin-She ORCID: https://orcid.org/0000-0001-8231-5556
(2022)
Flower pollination algorithm with pollinator attraction.
Evolutionary Intelligence
.
pp. 1-17.
ISSN 1864-5909
[Article]
(Published online first)
(doi:10.1007/s12065-022-00700-7)
|
PDF
- Final accepted version (with author's formatting)
Download (1MB) | Preview |
|
![[img]](https://eprints.mdx.ac.uk/style/images/fileicons/application_msword.png) |
Microsoft Word
- Final accepted version (with author's formatting)
Restricted to Repository staff and depositor only Download (448kB) | |
Abstract
The Flower Pollination Algorithm (FPA) is a highly efficient optimization algorithm that is inspired by the evolution process of flowering plants. In the present study, a modified version of FPA is proposed accounting for an additional feature of flower pollination in nature that is the so-called pollinator attraction. Pollinator attraction represents the natural tendency of flower species to evolve in order to attract pollinators by using their colour, shape and scent as well as nutritious rewards. To reflect this evolution mechanism, the proposed FPA variant with Pollinator Attraction (FPAPA) provides fitter flowers of the population with higher probabilities of achieving pollen transfer via biotic pollination than other flowers. FPAPA is tested against a set of 28 benchmark mathematical functions, defined in IEEE-CEC’13 for real-parameter single-objective optimization problems, as well as structural optimization problems. Numerical experiments show that the modified FPA represents a statistically significant improvement upon the original FPA and that it can outperform other state-of-the-art optimization algorithms offering better and more robust optimal solutions. Additional research is suggested to combine FPAPA with other modified and hybridized versions of FPA to further increase its performance in challenging optimization problems.
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Design Engineering and Mathematics |
| Item ID: | 34589 |
| Notes on copyright: | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections.
The version of record of this article, first published in Evolutionary Intelligence, is available online at Publisher’s website: http://dx.doi.org/10.1007/s12065-022-00700-7 |
| Useful Links: | |
| Depositing User: | Xin-She Yang |
| Date Deposited: | 24 Jan 2022 10:49 |
| Last Modified: | 12 Jan 2023 04:04 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/34589 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)