Abstract
The software is growing in size and complexity every day due to which strong need is felt by the research community to search for the techniques which can optimize test cases effectively. The current study is inspired by the collective behavior of finding paths from the colony of food and uses different versions of Hill Climbing Algorithm (HCA) such as Stochastic, and Steepest Ascent HCA for the purpose of finding a good optimal solution. The performance of the proposed algorithm is verified on the basis of three parameters comprising of optimized test cases, time is taken during the optimization process, and the percentage of optimization achieved. The results suggest that proposed Stochastic HCA is significantly average percentage better than Steepest Ascent HCA in reducing the number of test cases in order to accomplish the optimization target.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Metaheuristic Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
