Enhancing Simulated Kalman Filter Algorithm using Current Optimum Opposition-based Learning
Simulated Kalman filter (SKF) is a new population-based optimization algorithm inspired by estimation capability of Kalman filter. Each agent in SKF is regarded as a Kalman filter. Based on the mechanism of Kalman filtering, the SKF includes prediction, measurement, and estimation process to search for global optimum. The SKF has been shown to yield good performance in solving benchmark optimization problems. However, the exploration capability of SKF could be further improved. From literature, current optimum opposition-based learning (COOBL) has been employed to increase the diversity (exploration) of search algorithm by allowing current population to be compared with an opposite population. By employing this concept, more potential agents are generated to explore more promising regions that exist in the solution domain. Therefore, this paper intends to improve the exploration capability of SKF through the application of COOBL. The COOBL is employed after the estimation process of SKF. Experimental results over the IEEE congress on evolutionary computation (CEC) 2014 benchmark functions indicate that current optimum opposition-based simulated Kalman filter (COOBSKF) improved the exploration capability of SKF significantly. The COOBSKF also has been compared with five other optimization algorithms and outperforms them all.