DefinePK

Abstract

Inspired by the estimation capability of Kalman filter, we have recently introduced a novel estimation-based optimization algorithm called simulated Kalman filter (SKF). Every agent in SKF is regarded as a Kalman filter. Based on the mechanism of Kalman filtering and measurement process, every agent estimates the global minimum/maximum. Measurement, which is required in Kalman filtering, is mathematically modelled and simulated. Agents communicate among them to update and improve the solution during the search process. However, the SKF is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, a new distance evaluated approach is proposed and combined with SKF. The performance of the proposed distance evaluated SKF (DESKF) is compared against two other discrete population-based optimization algorithms, namely, binary particle swarm optimization (BPSO) and binary gravitational search algorithm (BGSA). A set of traveling salesman problems are used to evaluate the performance of the proposed DESKF. Based on the analysis of experimental results, we found that the proposed AMSKF is as competitive as BGSA but the BPSO is superior than the both DESKF and BGSA.