A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems | Zendy

Mohamed Abdel-Baset | Zendy; Ibrahim M. Hezam | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems

Author(s) -

Mohamed Abdel-Baset,

Ibrahim M. Hezam

Publication year - 2016

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2016909119

Subject(s) - simulated annealing , computer science , pollination , robustness (evolution) , convergence (economics) , algorithm , mathematical optimization , optimization algorithm , adaptive simulated annealing , rate of convergence , pollen , mathematics , botany , biology , computer network , biochemistry , channel (broadcasting) , gene , economics , economic growth

pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. Therefore, it has the advantage of high quality and efficiency. The method combines the standard flower pollination algorithm (FP) with simulated annealing to enhance the search performance and speeds up the global convergence rate. Structural engineering optimization problems are presented to demonstrate the effectiveness and robustness of the proposed algorithm. The experimental results showed that the accuracy of finding the best solution and convergence speed performance of the proposed algorithm is competitive to those achieved by the

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research