Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter

Inspired by the estimation capability of Kalman filter, we have recently introduced 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 e...

Full description

Bibliographic Details
Main Authors: Zulkifli, Md. Yusof, Ismail, Ibrahim, Zuwairie, Ibrahim, Khairul Hamimah, Abas, Shahdan, Sudin, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd Aziz, Mohd Saberi, Mohamad
Format: Conference or Workshop Item
Language:English
Published: Universiti Malaysia Pahang 2016
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/15521/
http://umpir.ump.edu.my/id/eprint/15521/
http://umpir.ump.edu.my/id/eprint/15521/1/P127%20pg951-960.pdf
id ump-15521
recordtype eprints
spelling ump-155212018-02-08T03:07:36Z http://umpir.ump.edu.my/id/eprint/15521/ Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter Zulkifli, Md. Yusof Ismail, Ibrahim Zuwairie, Ibrahim Khairul Hamimah, Abas Shahdan, Sudin Nor Azlina, Ab. Aziz Nor Hidayati, Abd Aziz Mohd Saberi, Mohamad TK Electrical engineering. Electronics Nuclear engineering Inspired by the estimation capability of Kalman filter, we have recently introduced 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, three extended versions of SKF algorithm, which is termed as Angle Modulated SKF (AMSKF), Distance Evaluated SKF (DESKF), and Binary SKF (BSKF), are proposed. A set of traveling salesman problems is used to evaluate the performance of the proposed algorithms. Universiti Malaysia Pahang 2016 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/15521/1/P127%20pg951-960.pdf Zulkifli, Md. Yusof and Ismail, Ibrahim and Zuwairie, Ibrahim and Khairul Hamimah, Abas and Shahdan, Sudin and Nor Azlina, Ab. Aziz and Nor Hidayati, Abd Aziz and Mohd Saberi, Mohamad (2016) Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter. In: Proceedings of The National Conference for Postgraduate Research (NCON-PGR 2016), 24-25 September 2016 , Universiti Malaysia Pahang (UMP), Pekan, Pahang. pp. 951-960.. http://ee.ump.edu.my/ncon/wp-content/uploads/2016/10/Proceeding-NCON-PGR-2016.zip
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Zulkifli, Md. Yusof
Ismail, Ibrahim
Zuwairie, Ibrahim
Khairul Hamimah, Abas
Shahdan, Sudin
Nor Azlina, Ab. Aziz
Nor Hidayati, Abd Aziz
Mohd Saberi, Mohamad
Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
description Inspired by the estimation capability of Kalman filter, we have recently introduced 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, three extended versions of SKF algorithm, which is termed as Angle Modulated SKF (AMSKF), Distance Evaluated SKF (DESKF), and Binary SKF (BSKF), are proposed. A set of traveling salesman problems is used to evaluate the performance of the proposed algorithms.
format Conference or Workshop Item
author Zulkifli, Md. Yusof
Ismail, Ibrahim
Zuwairie, Ibrahim
Khairul Hamimah, Abas
Shahdan, Sudin
Nor Azlina, Ab. Aziz
Nor Hidayati, Abd Aziz
Mohd Saberi, Mohamad
author_facet Zulkifli, Md. Yusof
Ismail, Ibrahim
Zuwairie, Ibrahim
Khairul Hamimah, Abas
Shahdan, Sudin
Nor Azlina, Ab. Aziz
Nor Hidayati, Abd Aziz
Mohd Saberi, Mohamad
author_sort Zulkifli, Md. Yusof
title Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
title_short Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
title_full Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
title_fullStr Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
title_full_unstemmed Three Approaches to Solve Combinatorial Optimization Problems using Simulated Kalman Filter
title_sort three approaches to solve combinatorial optimization problems using simulated kalman filter
publisher Universiti Malaysia Pahang
publishDate 2016
url http://umpir.ump.edu.my/id/eprint/15521/
http://umpir.ump.edu.my/id/eprint/15521/
http://umpir.ump.edu.my/id/eprint/15521/1/P127%20pg951-960.pdf
first_indexed 2023-09-18T22:20:16Z
last_indexed 2023-09-18T22:20:16Z
_version_ 1777415609590480896