Abdullah B. Nasser, Antar S.H. Abdul-Qawy, Nibras Abdullah, Fadhl Hujainah, K. Z. Zamli, W. Ghanem
{"title":"Latin Hypercube Sampling Jaya Algorithm based Strategy for T-way Test Suite Generation","authors":"Abdullah B. Nasser, Antar S.H. Abdul-Qawy, Nibras Abdullah, Fadhl Hujainah, K. Z. Zamli, W. Ghanem","doi":"10.1145/3384544.3384608","DOIUrl":null,"url":null,"abstract":"T-way testing is a sampling strategy that generates a subset of test cases from a pool of possible tests. Many t-way testing strategies appear in the literature to-date ranging from general computational ones to meta-heuristic based. Owing to its performance, man the meta-heuristic based t-way strategies have gained significant attention recently (e.g. Particle Swarm Optimization, Genetic Algorithm, Ant Colony Algorithm, Harmony Search, Jaya Algorithm and Cuckoo Search). Jaya Algorithm (JA) is a new metaheuristic algorithm, has been used for solving different problems. However, losing the search's diversity is a common issue in the metaheuristic algorithm. In order to enhance JA's diversity, enhanced Jaya Algorithm strategy called Latin Hypercube Sampling Jaya Algorithm (LHS-JA) for Test Suite Generation is proposed. Latin Hypercube Sampling (LHS) is a sampling approach that can be used efficiently to improve search diversity. To evaluate the efficiency of LHS-JA, LHS-JA is compared against existing metaheuristic-based t-way strategies. Experimental results have shown promising results as LHS-JA can compete with existing t-way strategies.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3384544.3384608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
T-way testing is a sampling strategy that generates a subset of test cases from a pool of possible tests. Many t-way testing strategies appear in the literature to-date ranging from general computational ones to meta-heuristic based. Owing to its performance, man the meta-heuristic based t-way strategies have gained significant attention recently (e.g. Particle Swarm Optimization, Genetic Algorithm, Ant Colony Algorithm, Harmony Search, Jaya Algorithm and Cuckoo Search). Jaya Algorithm (JA) is a new metaheuristic algorithm, has been used for solving different problems. However, losing the search's diversity is a common issue in the metaheuristic algorithm. In order to enhance JA's diversity, enhanced Jaya Algorithm strategy called Latin Hypercube Sampling Jaya Algorithm (LHS-JA) for Test Suite Generation is proposed. Latin Hypercube Sampling (LHS) is a sampling approach that can be used efficiently to improve search diversity. To evaluate the efficiency of LHS-JA, LHS-JA is compared against existing metaheuristic-based t-way strategies. Experimental results have shown promising results as LHS-JA can compete with existing t-way strategies.