2017 4th International Conference on Information Science and Control Engineering (ICISCE) 2017
DOI: 10.1109/icisce.2017.176
|View full text |Cite
|
Sign up to set email alerts
|

A Test Suite Reduction Method Based on Novel Quantum Ant Colony Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…Mohapatra and Prasad [11] have employed Ant Colony Optimization on Java programs, and analyzed the performance for reduced suite and complexity to traditional techniques. The quantum-inspired ACO approach for test suite reduction was developed by Zhang et al [12]. The suggested method outperformed previous ACOs in terms of a % decrease in size.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Mohapatra and Prasad [11] have employed Ant Colony Optimization on Java programs, and analyzed the performance for reduced suite and complexity to traditional techniques. The quantum-inspired ACO approach for test suite reduction was developed by Zhang et al [12]. The suggested method outperformed previous ACOs in terms of a % decrease in size.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Zhang et al [35] put forward a method for reduction of test suite based on modified quantum ant colony algorithm. They utilize seven programs written in C from the Siemens test suite and run it on a Linux platform.…”
Section: ) Ant Colony Algorithmmentioning
confidence: 99%
“…Ant Colony Optimization (ACO) is also a meta-heuristic approach, which tries to find the smallest path from all test cases, but it does not cover all the test cases, which are required [36]. Like a greedy algorithm, ACO also gets trapped in local optimum and its convergence rate is slow to some extent [35], [36]. This problem of convergence can be solved with the help of improved quantum ant colony algorithm and modified ant colony optimization.…”
Section: G Comparison Of Categoriesmentioning
confidence: 99%
“…Consequently, it needs to be treated as a dynamic multi-objective problem that considers various alternatives for finding an optimum balance between budget as well as the effectiveness. In the literature, different techniques like Genetic Algorithms [10,11], Ant Colony Algorithms [12,13], Greedy Algorithms [14,15], Fuzzy Logic [16] have been used for solving this problem.…”
Section: Introductionmentioning
confidence: 99%