In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal
Simulated Annealing and Genetic Algorithms for Optimal Regression Testing
β Scribed by Mansour, Nashat; El-Fakih, Khalid
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 252 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1040-550X
No coin nor oath required. For personal study only.
β¦ Synopsis
The optimal regression testing problem is one of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. We present two natural optimization algorithms, namely, a simulated annealing and a genetic algorithm, for solving this problem. The algorithms are based on an integer programming problem formulation and the program's control flow graph. The main advantage of these algorithms, in comparison with exact algorithms, is that they do not suffer from an exponential explosion for realistic program sizes. The experimental results, which include a comparison with previous algorithms, show that the simulated annealing and genetic algorithms find the optimal or near-optimal number of retests within a reasonable time.
π SIMILAR VOLUMES
Information retrieval using probabilistic techniques has ## 1. Introduction attracted significant attention on the part of researchers in information and computer science over the past few In the past few decades, the availability of cheap and decades. In the 1980s, knowledge-based techniques effe