Single-solution Simulated Kalman Filter algorithm for global optimisation problems

• Main Authors: Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.
• Format: Article
• Published: Springer India 2018
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048753101&doi=10.1007%2fs12046-018-0888-9&partnerID=40&md5=c49a3b2e30fb4f046e00761c120deaeb; http://eprints.utp.edu.my/21477/

This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. In comparison, the proposed ssSKF algorithm supersedes the original population-based Simulated Kalman Filter (SKF) algorithm by operating with only a single agent, and having less parameters to be tuned. In the proposed ssSKF algorithm, the initialisation parameters are not constants, but they are produced by random numbers taken from a normal distribution in the range of 0, 1, thus excluding them from tuning requirement. In order to balance between the exploration and exploitation in ssSKF, the proposed algorithm uses an adaptive neighbourhood mechanism during its prediction step. The proposed ssSKF algorithm is tested using the 30 benchmark functions of CEC 2014, and its performance is compared to that of the original SKF algorithm, Black Hole (BH) algorithm, Particle Swarm Optimisation (PSO) algorithm, Grey Wolf Optimiser (GWO) algorithm and Genetic Algorithm (GA). The results show that the proposed ssSKF algorithm is a promising approach and able to outperform GWO and GA algorithms, significantly. © 2018, Indian Academy of Sciences.