BSKF: Binary Simulated Kalman Filter

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...

Full description

Bibliographic Details
Main Authors:	Zulkifli, Md. Yusof, Ismail, Ibrahim, Siti Nurzulaikha, Satiman, Zuwairie, Ibrahim, Nor Hidayati, Abd Aziz, Nor Azlina, Ab. Aziz
Format:	Conference or Workshop Item
Language:	English English
Published:	2015
Subjects:	TK Electrical engineering. Electronics Nuclear engineering
Online Access:	http://umpir.ump.edu.my/id/eprint/11954/ http://umpir.ump.edu.my/id/eprint/11954/ http://umpir.ump.edu.my/id/eprint/11954/7/BSKF-%20Binary%20Simulated%20Kalman%20Filter-abstract.pdf http://umpir.ump.edu.my/id/eprint/11954/1/BSKF-%20Binary%20Simulated%20Kalman%20Filter.pdf

id	ump-11954
recordtype	eprints
spelling	ump-119542018-02-08T03:19:34Z http://umpir.ump.edu.my/id/eprint/11954/ BSKF: Binary Simulated Kalman Filter Zulkifli, Md. Yusof Ismail, Ibrahim Siti Nurzulaikha, Satiman Zuwairie, Ibrahim Nor Hidayati, Abd Aziz Nor Azlina, Ab. Aziz TK Electrical engineering. Electronics Nuclear engineering 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 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). 2015 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/11954/7/BSKF-%20Binary%20Simulated%20Kalman%20Filter-abstract.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/11954/1/BSKF-%20Binary%20Simulated%20Kalman%20Filter.pdf Zulkifli, Md. Yusof and Ismail, Ibrahim and Siti Nurzulaikha, Satiman and Zuwairie, Ibrahim and Nor Hidayati, Abd Aziz and Nor Azlina, Ab. Aziz (2015) BSKF: Binary Simulated Kalman Filter. In: International Conference on Artificial Intelligence, Modelling and Simuation, 2-4 December 2015 , Kota Kinabalu, Sabah. pp. 1-5.. http://uksim.info/aims2015/CD/data/8675a077.pdf
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English English
topic	TK Electrical engineering. Electronics Nuclear engineering
spellingShingle	TK Electrical engineering. Electronics Nuclear engineering Zulkifli, Md. Yusof Ismail, Ibrahim Siti Nurzulaikha, Satiman Zuwairie, Ibrahim Nor Hidayati, Abd Aziz Nor Azlina, Ab. Aziz BSKF: Binary Simulated Kalman Filter
description	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 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).
format	Conference or Workshop Item
author	Zulkifli, Md. Yusof Ismail, Ibrahim Siti Nurzulaikha, Satiman Zuwairie, Ibrahim Nor Hidayati, Abd Aziz Nor Azlina, Ab. Aziz
author_facet	Zulkifli, Md. Yusof Ismail, Ibrahim Siti Nurzulaikha, Satiman Zuwairie, Ibrahim Nor Hidayati, Abd Aziz Nor Azlina, Ab. Aziz
author_sort	Zulkifli, Md. Yusof
title	BSKF: Binary Simulated Kalman Filter
title_short	BSKF: Binary Simulated Kalman Filter
title_full	BSKF: Binary Simulated Kalman Filter
title_fullStr	BSKF: Binary Simulated Kalman Filter
title_full_unstemmed	BSKF: Binary Simulated Kalman Filter
title_sort	bskf: binary simulated kalman filter
publishDate	2015
url	http://umpir.ump.edu.my/id/eprint/11954/ http://umpir.ump.edu.my/id/eprint/11954/ http://umpir.ump.edu.my/id/eprint/11954/7/BSKF-%20Binary%20Simulated%20Kalman%20Filter-abstract.pdf http://umpir.ump.edu.my/id/eprint/11954/1/BSKF-%20Binary%20Simulated%20Kalman%20Filter.pdf
first_indexed	2023-09-18T22:13:03Z
last_indexed	2023-09-18T22:13:03Z
_version_	1777415155920928768

BSKF: Binary Simulated Kalman Filter

Similar Items