A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem

作者: Kamal Z. Zamli , Fakhrud Din , Bestoun S. Ahmed , Miroslav Bures

DOI: 10.1371/JOURNAL.PONE.0195675

关键词:

摘要: The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions perform local global searches (hence the name sine-cosine), SCA introduces several random adaptive parameters facilitate search process. Although it shows promising results, process of vulnerable minima/maxima due adoption fixed switch probability bounded magnitude (from -1 1). this paper, we propose hybrid Q-learning sine-cosine- based strategy, called (QLSCA). Within QLSCA, eliminate switching probability. Instead, rely on (based penalty reward mechanism) dynamically identify best operation during runtime. Additionally, integrate two operations (Le´vy flight motion crossover) into QLSCA jumping out enhance solution diversity. To assess its performance, adopt for combinatorial test suite minimization problem. Experimental results reveal that statistically superior with regard size reduction compared recent state-of-the-art strategies, including original SCA, particle swarm generator (PSTG), optimization (APSO) cuckoo strategy (CS) at 95% confidence level. However, concerning comparison discrete (DPSO), there no significant difference in performance On positive note, outperforms DPSO certain configurations 90%

参考文章(39)
Christopher J. C. H. Watkins, Peter Dayan, Technical Note : \cal Q -Learning Machine Learning. ,vol. 8, pp. 279- 292 ,(1992) , 10.1007/BF00992698
Myra B Cohen, Designing Test Suites for Software Interactions Testing ResearchSpace@Auckland. ,(2004)
Bestoun S. Ahmed, Taib Sh. Abdulsamad, Moayad Y. Potrus, Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm Information & Software Technology. ,vol. 66, pp. 13- 29 ,(2015) , 10.1016/J.INFSOF.2015.05.005
Christopher J.C.H. Watkins, Peter Dayan, Technical Note Q-Learning Machine Learning. ,vol. 8, pp. 279- 292 ,(1992) , 10.1023/A:1022676722315
Luca M. Gambardella, Marco Dorigo, Ant-Q: A Reinforcement Learning approach to the traveling salesman problem Machine Learning Proceedings 1995. pp. 252- 260 ,(1995) , 10.1016/B978-1-55860-377-6.50039-6
Huayao Wu, Changhai Nie, Fei-Ching Kuo, Hareton Leung, Charles J. Colbourn, A Discrete Particle Swarm Optimization for Covering Array Generation IEEE Transactions on Evolutionary Computation. ,vol. 19, pp. 575- 591 ,(2015) , 10.1109/TEVC.2014.2362532
Xin-She Yang, Suash Deb, Cuckoo Search via Lévy flights nature and biologically inspired computing. pp. 210- 214 ,(2009) , 10.1109/NABIC.2009.5393690
Myra B. Cohen, Charles J. Colbourn, Alan C.H. Ling, Constructing strength three covering arrays with augmented annealing Discrete Mathematics. ,vol. 308, pp. 2709- 2722 ,(2008) , 10.1016/J.DISC.2006.06.036