2017 9th International Conference on Electronics, Computers and Artificial Intelligence (ECAI) 2017
DOI: 10.1109/ecai.2017.8166445
|View full text |Cite
|
Sign up to set email alerts
|

Solving test suite reduction problem using greedy and genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…This is because TSR did not provide useful information for fault localisation. In contrast, Yamuç et al [42] presented a steady-state genetic algorithm (SSGA)-based TSR approach. They compared the attained performance with the traditional greedy algorithm [33].…”
Section: Evolutionary-basedmentioning
confidence: 99%
“…This is because TSR did not provide useful information for fault localisation. In contrast, Yamuç et al [42] presented a steady-state genetic algorithm (SSGA)-based TSR approach. They compared the attained performance with the traditional greedy algorithm [33].…”
Section: Evolutionary-basedmentioning
confidence: 99%
“…Yamuç et al [29] presents a GA based approach for test case reduction along its comparison with a greedy approach using 1, 000 test cases and a sum of 10, 000 test requirements. Although, greedy approach produces better results in terms of execution time GA substantially outperforms greedy algorithm in terms of cost reduction with a factor of 26.14%.…”
Section: B Meta-heuristic Algorithm Categorymentioning
confidence: 99%
“…Many studies reported that essential expectations are satisfied by the greedy approach. In spite of this, a greedy algorithm carries a crucial weakness: it stuck into local search space and produce sub-optimal solutions [29]. It can work effectively for the nearest solutions but for global solutions, it is not successful.…”
Section: G Comparison Of Categoriesmentioning
confidence: 99%
“…MHBG_TCS approach is hybrid of bee colony optimization and genetic algorithm with focus on time constraint in regression testing. Yamuc et al [10] have used greedy algorithm and genetic algorithm for the test suite minimization. Authors have achieved efficient performance of the proposed approach for suite reduction.…”
Section: A Test Suite Minimizationmentioning
confidence: 99%