Flower pollination algorithm for global optimization
Yang, Xin-She 
ORCID: https://orcid.org/0000-0001-8231-5556
(2012)
Flower pollination algorithm for global optimization.
In:
Unconventional Computation and Natural Computation: 11th International Conference, UCNC 2012, Orléan, France, September 3-7, 2012. Proceedings.
Lecture Notes in Computer Science
(7445)
.
Springer, Berlin, pp. 240-249.
ISBN 9783642328930.
[Book Section]
(doi:10.1007/978-3-642-32894-7_27)
Abstract
Flower pollination is an intriguing process in the natural world. Its evolutionary characteristics can be used to design new optimization algorithms. In this paper, we propose a new algorithm, namely, flower pollination algorithm, inspired by the pollination process of flowers. We first use ten test functions to validate the new algorithm, and compare its performance with genetic algorithms and particle swarm optimization. Our simulation results show the flower algorithm is more efficient than both GA and PSO. We also use the flower algorithm to solve a nonlinear design benchmark, which shows the convergence rate is almost exponential.
(from publisher's website)
| Item Type: | Book Section |
|---|---|
| Keywords (uncontrolled): | Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Artificial Intelligence (incl. Robotics) Logics and Meanings of Programs Computational Biology/Bioinformatics |
| Research Areas: | A. > School of Science and Technology > Design Engineering and Mathematics |
| Item ID: | 9578 |
| Useful Links: | |
| Depositing User: | Teddy ~ |
| Date Deposited: | 21 Nov 2012 12:38 |
| Last Modified: | 10 Jun 2019 13:07 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/9578 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)