IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v9y2018i3p88-104.html
   My bibliography  Save this article

Test Suite Minimization in Regression Testing Using Hybrid Approach of ACO and GA

Author

Listed:
  • Abhishek Pandey

    (University of Petroleum and Energy Studies, Bidholi, India)

  • Soumya Banerjee

    (Department of Computer Science and Engineering, Birla Institute of Technology Mesra, Ranchi, India)

Abstract

This article describes about the application of search-based techniques in regression testing and compares the performance of various search-based techniques for software testing. Test cases tend to increase exponentially as the software is modified. It is essential to remove redundant test cases from the existing test suite. Regression testing is very costly and must be performed in restricted ways to ensure the validity of the existing software. There exist different methods to improve the quality of test cases in terms of the number of faults covered, opposed to the number of statements covered in a minimum time. Different methods exist for this purpose, such as minimization, test case selection, and test case prioritization. In this article, search-based methods are applied to improve the quality of the test suite in order to select a minimum set of test cases which covers all the statements in a minimum time. The whole approach is named search based regression testing. In this paper, the performance of different metaheuristics for test suite minimization problem is also compared with a hybrid approach of ant colony optimization algorithm and genetic algorithm.

Suggested Citation

  • Abhishek Pandey & Soumya Banerjee, 2018. "Test Suite Minimization in Regression Testing Using Hybrid Approach of ACO and GA," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 9(3), pages 88-104, July.
    • Handle: RePEc:igg:jamc00:v:9:y:2018:i:3:p:88-104
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2018070105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:9:y:2018:i:3:p:88-104. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.