Abstract:Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new method is developed based on the flower pollination algorithm combined with chaos theory (IFPCH) to solve definite integral. The definite integral has wide ranging applications in operation research, computer science, mathematics, mechanics, physics, and civil and mechanical engineering. Definite integral has always been useful in biostatistics to evaluate distribution functio… Show more
“…The authors compare the FPA variant they devise to the basic harmony search algorithm and one of its variants, but the parameters of these algorithms and the criteria of comparison (total number of function evaluations) are missing. Publication 12 [33]: Abdel-Raouf et al [33] extend in this work the basic FPA by including chaotic search. They apply this algorithm to the definite integral problem.…”
Section: Publication 10 [31]mentioning
confidence: 95%
“…We categorise them into 4 classes: (1) The works proposed by Yang and his co-authors [18,[22][23][24][25], (2) the works just applying the FPA for solving optimisation problems [27][28][29][30], (3) FPA extensions [31][32][33][34][35] and (4) the works analysing the FPA performances [36][37][38]. These contributions are analysed with greater detail in the next section.…”
Section: The Choice Between Local Pollination and Global Pollination Ismentioning
“…The authors compare the FPA variant they devise to the basic harmony search algorithm and one of its variants, but the parameters of these algorithms and the criteria of comparison (total number of function evaluations) are missing. Publication 12 [33]: Abdel-Raouf et al [33] extend in this work the basic FPA by including chaotic search. They apply this algorithm to the definite integral problem.…”
Section: Publication 10 [31]mentioning
confidence: 95%
“…We categorise them into 4 classes: (1) The works proposed by Yang and his co-authors [18,[22][23][24][25], (2) the works just applying the FPA for solving optimisation problems [27][28][29][30], (3) FPA extensions [31][32][33][34][35] and (4) the works analysing the FPA performances [36][37][38]. These contributions are analysed with greater detail in the next section.…”
Section: The Choice Between Local Pollination and Global Pollination Ismentioning
“…In [52], the FPA was hybridised with the particle swarm optimisation algorithm to solve the active power loss. A chaotic FPA was introduced in [40,65]. The FPA was also used in [59] for wireless sensor network optimisation.…”
Section: The Flower Pollination Algorithmmentioning
“…Moreover, it depends on its initial condition and parameters [32][33][34]. Applications of chaos has several disciplines including operations research, physics, engineering, economics, biology, philosophy and computer science [35][36][37]. Recently chaos has been extended to various optimization areas because it can more easily escape from local minima and improve global convergence in comparison with other stochastic optimization algorithms [34][35][36][37][38].…”
Branch and Bound technique (B&B) is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Flower pollination Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of Flower pollination Meta-heuristic Algorithm, (FPPSO), for solving integer programming problems. The proposed algorithm combines the standard flower pollination algorithm (FP) with the particle swarm optimization (PSO) algorithm to improve the searching accuracy. Numerical results show that the FPPSO is able to obtain the optimal results in comparison to traditional methods (branch and bound) and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.