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

Test Suite Optimization Using Chaotic Firefly Algorithm in Software Testing

Author

Listed:
  • Abhishek Pandey

    (School of Computer Science and Engineering, University of Petroleum and Energy Studies, Dehradun, India)

  • Soumya Banerjee

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

Abstract

Software testing is time consuming and a costly activity. Effective generation of test cases is necessary in order to perform rigorous testing. There exist various techniques for effective test case generation. These techniques are based on various test adequacy criteria such as statement coverage, branch coverage etc. Automatic generation of test data has been the primary focus of software testing research in recent past. In this paper a novel approach based on chaotic behavior of firefly algorithm is proposed for test suite optimization. Test suite optimization problem is modeled in the framework of firefly algorithm. An Algorithm for test optimization based on firefly algorithm is also proposed. Experiments are performed on some benchmark Program and simulation results are compared for ABC algorithm, ACO algorithm, GA with Chaotic firefly algorithm. Major research findings are that chaotic firefly algorithm outperforms other bio inspired algorithm such as artificial bee colony, Ant colony optimization and Genetic Algorithm in terms of Branch coverage in software testing.

Suggested Citation

  • Abhishek Pandey & Soumya Banerjee, 2017. "Test Suite Optimization Using Chaotic Firefly Algorithm in Software Testing," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 8(4), pages 41-57, October.
    • Handle: RePEc:igg:jamc00:v:8:y:2017:i:4:p:41-57
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2017100103
    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:8:y:2017:i:4:p:41-57. 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.