Pairwise Test Data Generation based on Flower Pollination Algorithm

Pairwise Test Data Generation based on Flower Pollination Algorithm

Owing to an exponential increase in computational time associated with increasing number of system components, exhaustive testing is increasingly becomes impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing works are focus...

Full description

Bibliographic Details
Main Authors: Nasser, Abdullah B., Alsewari, Abdulrahman A., Tairan, Nasser M., Kamal Z., Zamli
Format: Article
Language:English
Published: Universiti Malaya 2017
Subjects:
QA Mathematics
QA75 Electronic computers. Computer science
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/1/mjcs.pdf
id ump-19474
recordtype eprints
spelling ump-194742017-12-11T08:04:41Z http://umpir.ump.edu.my/id/eprint/19474/ Pairwise Test Data Generation based on Flower Pollination Algorithm Nasser, Abdullah B. Alsewari, Abdulrahman A. Tairan, Nasser M. Kamal Z., Zamli QA Mathematics QA75 Electronic computers. Computer science QA76 Computer software Owing to an exponential increase in computational time associated with increasing number of system components, exhaustive testing is increasingly becomes impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing works are focusing on the use of Search-Based algorithms as the basis of the implementation algorithm; however, there is no single strategy that can be the best for all cases. Currently, researches on Flower Pollination Algorithm (FPA) are very active and its applications have been proven successes to solve many problems. This paper proposes a new search-based strategy for generating the pairwise test suite, called Pairwise Flower Strategy (PairFS). The main feature of PairFS is that it is the first pairwise strategy that adopts FPA as its core implementation. To evaluate and benchmark our proposed strategy against existing strategies, several existing comparative experiments are adopted. The results of the experiment show that in many cases PairFS are more efficient than the existing strategies in terms of the test suite size. Universiti Malaya 2017 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/19474/1/mjcs.pdf Nasser, Abdullah B. and Alsewari, Abdulrahman A. and Tairan, Nasser M. and Kamal Z., Zamli (2017) Pairwise Test Data Generation based on Flower Pollination Algorithm. Malaysia Journal of Computer Science, 30 (3). pp. 242-257. ISSN 0127-9084 https://doi.org/10.22452/mjcs.vol30no3.5 doi: 10.22452/mjcs.vol30no3.5
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA Mathematics
QA75 Electronic computers. Computer science
QA76 Computer software
spellingShingle QA Mathematics
QA75 Electronic computers. Computer science
QA76 Computer software
Nasser, Abdullah B.
Alsewari, Abdulrahman A.
Tairan, Nasser M.
Kamal Z., Zamli
Pairwise Test Data Generation based on Flower Pollination Algorithm
description Owing to an exponential increase in computational time associated with increasing number of system components, exhaustive testing is increasingly becomes impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing works are focusing on the use of Search-Based algorithms as the basis of the implementation algorithm; however, there is no single strategy that can be the best for all cases. Currently, researches on Flower Pollination Algorithm (FPA) are very active and its applications have been proven successes to solve many problems. This paper proposes a new search-based strategy for generating the pairwise test suite, called Pairwise Flower Strategy (PairFS). The main feature of PairFS is that it is the first pairwise strategy that adopts FPA as its core implementation. To evaluate and benchmark our proposed strategy against existing strategies, several existing comparative experiments are adopted. The results of the experiment show that in many cases PairFS are more efficient than the existing strategies in terms of the test suite size.
format Article
author Nasser, Abdullah B.
Alsewari, Abdulrahman A.
Tairan, Nasser M.
Kamal Z., Zamli
author_facet Nasser, Abdullah B.
Alsewari, Abdulrahman A.
Tairan, Nasser M.
Kamal Z., Zamli
author_sort Nasser, Abdullah B.
title Pairwise Test Data Generation based on Flower Pollination Algorithm
title_short Pairwise Test Data Generation based on Flower Pollination Algorithm
title_full Pairwise Test Data Generation based on Flower Pollination Algorithm
title_fullStr Pairwise Test Data Generation based on Flower Pollination Algorithm
title_full_unstemmed Pairwise Test Data Generation based on Flower Pollination Algorithm
title_sort pairwise test data generation based on flower pollination algorithm
publisher Universiti Malaya
publishDate 2017
url http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/
http://umpir.ump.edu.my/id/eprint/19474/1/mjcs.pdf
first_indexed 2023-09-18T22:27:48Z
last_indexed 2023-09-18T22:27:48Z
_version_ 1777416083263717376

Similar Items