Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3384544.3384608acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicscaConference Proceedingsconference-collections
research-article

Latin Hypercube Sampling Jaya Algorithm based Strategy for T-way Test Suite Generation

Published: 17 April 2020 Publication History

Abstract

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 meta-heuristic based. Owing to its performance, man the meta-heuristic based t-way strategies have gained significant attention recently (e.g. Particle Swarm Optimization, Genetic Algorithm, Ant Colony Algorithm, Harmony Search, Jaya Algorithm and Cuckoo Search). Jaya Algorithm (JA) is a new metaheuristic algorithm, has been used for solving different problems. However, losing the search's diversity is a common issue in the metaheuristic algorithm. In order to enhance JA's diversity, enhanced Jaya Algorithm strategy called Latin Hypercube Sampling Jaya Algorithm (LHS-JA) for Test Suite Generation is proposed. Latin Hypercube Sampling (LHS) is a sampling approach that can be used efficiently to improve search diversity. To evaluate the efficiency of LHS-JA, LHS-JA is compared against existing metaheuristic-based t-way strategies. Experimental results have shown promising results as LHS-JA can compete with existing t-way strategies.

References

[1]
K. Z. Zamli, F. Din, G. Kendall, and B. S. Ahmed, "An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation," Information Sciences, vol. 399, pp. 121--153, 2017.
[2]
R. R. Othman, and K. Z. Zamli, "ITTDG: Integrated t-way test data generation strategy for interaction testing," Scientific Research and Essays, vol. 6, no. 17, pp. 3638--3648, 2011.
[3]
M. I. Younis, K. Z. Zamli, and N. M. Isa, "MIPOG-modification of the IPOG strategy for t-way software testing," Proceeding of the Distributed Frameworks and Applications (DFmA), 2008.
[4]
M. I. Younis, K. Z. Zamli, and N. A. M. Isa, "Algebraic strategy to generate pairwise test set for prime number parameters and variables." pp. 1--4.
[5]
A. B. Nasser, K. Z. Zamli, A. A. Alsewari, and B. S. Ahmed, "Hybrid flower pollination algorithm strategies for t-way test suite generation," PloS one, vol. 13, no. 5, pp. e0195187, 2018.
[6]
K. Z. Zamli, F. Din, S. Baharom, and B. S. Ahmed, "Fuzzy adaptive teaching learning-based optimization strategy for the problem of generating mixed strength t-way test suites," Engineering Applications of Artificial Intelligence, vol. 59, pp. 35--50, 2017.
[7]
D. R. Kuhn, D. R. Wallace, and A. M. Gallo, "Software fault interactions and implications for software testing," IEEE transactions on software engineering, vol. 30, no. 6, pp. 418--421, 2004.
[8]
R. Rao, "Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems," International Journal of Industrial Engineering Computations, vol. 7, no. 1, pp. 19--34, 2016.
[9]
A. Hartman, and L. Raskin, "Problems and algorithms for covering arrays," Discrete Mathematics, vol. 284, no. 1, pp. 149--156, 2004.
[10]
Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, and J. Lawrence, "IPOG: A general strategy for t-way software testing." pp. 549--556.
[11]
D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton, "The AETG system: An approach to testing based on combinatorial design," Software Engineering, IEEE Transactions on, vol. 23, no. 7, pp. 437--444, 1997.
[12]
B. Jenkins, "Jenny download page [Online]," pp. Available: http://www.burtleburtle.net/bob/math. [Accessed 16 Dec 2014]. 2003.
[13]
A. Williams, "TConfig download page [Online]," pp. University of Ottawa. Available: http://www.site.uottawa.ca/~awilliam/[Accessed 23 Dec 2014]. 2008.
[14]
A. Hartman, T. Klinger, and L. Raskin, "IBM intelligent test case handler," Discrete Mathematics, vol. 284, no. 1, pp. 149--156, 2010.
[15]
W. Miller, and D. L. Spooner, "Automatic generation of floating-point test data," IEEE Transactions on Software Engineering, no. 3, pp. 223--226, 1976.
[16]
T. Shiba, T. Tsuchiya, and T. Kikuno, "Using artificial life techniques to generate test cases for combinatorial testing." pp. 72--77.
[17]
B. S. Ahmed, and K. Z. Zamli, "A review of covering arrays and their application to software testing," Journal of Computer Science, vol. 7, no. 9, pp. 1375--1385, 2011.
[18]
A. R. A. Alsewari, and K. Z. Zamli, "Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support," Information and Software Technology, vol. 54, no. 6, pp. 553--568, Jun, 2012.
[19]
A. B. Nasser, K. Z. Zamli, A. A. Alsewari, and B. S. Ahmed, "An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite," International Journal of Bio-Inspired Computation, vol. 12, no. 2, pp. 115--127, 2018.
[20]
A. B. Nasser, A. R. A. Alsewari, and K. Z. Zamli, "PairCS: A new Approach of Pairwise Testing based on Cuckoo Search Algorithm," in SOFTEC Asia 2015, Kuantan, Malaysia, 2015.
[21]
K. Z. Zamli, B. Y. Alkazemi, and G. Kendall, "A tabu search hyper-heuristic strategy for t-way test suite generation," Applied Soft Computing, vol. 44, pp. 57--74, 2016.
[22]
K. Z. Zamli, F. Din, B. S. Ahmed, and M. Bures, "A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem," PloS one, vol. 13, no. 5, pp. e0195675, 2018.
[23]
A. B. Nasser, F. Hujainah, A. A. Al-Sewari, and K. Z. Zamli, "An Improved Jaya Algorithm-Based Strategy for T-Way Test Suite Generation." pp. 352--361.
[24]
Z.-z. Liu, W. Li, and M. Yang, "Two general extension algorithms of latin hypercube sampling," Mathematical Problems in Engineering, vol. 2015, 2015.
[25]
M. Črepinšek, S.-H. Liu, and M. Mernik, "Exploration and exploitation in evolutionary algorithms: A survey," ACM Computing Surveys (CSUR), vol. 45, no. 3, pp. 35, 2013.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICSCA '20: Proceedings of the 2020 9th International Conference on Software and Computer Applications
February 2020
382 pages
ISBN:9781450376655
DOI:10.1145/3384544
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 April 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Application of Jaya algorithm
  2. Jaya algorithm
  3. Metaheuristic algorithm
  4. Optimization algorithm
  5. T-way Test Suite Generation

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICSCA 2020

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 96
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Nov 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media