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

• Main Authors: Yusof, Zulkifli Md., Ibrahim, Zuwairie, Adam, Asrul, Azmi, Kamil Zakwan Mohd, Ab. Rahman, Tasiransurini, Muhammad, Badaruddin, Ab. Aziz, Nor Azlina, Abd Aziz, Nor Hidayati, Mokhtar, Norrima, Shapiai, Mohd Ibrahim, Muhammad, Mohd Saberi
• Format: Article
• Published: Science Publishing Corporation 2018
• Subjects: TK Electrical engineering. Electronics Nuclear engineering
• Online Access: http://eprints.um.edu.my/20230/; https://www.sciencepubco.com/index.php/ijet/article/view/22431

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