Skip to main content
SpringerLink
Log in

A New Variable Strength t-Way Strategy Based on the Cuckoo Search Algorithm

  • Conference paper
  • First Online:
Intelligent and Interactive Computing

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 67))

Abstract

Considering systematic interaction of inputs, t-way testing is a sampling strategy that generates a subset of test cases from a pool of possible tests. Many t-way testing strategies appear in the literature to date ranging from general computational ones to metaheuristic-based. Owing to its performance, the metaheuristic-based t-way strategies have gained significant attention recently (e.g., Particle swarm optimization, genetic algorithm, ant colony algorithm, harmony search, and cuckoo search). Despite much progress, existing strategies have not sufficiently dealt with more than one interaction between input parameters (termed variable strength t-way). Complementing existing works, this paper proposes a new variable strength cuckoo search algorithm, called VCS. Experimental results have shown promising results as VCS can compete with many existing works.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Othman RR, Zamli KZ (2011) ITTDG: Integrated t-way test data generation strategy for interaction testing. Sci Res Essays 6:3638–3648

    Article  Google Scholar 

  2. Younis MI, Zamli KZ, Isa NM (2008) MIPOG-modification of the IPOG strategy for t-way software testing. In: Proceeding of the distributed frameworks and applications (DFmA)

    Google Scholar 

  3. Younis MI, Zamli KZ, Isa NAM (2008) Algebraic strategy to generate pairwise test set for prime number parameters and variables. In: International symposium on information technology, 2008. ITSim 2008, pp 1–4

    Google Scholar 

  4. Yang X-S, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optimisation 1:330–343

    Article  Google Scholar 

  5. Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver press

    Google Scholar 

  6. Yang XS, Deb S, Karamanoglu M, He X (2012) Cuckoo search for business optimization applications. In: 2012 National conference on computing and communication systems (NCCCS), 2012, pp 1–5

    Google Scholar 

  7. Yildiz AR (2013) Cuckoo search algorithm for the selection of optimal machining parameters in milling operations. Int J Adv Manuf Technol 64:55–61

    Article  Google Scholar 

  8. Burnwal S, Deb S (2013) Scheduling optimization of flexible manufacturing system using cuckoo search-based approach. Int J Adv Manuf Technol 64:951–959

    Article  Google Scholar 

  9. Ahmed BS, Zamli KZ, Lim CP (2012) Constructing a t-way interaction test suite using the particle swarm optimization approach. Int J Innovative Comput Inf Control 8:431–452

    Google Scholar 

  10. Alsewari ARA, Zamli KZ (2012) Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Inf Softw Technol 54:553–568

    Article  Google Scholar 

  11. Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2008) IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw Test Verification Reliab 18:125–148

    Article  Google Scholar 

  12. Hartman A, Raskin L (2004) Problems and algorithms for covering arrays. Discrete Math 284:149–156

    Article  MathSciNet  Google Scholar 

  13. Mandl R (1985) Orthogonal latin squares: an application of experiment design to compiler testing. Commun ACM 28:1054–1058

    Article  Google Scholar 

  14. Bush KA (1952) Orthogonal arrays of index unity. Ann Math Stat 23:426–434

    Article  MathSciNet  Google Scholar 

  15. Williams AW (2000) Determination of test configurations for pair-wise interaction coverage. In: Ural H, Probert RL, von Bochmann G (eds) Testing of communicating systems: tools and techniques. IFIP TC6/WG6.1 13th International conference on testing of communicating systems (TestCom 2000), pp 59–74, Springer US, Boston, MA

    Google Scholar 

  16. Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Trans Softw Eng 23:437–444

    Article  Google Scholar 

  17. Jenkins B (2003, 5-Dec-2017). Jenny tool. Available http://www.burtleburtle.net/bob/math

  18. Williams A (2014) TConfig download page [Online]. Available http://www.site.uottawa.ca/~awilliam/. Accessed 23 Dec 2014

  19. Hartman A, Klinger T, Raskin L (2010) IBM intelligent test case handler. Discrete Math 284:149–156

    Article  Google Scholar 

  20. Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2007) IPOG: a general strategy for t-way software testing. In: 14th Annual IEEE international conference and workshops on the engineering of computer-based systems (ECBS’07), pp 549–556

    Google Scholar 

  21. Forbes M, Lawrence J, Lei Y, Kacker RN, Kuhn DR (2008) Refining the in-parameter-order strategy for constructing covering arrays. J Res Nat Inst Stand Technol 113:287

    Article  Google Scholar 

  22. Stardom J (2001) Metaheuristics and the search for covering and packing arrays. Simon Fraser University

    Google Scholar 

  23. Shiba T, Tsuchiya T, Kikuno T (2004) Using artificial life techniques to generate test cases for combinatorial testing. In: 28th Annual international computer software and applications conference, pp 72–77

    Google Scholar 

  24. Nasser AB, Zamli KZ, Alsewari AA, Ahmed BS (2018) Hybrid flower pollination algorithm strategies for t-way test suite generation. PLoS ONE 13:e0195187

    Article  Google Scholar 

  25. Zamli KZ, Alkazemi BY, Kendall G (2016) A tabu search hyper-heuristic strategy for t-way test suite generation. Appl Soft Comput 44:57–74

    Article  Google Scholar 

  26. Zamli KZ, Din F, Kendall G, Ahmed BS (2017) An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation. Inf Sci 399:121–153

    Article  Google Scholar 

  27. Zamli KZ, Din F, Baharom S, Ahmed BS (2017) Fuzzy adaptive teaching learning-based optimization strategy for the problem of generating mixed strength t-way test suites. Eng Appl Artif Intell 59:35–50

    Article  Google Scholar 

  28. Zamli KZ, Din F, Ahmed BS, Bures M (2018) A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem. PLoS ONE 13:e0195675

    Article  Google Scholar 

  29. Yang X-S, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature and biologically inspired computing, pp 210–214

    Google Scholar 

  30. Nasser AB, Alsewari ARA, Zamli KZ (2015) Tuning of cuckoo search based strategy for t-way testing. In: International conference on electrical and electronic engineering, p 8948

    Google Scholar 

