Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems

Yusof, Zulkifli Md. and Ibrahim, Zuwairie and Adam, Asrul and Azmi, Kamil Zakwan Mohd and Ab. Rahman, Tasiransurini and Muhammad, Badaruddin and Ab. Aziz, Nor Azlina and Abd Aziz, Nor Hidayati and Mokhtar, Norrima and Shapiai, Mohd Ibrahim and Muhammad, Mohd Saberi (2018) Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems. International Journal of Engineering & Technology, 7 (4). pp. 22-29. ISSN 2227-524X,

Full text not available from this repository.
Official URL: https://www.sciencepubco.com/index.php/ijet/articl...


Simulated Kalman Filter (SKF) is a population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search space. The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. Some problems, such as routing and scheduling, involve binary or discrete search space. At present, there are three modifications to the original SKF algorithm in solving combinatorial optimization problems. Those modified algorithms are binary SKF (BSKF), angle modulated SKF (AMSKF), and distance evaluated SKF (DESKF). These three combinatorial SKF algorithms use binary encoding to represent the solution to a combinatorial optimization problem. This paper introduces the latest version of distance evaluated SKF which uses state encoding, instead of binary encoding, to represent the solution to a combinatorial problem. The algorithm proposed in this paper is called state-encoded distance evaluated SKF (SEDESKF) algorithm. Since the original SKF algorithm tends to converge prematurely, the distance is handled differently in this study. To control and exploration and exploitation of the SEDESKF algorithm, the distance is normalized. The performance of the SEDESKF algorithm is compared against the existing combinatorial SKF algorithm based on a set of Traveling Salesman Problem (TSP).

Item Type: Article
Uncontrolled Keywords: Combinatorial optimization; Distance evaluated; Simulated Kalman filter; State encoding; Travelling salesman problem
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering
Depositing User: Ms. Juhaida Abd Rahim
Date Deposited: 30 Jan 2019 03:33
Last Modified: 27 Jun 2019 09:06
URI: http://eprints.um.edu.my/id/eprint/20230

Actions (login required)

View Item View Item