Yinelemeli F-Yarış Algoritması ile Yapay Arı Koloni Algoritmasının Kontrol Parametrelerinin Ayarlanması

Yıl 2021, Cilt: 37 Sayı: 1, 12 - 25, 28.04.2021

Ömür Şahin , Bahriye Baştürk Akay

Öz

Meta-sezgisel algoritmaların performansını etkileyen en önemli faktörlerden biri kontrol parametrelerinin değerleridir. Doğru kontrol parametrelerinin belirlenmesi algoritmaların performansını önemli ölçüde artırmaktadır. Ancak pek çok durumda bu kontrol parametrelerinin belirlenmesi oldukça maliyetlidir. Bu nedenle kontrol parametrelerinin belirlenebilmesi için çeşitli yöntemler önerilmiştir ve Yinelemeli F-Yarış algoritması en etkin olan yöntemlerdendir. Bu çalışmada, Yinelemeli F-Yarış algoritmasının Yapay Arı Koloni algoritmasının kontrol parametrelerini belirlemedeki başarımı incelenmiştir. Yinelemeli F-Yarış algoritması ile belirlenen kontrol parametreleri kullanılarak elde edilen sonuçlar literatürde önerilen kontrol parametreleri ile elde edilen sonuçlarla kıyaslanmış ve istatistiksel analizler yapılmıştır. Yinelemeli F-Yarış algoritması kullanılarak, belli bir problem setinin tamamını kapsayacak şekilde kontrol parametre seti elde edilmiş ve CEC'2015 problem seti üzerinde literatürdeki kontrol parametrelerinin elde ettiği sonuçlar ile kıyaslanmıştır. Elde edilen sonuçlar, kontrol parametrelerinin Yinelemeli F-Yarış algoritması ile ayarlanmasının hesaplama maliyetini artırmadan algoritmaların performansını artırdığını göstermektedir.

Anahtar Kelimeler

Yapay Arı Koloni Algoritması, Yinelemeli F-Yarış, Kontrol Parametre Analizi, CEC'2015, F-Yarış

Teşekkür

Bu araştırmada yer alan kısmi nümerik hesaplamalar TÜBİTAK ULAKBİM, Yüksek Başarım ve Grid Hesaplama Merkezi'nde (TRUBA kaynaklarında) gerçekleştirilmiştir.

Parameter Tuning of Artificial Bee Colony Algorithm Using Iterative F-Race Algorithm

Öz

One of the most important factors affecting the performance of meta-heuristic algorithms is control parameters. Determining the correct control parameters significantly increases the performance of the algorithms. However, most of the time, determining these control parameters is very expensive task. Therefore, various methods have been proposed to tune the control parameters and the Iterative F-Race algorithm is one of the most effective methods. In this study, the performance of the Iterative F-Race algorithm in determining the control parameters of the Artificial Bee Colony algorithm was examined. The results obtained using the control parameters determined by the Iterative F-Race algorithm were compared with the results obtained with the control parameters recommended in the literature and statistical analyzes were applied. Using the iterative F-Race algorithm, a control parameter set that covers a certain problem set has been obtained and compared with the results of the control parameters in the literature on the CEC'2015 problem set. The results show that tuning the control parameters with the Iterative F-Race algorithm improves the performance of the algorithms without increasing the computational cost.

Anahtar Kelimeler

Artificial Bee Colony Algorithm, Iterative F-Race, Control Parameter Tuning, CEC’2015, F-Race

Kaynakça

