The Performance of Binary Artificial Bee Colony (BABC) in Structure Selection of Polynomial NARX and NARMAX Models

Azlee Zabidi, Nooritawati Md Tahir, Ihsan Mohd Yassin, Zairi Ismael Rizman


This paper explores the capability of the Binary Artificial Bee Colony (BABC) algorithm for feature selection of Nonlinear Autoregressive Moving Average with Exogenous Inputs (NARMAX) model, and compares its implementation with the Binary Particle Swarm Optimization (BPSO) algorithm. A binarized modification of the BABC algorithm was used to perform structure selection of the NARMAX model on a Flexible Robot Arm (FRA) dataset. The solution quality and convergence was compared with the BPSO optimization algorithm. Fitting and validation tests were performed using the One-Step Ahead (OSA), correlation and histogram tests. BABC was able to outperform BPSO in terms of convergence consistency with equal solution quality. Additionally, it was discovered that BABC was less prone to converge to local minima while BPSO was able to converge faster. Results from this study showed that BABC was better-suited for structure selection in huge dataset and the convergence has been proven to be more consistent relative to BPSO.


system identification; binary artificial bee colony; binary particle swarm optimization; nonlinear auto-regressive moving average with exogenous; flexible robot arm

Full Text:




Published by INSIGHT - Indonesian Society for Knowledge and Human Development