Test Cost Optimization Using Tabu Search

Anu Sharma, Arpita Jadhav, Praveen Ranjan Srivastava, Renu Goyal

.
Computer Science and Information System Group, Birla Institute of Technology and Science, Pilani, India..

DOI: 10.4236/jsea.2010.35054                

Abstract

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.

Keywords

Tabu Search, Test Cost Optimization, Dijikstra’s Algorithm

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	B. Beizer, “Software Testing Techniques,” 2nd Edition, van Nostrand Reinhold, New York, 1990.
[2]	I. Sommerville, “Software Engineering, Pearson Educa- tion,” 7th Edition, Tata Mc-Graw Hill, India, 2005.
[3]	E. Diaz, J. Tuya and R. blanco “Automatic Software Testing Using a Metaheuristic Technique Based on Tabu Search,” Proceedings 18th IEEE International Conference on Automated Software Engineering, Montreal, 2003, pp. 301-313.
[4]	E. Díaz, J. Tuya, R. Blanco and J. J. Dolado, “A Tabu Search Algorithms for Structural Software Testing,” ACM proceeding, Vol. 35, No. 10, October 2008, pp. 3052- 3072.
[5]	P. McMinn, “Search-based Software Test Data Generation: A Survey”, Software Testing, Verification and Reliability, ACM library, Vol. 14, No. 2, 2004, pp 105-106.
[6]	F. Glover, “Tabu Search Part I,” ORSA Journal on Computing, Vol. 1, No. 3, 1989, pp. 190-206.
[7]	E. Díaz, J. Tuya, R. Blanco. “A Modular Tool for Automated Coverage in Software Testing,” Proceedings of the 7th Annual International Workshop on Software Technology and Engineering Practice, Amsterdam, 2003, pp. 241-246.
[8]	R. Blanco, J. Tuya and B. A. Diaz, “Automated Test Data Generation Using a Scatter Search Approach,” Infor- mation and Software Technology, Vol. 51, No. 4, 2009, pp. 708-720.
[9]	A. Misevičius, “Using Iterated Tabu Search for the Travelling Salesman Problem,” Information Technology and Control, Vol. 32, No. 3, 2004, pp.29-40.
[10]	R. Thamilselvan, D. P. Balasubramanie, “Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling,” IJCSIS Transactions on Software Enginee- ring, Vol. 2, No. 1, 2009, pp. 134-139.
[11]	J. Gustafsson, A. Ermedahl, and B. Lisper, “Algorithms for Infeasible Path Calculation,” 6th International Conference on Worst-Case Execution Time, Dresden, Euromicro Conference on Real-Time Systems, 2006.
[12]	R. Jasper, M. Brennan, K. Williamson and B. Currier, “Test Data Generation and Feasible Path Analysis,” Pro- ceeding of the International Symposium on Software Testing and Analysis, Seattle, ACM, 1994, pp.95-107.
[13]	J. Carlos, M. Alberto and Francisco, “A strategy for Evaluating Feasible and Unfeasible Test Cases for The Evolutionary Testing of Object-oriented Software,” 30th International Conference on Software Engineering, Leip- zig, 2008, pp. 85-92.
[14]	J. C. Lin and P. L. Yeh, “Automatic Test Data Generation for Path Testing Using GAs,” Information Sciences, Vol. 131, No. 1-4, 2006, pp. 2380-2401.
[15]	F. Glover and M. Laguna, “Tabu Search,” Kluwer Aca- demic Publishers, 1997.
[16]	“Dijkstra’s Algorithm,” Wikipedia. http://en.wikipedia. org/wiki/Dijkstra’s_algorithm