Abstract
This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. In comparison, the proposed ssSKF algorithm supersedes the original population-based Simulated Kalman Filter (SKF) algorithm by operating with only a single agent, and having less parameters to be tuned. In the proposed ssSKF algorithm, the initialisation parameters are not constants, but they are produced by random numbers taken from a normal distribution in the range of [0, 1], thus excluding them from tuning requirement. In order to balance between the exploration and exploitation in ssSKF, the proposed algorithm uses an adaptive neighbourhood mechanism during its prediction step. The proposed ssSKF algorithm is tested using the 30 benchmark functions of CEC 2014, and its performance is compared to that of the original SKF algorithm, Black Hole (BH) algorithm, Particle Swarm Optimisation (PSO) algorithm, Grey Wolf Optimiser (GWO) algorithm and Genetic Algorithm (GA). The results show that the proposed ssSKF algorithm is a promising approach and able to outperform GWO and GA algorithms, significantly.
Similar content being viewed by others
References
Talbi E 2009 Metaheuristics. Hoboken, NJ: John Wiley & Sons
Droste S, Jansen T and Wegener I 2006 Upper and lower bounds for randomized search heuristics in black-box optimisation. Theor. Comput. Syst. 39(4): 525–544
Holland J 1992 Adaptation in natural and artificial systems. Cambridge, MA: The MIT Press
Kennedy J and Eberhart R Particle swarm optimisation. In: Proceedings of the IEEE International Conference on Neural Networks, December 1995, pp. 1942–1948
Wolpert D H and Macready W G 1997 No free lunch theorems for optimisation. IEEE Trans. Evol. Comput. 1(1): 67–82
Boussaid I, Lepagnot J and Siarry P 2013 A survey on optimisation metaheuristics. Inf. Sci. 237: 82–117
Parejo J A, Ruiz-Cortes A, Lozano S and Fernandez P 2012 Metaheuristic optimisation frameworks: a survey and benchmarking. Soft Comput. 16(3): 527–561
Fister Jr. I, et al 2013 A brief review of nature-inspired algorithms for optimisation. Elektroteh. Vestn. [Engl.] 80(3): 1–7
Hatamlou A 2013 Black hole: a new heuristic optimisation approach for data clustering. Inf. Sci. 222: 175–184
Mirjalili S, Mirjalili S M and Lewis A 2014 Grey wolf optimiser. Adv. Eng. Softw. 69: 46–61
Ibrahim Z, et al 2015 A Kalman filter approach for solving unimodal optimisation problems. ICIC Express Lett. 9(12): 3415–3422
Kirkpatrick S, Gelatt Jr C D and Vecchi M 1983 Optimisation by simulated annealing. Science 220(4598): 671–680
Glover F 1986 Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5): 533–549
Mladenovic N and Hansen P 1997 Variable neighborhood search. Comput. Oper. Res. 24(11): 1097–1100
Dorigo M 1992 Optimisation, learning and natural algorithms. Ph.D. dissertation, Politecnico di Milano, Italy
Yang X 2010 Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspir. Comput. 2(2): 78–84
Yang X and Deb S 2009 Cuckoo search via Levy flights. In: Proceedings of the World Congress on Nature and Biologically Inspired Computing (NaBIC 2009), India, pp. 210–214
Mirjalili S 2016 SCA: a sine cosine algorithm for solving optimisation problems. Knowl.-Based Syst. 96: 120–133
Ibrahim Z, et al 2016 Simulated Kalman filter: a novel estimation-based metaheuristic optimisation algorithm. Adv. Sci. Lett. 22(10): 2941–2946
Kalman R E 1960 A new approach to linear filtering and prediction problems. J. Basic Eng. 82(Ser. D): 35–45
Md Yusof Z, et al 2016 Angle modulated simulated Kalman Filter algorithm for combinatorial optimisation problems. ARPN J. Eng. Appl. Sci. 11(7): 4854–4859
Md Yusof Z, et al 2016 Distance evaluated Simulated Kalman Filter algorithm for combinatorial optimisation problems. ARPN J. Eng. Appl. Sci. 11(7): 4911–4916
Md Yusof Z, Ibrahim I, Satiman S N, Ibrahim Z, Abdul Aziz N H and Ab. Aziz N A 2015 BSKF: binary simulated Kalman Filter. In: Proceedings of the 2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS), pp. 77–81
Muhammad B, et al 2015 A new hybrid simulated Kalman Filter and Particle Swarm Optimisation for continuous numerical optimisation problems. ARPN J. Eng. Appl. Sci. 10(22): 17171–17176
Muhammad B, Ibrahim Z, Mohd Azmi K Z, Abas K H, Ab. Aziz N A, Abdul Aziz N H and Mohamad M S 2016 Four different methods to hybrid simulated Kalman filter (SKF) with gravitational search algorithm (GSA). In: Proceedings of the 3rd National Conference of Postgraduate Research, pp. 854–864
Abdul Aziz N H, Ab. Aziz N A, Ibrahim Z, Razali S, Abas K H and Mohamad M S A Kalman Filter approach to PCB drill path optimisation problem. In: Proceedings of the IEEE Conference on Systems, Process and Control, December 2016, pp. 33–36
Md Yusof Z, Satiman S N, Muhammad B, Razali S, Ibrahim Z, Aspar Z and Ismail S 2015 Solving airport gate allocation problem using simulated Kalman Filter. In: Proceedings of the International Conference on Knowledge Transfer (ICKT’15), Malaysia, December 2015, pp. 121–127
Mohd Azmi K Z, Md Yusof Z, Satiman S N, Ibrahim Z, Ab. Aziz N A and Abdul Aziz N H 2016 Solving airport gate allocation problem using angle modulated simulated Kalman filter. In: Proceedings of the 3rd National Conference of Postgraduate Research, September, pp. 875–885
Adam A, et al 2016 Feature selection using angle modulated simulated Kalman filter for peak classification of EEG signals. SpringerPlus 5: 1580–1603
Hansen N, Ostermeier A and Gawelczyk A 1995 On the adaptation of arbitrary normal mutation distributions in evolution strategies: the generating set adaptation. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 57–64
Storn R and Price K 1997 Differential evolution a simple and efficient heuristic for global optimisation over continuous spaces. J. Global Optim. 11: 341–359
Cheng M and Prayogo D 2014 Symbiotic organisms search: a new metaheuristic optimisation algorithm. Comput. Struct. 139: 98–112
Abdul Aziz N H, Ibrahim Z, Ab. Aziz N A and Razali S 2017 Parameter-less simulated Kalman Filter. Int. J. Softw. Eng. Comput. Syst. (IJSECS) 3(February): 129–137
Abdul Aziz N H, Ibrahim Z, Bakare T A and Ab. Aziz N A 2016 How important the error covariance in simulated Kalman Filter? In: Proceedings of the National Conference for Postgraduate Research, September, pp. 315–320
Liang J J, Qu B Y and Suganthan P N 2013 Problems definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimisation. Tech. Rep. 201311, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China, and Tech. Rep., Nanyang Technological University, Singapore
Suganthan P N 2016 Shared documents [online]. Available: http://web.mysites.ntu.edu.sg/epnsugan/PublicSite/Shared%20Documents/CEC-2014/cec14-matlab-code.zip
Eberhart R C and Shi Y 2000 Comparing inertia weights and constriction factors in particle swarm optimisation. In: Proceedings of the 2000 Congress on Evolutionary Computation, July, pp. 84–88
Mirjalili S 2016 Seyedali Mirjalili homepage [online]. Available: http://www.alimirjalili.com/GWO.html
Haupt R L and Haupt S E 2004 Practical genetic algorithms. Hoboken, NJ: John Wiley & Sons
Alcala-Fdez J, et al 2008 KEEL: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput. 13(3): 307–318
Acknowledgements
This research was financially supported by Fundamental Research Grant Scheme (FRGS) awarded by the Ministry of Education (MOE) to Multimedia University under Grant No. FRGS/1/2015/TK04/MMU/03/02 and Universiti Malaysia Pahang under Grant No. RDU140114. We would like to thank Multimedia University and Universiti Malaysia Pahang for providing all the facilities required for this study.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
ABDUL AZIZ, N.H., IBRAHIM, Z., AB AZIZ, N.A. et al. Single-solution Simulated Kalman Filter algorithm for global optimisation problems. Sādhanā 43, 103 (2018). https://doi.org/10.1007/s12046-018-0888-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12046-018-0888-9