Work

BSKF: Binary Simulated Kalman Filter

Year: 2015
Type: conference-paper
Abstract: Inspired by the estimation capability of Kalman \nfilter, 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 combinatorial optimization problems, an extended version of SKF algorithm, which is termed as Binary SKF (BSKF), is proposed.Similar to existing approach, a mapping function is used to enable the SKF algorithm to operate in binary search space. A set of traveling salesman problems are used to evaluate the performance of the proposed BSKF against Binary Gravitational Search Algorithm (BGSA) and Binary Particle Swarm Optimization (BPSO).
Language: English
Open Access status: green
OpenAlex ID: W2364041186
FWCI: 2.137
Cites:
Cited by: 24
Related to: 10