Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a Non-Deterministic Polynomial hard problem (NP). In recent times, many researchers had developed the various strategies based on the search-based...

Full description

Bibliographic Details
Main Authors:	Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.
Format:	Article
Language:	English
Published:	Institution of Engineering and Technology 2018
Subjects:	QA75 Electronic computers. Computer science QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf

id	ump-23683
recordtype	eprints
spelling	ump-236832019-01-24T01:14:58Z http://umpir.ump.edu.my/id/eprint/23683/ Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation Bahomaid, Ameen A. Alsewari, Abdulrahman A. Zamli, Kamal Z. Alsariera, Yazan A. QA75 Electronic computers. Computer science QA76 Computer software A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a Non-Deterministic Polynomial hard problem (NP). In recent times, many researchers had developed the various strategies based on the search-based approach to address the combinatorial testing issues. This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. Hence, they are referred to as variable strength modified greedy strategy (VS-MGS). Moreover, the modified strategy supports a VS together with interaction strength up to six. The proposed variant-greedy algorithm employed the elitism mechanism alongside the iteration in order to improve its’ efficiency. This algorithm is invariably called the modified greedy algorithm (MGA). Furthermore, the efficiency and performance of the VS-MGS using MGA were assessed firstly by comparing its results with the original greedy algorithm results and thereafter benchmarked with the results of the existing VS CT strategies. The VS-MGS’s results ultimately revealed that the adaptation of elitism mechanism with iteration in greedy algorithm resulted in an improved efficiency in the process of generating a near-optimal test case set size. Institution of Engineering and Technology 2018 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf Bahomaid, Ameen A. and Alsewari, Abdulrahman A. and Zamli, Kamal Z. and Alsariera, Yazan A. (2018) Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation. IET Software. pp. 1-11. ISSN 1751-8814 (In Press) https://doi.org/10.1049/iet-sen.2018.5005 https://doi.org/10.1049/iet-sen.2018.5005
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science QA76 Computer software
spellingShingle	QA75 Electronic computers. Computer science QA76 Computer software Bahomaid, Ameen A. Alsewari, Abdulrahman A. Zamli, Kamal Z. Alsariera, Yazan A. Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
description	A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a Non-Deterministic Polynomial hard problem (NP). In recent times, many researchers had developed the various strategies based on the search-based approach to address the combinatorial testing issues. This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. Hence, they are referred to as variable strength modified greedy strategy (VS-MGS). Moreover, the modified strategy supports a VS together with interaction strength up to six. The proposed variant-greedy algorithm employed the elitism mechanism alongside the iteration in order to improve its’ efficiency. This algorithm is invariably called the modified greedy algorithm (MGA). Furthermore, the efficiency and performance of the VS-MGS using MGA were assessed firstly by comparing its results with the original greedy algorithm results and thereafter benchmarked with the results of the existing VS CT strategies. The VS-MGS’s results ultimately revealed that the adaptation of elitism mechanism with iteration in greedy algorithm resulted in an improved efficiency in the process of generating a near-optimal test case set size.
format	Article
author	Bahomaid, Ameen A. Alsewari, Abdulrahman A. Zamli, Kamal Z. Alsariera, Yazan A.
author_facet	Bahomaid, Ameen A. Alsewari, Abdulrahman A. Zamli, Kamal Z. Alsariera, Yazan A.
author_sort	Bahomaid, Ameen A.
title	Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
title_short	Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
title_full	Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
title_fullStr	Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
title_full_unstemmed	Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
title_sort	adapting the elitism on the greedy algorithm for variable strength combinatorial test cases generation
publisher	Institution of Engineering and Technology
publishDate	2018
url	http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/ http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf
first_indexed	2023-09-18T22:35:35Z
last_indexed	2023-09-18T22:35:35Z
_version_	1777416573530669056

Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

Similar Items