Search the best greedy algorithm with Hill climbing experiments for covering array generation
نویسندگان
چکیده
Many researchers have been working on the greedy algorithms for covering array generation; a framework has been built to integrate most of these greedy methods, and more new approaches can be derived from this framework. However, such a framework is affected by multiple dependent or independent factors, which makes its deployment and optimization very challenging. In this paper, we design Hill climbing experiments based on six decisions of the framework, aim to search the best greedy algorithm for covering array generation, the results show that the identified optimal configuration for the framework is competitive.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملA Comparison of Greedy Search Algorithms
We discuss the relationships between three approaches to greedy heuristic search: best-first, hill-climbing, and beam search. We consider the design decisions within each family and point out their oft-overlooked similarities. We consider the following best-first searches: weighted A*, greedy search,
متن کاملAn Empirical Analysis of Search in GSATIan
We describe an extensive study of search in GSAT, an approximation procedure for propositional satissability. GSAT performs greedy hill-climbing on the number of satissed clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We ...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملLocating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formulates this problem as a search based software engineering problem. To evaluate the approach, the paper introduces an instance of a search based slicing problem concerned with locating sets of slices that decompose a pro...
متن کامل