Artificial Bee Colony Algorithm for Pairwise Test Generation

Our dependence on software applications has become dramatic in many activities of our daily life as they help to increase the efficiency of our tasks. These software applications have many sets of input values, parameters, software/hardware environments and system conditions, which need to be tested...

Full description

Bibliographic Details
Main Authors: Alazzawi, Ammar K., Homaid, Ameen A. Ba, Alomoush, Alaa A., Alsewari, Abdulrahman A.
Format: Article
Language:English
Published: Universiti Teknikal Malaysia Melaka (UTeM) 2017
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/17129/
http://umpir.ump.edu.my/id/eprint/17129/
http://umpir.ump.edu.my/id/eprint/17129/1/Artificial%20Bee%20Colony%20Algorithm%20for%20Pairwise%20Test.pdf
Description
Summary:Our dependence on software applications has become dramatic in many activities of our daily life as they help to increase the efficiency of our tasks. These software applications have many sets of input values, parameters, software/hardware environments and system conditions, which need to be tested to ensure software reliability and quality. However, the whole comprehensive software testing is virtually not possible due to marketing pressure and resource constraints. In an attempt to solve this problem, there has been a development of a number of sampling and pairwise strategies in the literature. In this paper, we evaluated and proposed a pairwise strategy named Pairwise Artificial Bee Colony algorithm (PABC). According to the benchmarking results, the PABC strategies outdo some existing strategies to generate a test case in many of the system configurations taken into consideration. In a case where PABC is not at its optimal stage or its best performance, the experiments of a test case are effectively competitive. PABC progresses as a means to achieve the effective use of the artificial bee colony algorithm for pairwise testing reduction.