An Efficient Regression Test Suite Optimization Approach Using Hybrid Spider Monkey Optimization Algorithm

2021 ◽  
Vol 12 (4) ◽  
pp. 57-80
Author(s):  
Arun Prakash Agrawal ◽  
Ankur Choudhary ◽  
Parma Nand

Regression testing validates the modified software and safeguards against the introduction of new errors during modification. A number of test suite optimization techniques relying on meta-heuristic techniques have been proposed to find the minimal set of test cases to execute for regression purposes. This paper proposes a hybrid spider monkey optimization based regression test suite optimization approach and empirically compares its performance with three other approaches based on bat search, ant colony, and cuckoo search. The authors conducted an empirical study with various subjects retrieved from software artifact infrastructure repository. Fault coverage and execution time of algorithm are used as fitness measures to meet the optimization criteria. Extensive experiments are conducted to evaluate the performance of the proposed approach with other search-based approaches under study using various statistical tests like m-way ANOVA and post hoc tests including odds ratio. Results indicate the superiority of the proposed approach in most of the cases and comparable in others.

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 18685-18700 ◽  
Author(s):  
Jabir Mumtaz ◽  
Zailin Guan ◽  
Lei Yue ◽  
Zhengya Wang ◽  
Saif Ullah ◽  
...  

2020 ◽  
Vol 11 (1) ◽  
pp. 53-67 ◽  
Author(s):  
Arun Prakash Agrawal ◽  
Ankur Choudhary ◽  
Arvinder Kaur

Test suite optimization is an ever-demanded approach for regression test cost reduction. Regression testing is conducted to identify any adverse effects of maintenance activity on previously working versions of the software. It consumes almost seventy percent of the overall software development lifecycle budget. Regression test cost reduction is therefore of vital importance. Test suite optimization is the most explored approach to reduce the test suite size to re-execute. This article focuses on test suite optimization as a regression test case selection, which is a proven N-P hard combinatorial optimization problem. The authors have proposed an almost safe regression test case selection approach using a Hybrid Whale Optimization Algorithm and empirically evaluated the same on subject programs retrieved from the Software Artifact Infrastructure Repository with Bat Search and ACO-based regression test case selection approaches. The analyses of the obtained results indicate an improvement in the fault detection ability of the proposed approach over the compared ones with significant reduction in test suite size.


2021 ◽  
Vol 10 (2) ◽  
pp. 104-119
Author(s):  
Amel Terki ◽  
Hamid Boubertakh

This paper proposes a new intelligent optimization approach to deal with the unit commitment (UC) problem by finding the optimal on/off states strategy of the units under the system constraints. The proposed method is a hybridization of the cuckoo search (CS) and the tabu search (TS) optimization techniques. The former is distinguished by its efficient global exploration mechanism, namely the levy flights, and the latter is a successful local search method. For this sake, a binary code is used for the status of units in the scheduled time horizon, and a real code is used to determine the generated power by the committed units. The proposed hybrid CS and TS (CS-TS) algorithm is used to solve the UC problem such that the CS guarantees the exploration of the whole search space, while the TS algorithm deals with the local search in order to avoid the premature convergence and prevent from trapping into local optima. The proposed method is applied to the IEEE standard systems of different scales ranging from 10 to 100 units. The results show clearly that the proposed method gives better quality solutions than the existing methods.


Sign in / Sign up

Export Citation Format

Share Document