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.
Description
Flower Pollination Algorithm for Global Optimization
%0 Generic
%1 yang2013flower
%A Yang, Xin-She
%D 2013
%K algorithms coevolutionary genetic
%R 10.1007/978-3-642-32894-7_27
%T Flower Pollination Algorithm for Global Optimization
%U http://arxiv.org/abs/1312.5673
%X 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.
@misc{yang2013flower,
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.},
added-at = {2014-01-22T18:01:01.000+0100},
author = {Yang, Xin-She},
biburl = {https://www.bibsonomy.org/bibtex/226beeabb5db17fe9b35d7c930a4fc266/kmukhar},
description = {Flower Pollination Algorithm for Global Optimization},
doi = {10.1007/978-3-642-32894-7_27},
interhash = {b67554453f00650ea56d24f81e47adc8},
intrahash = {26beeabb5db17fe9b35d7c930a4fc266},
keywords = {algorithms coevolutionary genetic},
note = {cite arxiv:1312.5673Comment: 10 pages},
timestamp = {2014-01-22T18:01:01.000+0100},
title = {Flower Pollination Algorithm for Global Optimization},
url = {http://arxiv.org/abs/1312.5673},
year = 2013
}