Nejat YUMUŞAK, Hasan MAKAS

System identification by using migrating birds optimization algorithm: a comparative performance analysis

System identification is an important process to investigate and understand the behavior of an unknown system. It aims to establish an interface between the real system and its mathematical representation. Conventional system identification methods generally need differentiable search spaces and they cannot be used for nondifferentiable multimodal search spaces. On the other hand, metaheuristic search algorithms are independent from the search space characteristics and they do not need much knowledge about the real system. The migrating birds optimization algorithm is a recently introduced nature-inspired metaheuristic neighborhood search approach. It simulates the V flight formation of migrating birds, which enables birds to save energy during migration. In this paper, first, a set of comparative performance tests by using benchmark functions are performed on the migrating birds optimization algorithm and some other well-known metaheuristics. The same metaheuristic algorithms are then employed to solve several system identification problems. The results show that the migrating birds optimization algorithm achieves promising optimizations both for benchmark tests and for system identification problems.

PDF

___

[1] Boussa¨ıd I, Lepagnot J, Siarry P. A survey on optimization metaheuristics. Inform Sciences 2013; 237: 82-117.
[2] Duman E, Uysal M, Alkaya AF. Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inform Sciences 2012; 217: 65-77.
[3] Ahuja RK, Ergun O, Orlin JB, Punnen AP. A survey of very large scale neighborhood search techniques. Discrete Appl Math 2002; 123: 75-102.
[4] Holland JH. Adaptation in Natural and Artificial Systems. Ann Arbor, MI, USA: University of Michigan Press, 1975.
[5] Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science 1983; 220: 671-680.
[6] Glover F. Future paths for integer programming and links to artificial intelligence. Comp Oper Res 1986; 13: 533-549.
[7] Dorigo M. Optimization, learning and natural algorithms. PhD, Polytechnic University of Milan, Milan, Italy, 1992.
[8] Eberhart RC, Kennedy J. A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micromachine and Human Science; 46 October 1995, Nagoya, Japan. New York, NY, USA: IEEE.pp. 39-43.
[9] Storn R, Price K. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 1997; 11: 341-359.
[10] Geem ZW, Kim JH, Loganathan GV. A new heuristic optimization algorithm: harmony search. Simulation 2001; 76: 60-68.
[11] Mucherino A, Seref O. A novel meta-heuristic search for global optimization. In: Proceedings of the Conference on Data Mining, System Analysis and Optimization in Biomedicine; 2830 March 2007; Gainesville, FL, USA. Melville, NY, USA: AIP Publishing. pp. 162-173.
[12] Karaboga D, Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 2007; 39: 459-471.
[13] Yang XS. Nature-Inspired Metaheuristic Algorithms. 2nd ed. Frome, UK: Luniver Press, 2010.
[14] Shah-Hosseini H. The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. International Journal of Bio-Inspired Computation 2009; 1: 71-79.
[15] Yang XS, Deb S. Cuckoo search via L´evy flights. In: Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBIC); 911 December 2009; Coimbatore, India. New York, NY, USA: IEEE. pp. 210-214.
[16] Yang XS, Deb S. Engineering optimisation by cuckoo search. International Journal of Mathematical Modelling & Numerical Optimisation 2010; 1: 330-343.
[17] Yang XS. A new metaheuristic bat-inspired algorithm. In: Cruz C, Gonz´alez JR, Krasnogor N, Pelta DA, Terrazas G, editors. Nature Inspired Cooperative Strategies for Optimization (Studies in Computational Intelligence 284). Granada, Spain: Springer, 2010. pp. 65-74.
[18] Yang XS. Bat algorithm for multi-objective optimisation. International Journal of Bio-Inspired Computation 2011; 3: 267-274.
[19] Eiben AE, Smit SK. Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm and Evolutionary Computation 2011; 1: 19-31.
[20] Pandian SMV, Thanushkodi K. Considering transmission loss for an economic dispatch problem without valve-point loading using an EP-EPSO algorithm. Turk J Electr Eng Co 2012; 20: 1259-1267.
[21] Mutluer M, Bilgin O. Application of a hybrid evolutionary technique for efficiency determination of a submersible induction motor. Turk J Electr Eng Co 2011; 19: 877-890.
[22] Jaddi NS, Abdullah S. Hybrid of genetic algorithm and great deluge algorithm for rough set attribute reduction. Turk J Electr Eng Co 2013; 21: 1737-1750.
[23] Fornarelli G, Giaquinto A. An unsupervised multi-swarm clustering technique for image segmentation. Swarm and Evolutionary Computation 2013; 11: 31-45.
[24] Blum C, Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 2003; 35: 268-308.
[25] Lennart L. System Identification: Theory for the User. Upper Saddle River, NJ, USA: Prentice Hall, 1997.
[26] Rosenqvist F, Karlstr¨om A. Realisation and estimation of piecewise-linear output-error models. Automatica 2005; 41: 545-551.
[27] Pintelon R, Schoukens J. Box-Jenkins identification revisited - Part I: theory. Automatica 2006; 42: 63-75.
[28] Karabo˘ga N, C¸ etinkaya MB. A novel and efficient algorithm for adaptive filtering: artificial bee colony algorithm. Turk J Electr Eng Co 2011; 19: 175-190.
[29] Kalınlı A. Simulated annealing algorithm-based Elman network for dynamic system identification. Turk J Electr Eng Co 2012; 20: 569-582.
[30] Er¸cin O, C¸ oban R. Identification of linear dynamic systems using the artificial bee colony algorithm. Turk J Electr ¨ Eng Co 2012; 20 (Suppl. 1): 1175-1188.
[31] Ercin O, Coban R. Comparison of the artificial bee colony and the bees algorithm for PID controller tuning. In: Proceedings of the International Symposium on Innovations in Intelligent Systems and Applications (INISTA); 1518 June 2011; ˙Istanbul, Turkey. New York, NY, USA: IEEE. pp. 595-598.
[32] Karaboga N. A new design method based on artificial bee colony algorithm for digital IIR filters. J Frankl Inst 2009; 346: 328-348.
[33] Engelbrecht AP. Fundamentals of Computational Swarm Intelligence. New York, NY, USA: Wiley, 2006.
[34] Shi Y, Eberhart RC. Empirical study of particle swarm optimization. In: Proceedings of the CEC99 Congress of Evolutionary Computation; 69 July 1999; Washington, DC, USA. New York, NY, USA: IEEE. pp. 1945-1950.
[35] Eberhart RC, Shi Y. Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the IEEE International Congress on Evolutionary Computation; 1619 July 2000; La Jolla, CA, USA. New York, NY, USA: IEEE. pp. 84-88.
[36] Karaboga D, Akay B. A comparative study of artificial bee colony algorithm. Appl Math Comput 2009; 214: 108-132.
[37] Karaboga D, Basturk B. On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 2008; 8: 687-697.
[38] Karaboga D, Okdem S. A simple and global optimization algorithm for engineering problems: differential evolution algorithm. Turk J Electr Eng Co 2004; 12: 53-60.
[39] Haupt RL, Haupt SE. Practical Genetic Algorithms. 2nd ed. New York, NY, USA: Wiley, 2004.
[40] Lissaman PBS, Schollenberger CA. Formation flight of birds. Science 1970; 168: 1003-1005.
[41] Makas H. PORLA metodunun sistem modellemedeki performans analizi. MSc, Erciyes University, Kayseri, Turkey, 1998 (in Turkish).