Title: A complex encoding flower pollination algorithm for constrained engineering optimisation problems

Authors: Mohamed Abdel-Baset; Haizhou Wu; Yongquan Zhou

Addresses: Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah 44519, Egypt ' College of Information Science and Engineering, Guangxi University for Nationalities, Nanning 530006, China; College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210000, China ' College of Information Science and Engineering, Guangxi University for Nationalities, Nanning 530006, China

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.

Keywords: complex-valued encoding; constrained problems; flower pollination algorithm; optimisation.

DOI: 10.1504/IJMMNO.2017.086795

International Journal of Mathematical Modelling and Numerical Optimisation, 2017 Vol.8 No.2, pp.108 - 126

Received: 09 Feb 2017
Accepted: 27 Mar 2017

Published online: 13 Sep 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article