{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:48:57Z","timestamp":1781110137734,"version":"3.54.1"},"reference-count":25,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.4018\/ijamc.2017100102","type":"journal-article","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T04:11:34Z","timestamp":1501560694000},"page":"27-40","source":"Crossref","is-referenced-by-count":2,"title":["Empirical Evaluation of Hill Climbing Algorithm"],"prefix":"10.4018","volume":"8","author":[{"given":"Manju","family":"Khari","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Guru Gobind Singh Indraprastha University, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prabhat","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJAMC.2017100102-0","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.52"},{"key":"IJAMC.2017100102-1","doi-asserted-by":"publisher","DOI":"10.4018\/IJACI.2016010103"},{"key":"IJAMC.2017100102-2","doi-asserted-by":"publisher","DOI":"10.4018\/IJRSDA.2016070102"},{"key":"IJAMC.2017100102-3","doi-asserted-by":"publisher","DOI":"10.4018\/ijrsda.2014070102"},{"key":"IJAMC.2017100102-4","doi-asserted-by":"publisher","DOI":"10.4018\/ijaci.2013070101"},{"key":"IJAMC.2017100102-5","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Dey, N., Samanta, S., & Balas, V. E. (2016). Firefly Algorithm for Optimized Non-rigid Demons Registration. In Bio-inspired computation and applications in image processing (pp. 221-237).","DOI":"10.1016\/B978-0-12-804536-7.00010-7"},{"key":"IJAMC.2017100102-6","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.785522"},{"key":"IJAMC.2017100102-7","doi-asserted-by":"publisher","DOI":"10.1109\/32.92910"},{"key":"IJAMC.2017100102-8","doi-asserted-by":"publisher","DOI":"10.3390\/jimaging1010060"},{"key":"IJAMC.2017100102-9","doi-asserted-by":"publisher","DOI":"10.1166\/jmihi.2014.1265"},{"key":"IJAMC.2017100102-10","article-title":"A Novel Margin-Based Measure for Directed Hill Climbing Ensemble Pruning.","author":"H.Guo","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"key":"IJAMC.2017100102-11","doi-asserted-by":"crossref","unstructured":"Hemalatha, S., & Anouncia, S. M. (2016). A Computational Model for Texture Analysis in Images with Fractional Differential Filter for Texture Detection. In Biometrics: Concepts, Methodologies, Tools, and Applications: Concepts, Methodologies, Tools, and Applications (p. 309).","DOI":"10.4018\/978-1-5225-0983-7.ch014"},{"key":"IJAMC.2017100102-12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39963-1_23"},{"key":"IJAMC.2017100102-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21212-8_12"},{"key":"IJAMC.2017100102-14","article-title":"Reinforcement Learning by Stochastic Hill Climbing.","author":"H.Kimura","year":"2016","journal-title":"Machine Learning"},{"key":"IJAMC.2017100102-15","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2267-y"},{"key":"IJAMC.2017100102-16","unstructured":"Kumar, R., Talukdar, F. A., Dey, N., & Balas, V. E. (2016). Quality Factor Optimization of Spiral Inductor using Firefly Algorithm and its Application in Amplifier. International Journal of Advanced Intelligence Paradigms. (In-press)."},{"key":"IJAMC.2017100102-17","doi-asserted-by":"publisher","DOI":"10.4018\/ijaci.2013100102"},{"key":"IJAMC.2017100102-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.065"},{"key":"IJAMC.2017100102-19","author":"C. R.Reeves","year":"1993","journal-title":"Modern heuristic techniques for combinatorial problems"},{"key":"IJAMC.2017100102-20","unstructured":"Samantaa, S., Dey, N., Das, P., Acharjee, S., & Chaudhuri, S. S. (2013). Multilevel threshold based gray scale image segmentation using cuckoo search. arXiv preprint arXiv:1307.0277"},{"key":"IJAMC.2017100102-21","doi-asserted-by":"publisher","DOI":"10.4018\/ijrsda.2015010101"},{"key":"IJAMC.2017100102-22","doi-asserted-by":"publisher","DOI":"10.4018\/IJRSDA.2016070104"},{"key":"IJAMC.2017100102-23","doi-asserted-by":"publisher","DOI":"10.1145\/2897010.2897012"},{"key":"IJAMC.2017100102-24","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6889-7"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=187216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T08:14:11Z","timestamp":1651824851000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2017100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":25,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2017100102","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}