Test Cost Optimization Using Tabu Search
نویسندگان
چکیده
In order to deliver a complete reliable software product, testing is performed. As testing phase carries on, cost of testing process increases and it directly affects the overall project cost. Many a times it happens that the actual cost becomes more than the estimated cost. Cost is considered as the most important parameter with respect to software testing, in software industry. In recent year’s researchers have done a variety of work in the area of Cost optimization by using various concepts like Genetic Algorithm, simulated annealing and Automation in generation of test data etc. This paper proposes an efficient cost effective approach for optimizing the cost of testing using Tabu Search (TS), which will provide maximum code coverage along with the concepts of Dijkstra’s Algorithm which will be implemented in Aspiration criteria of Tabu Search in order to optimize the cost and generate a minimum cost path with maximum coverage.
منابع مشابه
Using Tabu Search Method for Optimizing the Cost of Hybrid BIST
This paper deals with a hybrid BIST solution for testing systems-on-chip, which combines pseudorandom test patterns with stored precomputed deterministic test patterns. A method is proposed for finding the optimal balance between pseudorandom and stored test patterns to perform core test with minimum cost of time and memory, and without losing test quality. As a generalization of local optimiza...
متن کاملOptimization of Basis Path Testing using Genetic Tabu Search Algorithm
The test cases are generated manually as well as automatically to test software product. Manual test case generation require more time and cost than automatic test case generation. Automated generated test cases decrease the time and cost of testing process. Nowadays software companies are turning towards automated test case generation. After the generation of test cases, there is need to optim...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملEfficient Edge-swapping heuristics for the reload cost spanning tree problem
The reload cost spanning tree problem (RCSTP) is an NP-hard problem, where we are given a set of nonnegative pairwise demands between nodes, each edge is colored and a reload cost is incurred when a color change occurs on the path between a pair of demand nodes. The goal is to find a spanning tree with minimum reload cost. We propose a tree-nontree edge swap neighborhood for the RCSTP and an ef...
متن کاملAn Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. A customer, contrary to what is assumed in the classical vehicle routing problem, can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSEA
دوره 3 شماره
صفحات -
تاریخ انتشار 2010