Author(s)

So-Yeong Jeon, Yong-Hyuk Kim

.

Search-based software engineering has mainly dealt with automated test data generation by metaheuristic search techniques. Similarly, we try to generate the test data (i.e., problem instances) which show the worst case of algorithms by such a technique. In this paper, in terms of non-functional testing, we re-define the worst case of some algorithms, respectively. By using genetic algorithms (GAs), we illustrate the strategies corresponding to each type of instances. We here adopt three problems for examples; the sorting problem, the 0/1 knapsack problem (0/1KP), and the travelling salesperson problem (TSP). In some algorithms solving these problems, we could find the worst-case instances successfully; the successfulness of the result is based on a statistical approach and comparison to the results by using the random testing. Our tried examples introduce informative guidelines to the use of genetic algorithms in generating the worst-case instance, which is defined in the aspect of algorithm performance.

Search-Based Software Engineering, Automated Test Data Generation, Worst-Case Instance, Algorithm

Jeon, S. and Kim, Y. (2010) A Genetic Approach to Analyze Algorithm Performance Based on the Worst-Case Instances. Journal of Software Engineering and Applications, 3, 767-775. doi: 10.4236/jsea.2010.38089.