Flower pollination algorithm for global optimization
Book chapter
Yang, X. 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 Berlin Springer.
Chapter title | Flower pollination algorithm for global optimization |
---|---|
Authors | Yang, X. |
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. |
Keywords | 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 |
Book title | Unconventional Computation and Natural Computation: 11th International Conference, UCNC 2012, Orléan, France, September 3-7, 2012. Proceedings |
Publisher | Springer |
Place of publication | Berlin |
Series | Lecture Notes in Computer Science |
ISBN | |
Hardcover | 9783642328930 |
Publication dates | |
2012 | |
Publication process dates | |
Deposited | 21 Nov 2012 |
Output status | Published |
Web address (URL) | http://link.springer.com/chapter/10.1007%2F978-3-642-32894-7_27?LI=true# |
Digital Object Identifier (DOI) | https://doi.org/10.1007/978-3-642-32894-7_27 |
Language | English |
Permalink -
https://repository.mdx.ac.uk/item/83wq0
57
total views0
total downloads0
views this month0
downloads this month