A complex encoding flower pollination algorithm for constrained engineering optimisation problems
by Mohamed Abdel-Baset; Haizhou Wu; Yongquan Zhou
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 8, No. 2, 2017

Abstract: In this paper, we apply a complex encoding flower pollination algorithm (CEFPA) to solve constrained engineering optimisation problems. The performance of the proposed algorithm is tested using five standard benchmark functions and four engineering problems. A comparative study of the results with those obtained well-known algorithms is used to validate and verify the efficiency of CEFPA. The CEFPA performs expressively better in terms of the speed and stability for the optimal solution.

Online publication date: Wed, 13-Sep-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com