• O. Sahin, B. Akay, Comparisons of metaheuristic algorithms and fitness functions on software test data generation, Applied Soft Computing. 49 (2016) 1202–1214. doi:10.1016/j.asoc.2016.09.045.
• W. Dillen, G. Lombaert, N. Voeten, M. Schevenels, Performance Assessment of Metaheuristic Algorithms for Structural Optimization Taking into Account the Influence of Control Parameters, içinde: EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization, Springer International Publishing, 2019: ss. 93–101. doi:10.1007/978-3-319-97773-7_9.
• A.E. Eiben, R. Hinterding, Z. Michalewicz, Parameter control in evolutionary algorithms, IEEE Transactions on Evolutionary Computation. 3 (1999) 124–141. doi:10.1109/4235.771166.
• K. De Jong, Parameter setting in EAs: A 30 year perspective, Studies in Computational Intelligence. 54 (2007) 1–18. doi:10.1007/978-3-540-69432-8_1.
• A.E. Eiben, S.K. Smit, Parameter tuning for configuring and analyzing evolutionary algorithms, Swarm and Evolutionary Computation. 1 (2011) 19–31. doi:10.1016/J.SWEVO.2011.02.001.
• R. Myers, E.R. Hancock, Empirical modelling of genetic algorithms., Evolutionary computation. 9 (2001) 461–493. doi:10.1162/10636560152642878.
• G. Taguchi, Y. Yokoyama, Taguchi methods: design of experiments, Amer Supplier Inst, 1993.
• A. Czarn, C. MacNish, K. Vijayan, B. Turlach, R. Gupta, Statistical exploratory analysis of genetic algorithms, IEEE Transactions on Evolutionary Computation. (2004). doi:10.1109/TEVC.2004.831262.
• I.C.O. Ramos, M.C. Goldbarg, E.G. Goldbarg, A.D.D. Neto, Logistic regression for parameter tuning on an evolutionary algorithm, içinde: 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings, 2005. doi:10.1109/cec.2005.1554808.
• O. François, C. Lavergne, Design of evolutionary algorithms - A statistical perspective, IEEE Transactions on Evolutionary Computation. (2001). doi:10.1109/4235.918434.
• B. Schmeiser, Simulation experiments, Handbooks in Operations Research and Management Science. 2 (1990) 295–330. doi:10.1016/S0927-0507(05)80171-9.
• Y. Rinott, On two-stage selection procedures and related probability-inequalities, Communications in Statistics - Theory and Methods. 7 (1978) 799–811. doi:10.1080/03610927808827671.
• A.C.T. Y. Hochberg, Multiple Comparison Procedures, Biometrical Journal. (1987). doi:10.1002/bimj.4710310115.
• S.H. Kim, B.L. Nelson, A Fully Sequential Procedure for Indifference-Zone Selection in Simulation, ACM Transactions on Modeling and Computer Simulation. 11 (2001) 251–273. doi:10.1145/502109.502111.
• M. Birattari, T. Stützle, L. Paquete, K. Varrentrapp, A Racing Algorithm for Configuring Metaheuristics, Proceedings of the Genetic and Evolutionary Computation Conference. (2002) 11–18.
• O.M. and A.W. Moore, The Racing Algorithm: Model Selection for Lazy Learners, Artificial Intelligence Review. 11 (1997) 193–225. doi:10.1023/a:1006556606079.
• D. Karaboga, An idea based on honey bee swarm for numerical optimization, Erciyes University, Engineering Faculty, 2005.
• D. Karaboga, B. Basturk, A powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm, Journal of Global Optimization. 39 (2007) 459–471. doi:10.1007/s10898-007-9149-x.
• B. Basturk, An artificial bee colony (ABC) algorithm for numeric function optimization, IEEE Swarm Intelligence Symposium, Indianapolis, IN, USA, 2006. (2006). https://ci.nii.ac.jp/naid/20001441290 (erişim 17 Ekim 2020).
• D.T. Pham, A. Ghanbarzadeh, E. Koç, S. Otri, S. Rahim, M. Zaidi, The Bees Algorithm - A Novel Tool for Complex Optimisation Problems, içinde: Intelligent Production Machines and Systems - 2nd I*PROMS Virtual International Conference 3-14 July 2006, 2006. doi:10.1016/B978-008045157-2/50081-X.
• X.S. Yang, Engineering optimizations via nature-inspired virtual bee algorithms, içinde: Lecture Notes in Computer Science, 2005. doi:10.1007/11499305_33.
• D. Teodorovic, M. Dell’ Orco, Bee Colony Optimization-Cooperative Learning Approach to Complex Transportation Problems, Advanced OR and AI Methods in Transportation. (2005).
• D. Karaboga, B. Gorkemli, C. Ozturk, N. Karaboga, A comprehensive survey: Artificial bee colony (ABC) algorithm and applications, Artificial Intelligence Review. 42 (2014) 21–57. doi:10.1007/s10462-012-9328-0.
• C. Özturk, E. Hancer, D. Karaboga, Küresel en iyi yapay ari koloni algoritmasi ile otomatik kümeleme, Journal of the Faculty of Engineering and Architecture of Gazi University. (2014).
• M. López-Ibáñez, J. Dubois-Lacoste, L. Pérez Cáceres, M. Birattari, T. Stützle, The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives. 3 (2016) 43–58. doi:10.1016/j.orp.2016.09.002.
• P. Balaprakash, M. Birattari, T. Stützle, Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement, içinde: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007. doi:10.1007/978-3-540-75514-2_9.
• M. Birattari, Z. Yuan, P. Balaprakash, T. Stützle, F-Race and Iterated F-Race: An Overview, içinde: Experimental Methods for the Analysis of Optimization Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010: ss. 311–336. doi:10.1007/978-3-642-02538-9_13.
• J. Haigh, W.J. Conover, Practical Nonparametric Statistics., Journal of the Royal Statistical Society. Series A (General). (1981). doi:10.2307/2981807.
• D. Karaboga, B. Akay, A comparative study of Artificial Bee Colony algorithm, Applied Mathematics and Computation. 214 (2009) 108–132. doi:10.1016/j.amc.2009.03.090.
• K.V. Price, Differential evolution vs. the functions of the 2/sup nd/ ICEO, içinde: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC ’97), IEEE, 1997: ss. 153–157. doi:10.1109/ICEC.1997.592287.