Download references

Acknowledgements

This work is partially funded by the “Long Term National Plan for Science, Technology and Innovation (LT-NPSTI) Grant, King Abdul Aziz City for Science and Technology, Kingdom of Saudi Arabia (grant no: UIC141504)” and “the FRGS Grant—A Reinforcement Learning Sine Cosine based Strategy for Combinatorial Test Suite Generation (grant no: RDU170103)”.

Author information

Authors and Affiliations

  1. Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, 26300, Kuantan, Pahang, Malaysia

    Abdullah B. Nasser & Kamal Z. Zamli

Authors
  1. Abdullah B. Nasser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamal Z. Zamli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Z. Zamli .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Milan, Milan, Italy

    Vincenzo Piuri

  2. Department of Automation and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

  3. Department of Computer Applications, Sikkim Manipal Institute of Technology, Sikkim Manipal University, Sikkim, India

    Samarjeet Borah

  4. Department of Intelligent Computing and Analytics, Universiti Teknikal Malaysia Melaka, Durian Tunggal, Melaka, Malaysia

    Sharifah Sakinah Syed Ahmad

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nasser, A.B., Zamli, K.Z. (2019). A New Variable Strength t-Way Strategy Based on the Cuckoo Search Algorithm. In: Piuri, V., Balas, V., Borah, S., Syed Ahmad, S. (eds) Intelligent and Interactive Computing. Lecture Notes in Networks and Systems, vol 67. Springer, Singapore. https://doi.org/10.1007/978-981-13-6031-2_17

Download citation

Publish with us

Policies and ethics

Search

Navigation