Abstract

Abstract In this paper, a novel design of the flower pollination algorithm is presented for model identification problems in nonlinear active noise control systems. The recently introduced flower pollination based heuristics is implemented to minimize the mean squared error based merit/cost function representing the scenarios of active noise control system with linear/nonlinear and primary/secondary paths based on the sinusoidal signal, random and complex random signals as noise interferences. The flower pollination heuristics based active noise controllers are formulated through exploitation of nonlinear filtering with Volterra series. The comparative study on statistical observations in terms of accuracy, convergence and complexity measures demonstrates that the proposed meta-heuristic of flower pollination algorithm is reliable, accurate, stable as well as robust for active noise control system. The accuracy of the proposed nature inspired computing of flower pollination is in good agreement with the state of the art counterpart solvers based on variants of genetic algorithms, particle swarm optimization, backtracking search optimization algorithm, fireworks optimization algorithm along with their memetic combination with local search methodologies. Moreover, the central tendency and variation based statistical indices further validate the consistency and reliability of the proposed scheme mimic the mathematical model for the process of flower pollination systems.

Details

Title
Flower Pollination Heuristics for Nonlinear Active Noise Control Systems
Author
Khan, Wasim Ullah; He, Yigang; Muhammad Asif Zahoor Raja; Naveed Ishtiaq Chaudhary; Zeshan Aslam Khan; Syed Muslim Shah
Pages
815-834
Section
ARTICLE
Publication year
2021
Publication date
2021
Publisher
Tech Science Press
ISSN
1546-2218
e-ISSN
1546-2226
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2484418669
Copyright
© 2021. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.