Comparative Study between Flower Pollination Algorithm and Cuckoo Search Algorithm for t-way Test Data Generation

• Main Authors: Abdullah, Nasser, Kamal Z., Zamli
• Format: Article
• Language: English
• Published: American Scientific Publisher 2018
• Subjects: QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/19757/6/31.%20Comparative%20Study%20between%20Flower%20Pollination%20Algorithm%20and%20Cuckoo%20Search%20Algorithm%20for%20t-way%20Test%20Data%20Generation1.pdf; http://umpir.ump.edu.my/id/eprint/19757/; https://doi.org/10.1166/asl.2018.12960
• Institution: Universiti Malaysia Pahang

T-way testing is a sampling approach for test data generation. Recently, adapting meta-heuristic algorithms for t-way testing is very attractive in order to find a minimum subset of test data that can test a system overall. As a consequence, several meta-heuristic algorithms have been used as the basis of t-way strategies. In order to guide software tester (and engineers in general) to select the best algorithm for the problem at hand, there is a need to evaluate and benchmark the performance of each strategy against common case studies. This paper presents a comparative study between two meta-heuristic strategies for t-way test data generation: Flower Pollination Algorithm (FPA) and Cuckoo Search (CS). Our experiments have performed on a real-world case study. Experimental results demonstrate that FPA appears to produce better results in most of the test cases in term of test suite size and convergence rate owing to its ability for controlling local and global search.