{"id":"https://openalex.org/W2739485012","doi":"https://doi.org/10.4018/ijamc.2017100102","title":"Empirical Evaluation of Hill Climbing Algorithm","display_name":"Empirical Evaluation of Hill Climbing Algorithm","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2739485012","doi":"https://doi.org/10.4018/ijamc.2017100102","mag":"2739485012"},"language":"en","primary_location":{"id":"doi:10.4018/ijamc.2017100102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2017100102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028897862","display_name":"Manju Khari","orcid":"https://orcid.org/0000-0001-5395-5335"},"institutions":[{"id":"https://openalex.org/I105454292","display_name":"Guru Gobind Singh Indraprastha University","ror":"https://ror.org/034q1za58","country_code":"IN","type":"education","lineage":["https://openalex.org/I105454292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manju Khari","raw_affiliation_strings":["Department of Computer Science and Engineering, Guru Gobind Singh Indraprastha University, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Guru Gobind Singh Indraprastha University, Delhi, India","institution_ids":["https://openalex.org/I105454292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026462797","display_name":"Prabhat Kumar","orcid":"https://orcid.org/0000-0001-9945-7702"},"institutions":[{"id":"https://openalex.org/I11793825","display_name":"National Institute of Technology Patna","ror":"https://ror.org/056wyhh33","country_code":"IN","type":"education","lineage":["https://openalex.org/I11793825","https://openalex.org/I4210152752"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prabhat Kumar","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, India","institution_ids":["https://openalex.org/I11793825"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9987,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78249788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"4","first_page":"27","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.6731316447257996},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5581691861152649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5564221739768982},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.5491297245025635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5180766582489014},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45568254590034485},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4207955300807953},{"id":"https://openalex.org/keywords/climbing","display_name":"Climbing","score":0.41452455520629883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3602602183818817},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.05678895115852356}],"concepts":[{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6731316447257996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5581691861152649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5564221739768982},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.5491297245025635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5180766582489014},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45568254590034485},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4207955300807953},{"id":"https://openalex.org/C95038775","wikidata":"https://www.wikidata.org/wiki/Q22857","display_name":"Climbing","level":2,"score":0.41452455520629883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3602602183818817},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.05678895115852356},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijamc.2017100102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2017100102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:8:y:2017:i:4:p:27-40","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2017100102","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1485905671","https://openalex.org/W1559215823","https://openalex.org/W2001432653","https://openalex.org/W2036179701","https://openalex.org/W2040058117","https://openalex.org/W2075077499","https://openalex.org/W2110337982","https://openalex.org/W2111809775","https://openalex.org/W2118240569","https://openalex.org/W2120552859","https://openalex.org/W2121328218","https://openalex.org/W2136169366","https://openalex.org/W2165190832","https://openalex.org/W2294989275","https://openalex.org/W2309178873","https://openalex.org/W2325627303","https://openalex.org/W2340247612","https://openalex.org/W2403576681","https://openalex.org/W2412992225","https://openalex.org/W2413367383","https://openalex.org/W2493781167","https://openalex.org/W2495451202","https://openalex.org/W2509396406","https://openalex.org/W2892991817","https://openalex.org/W4252136394"],"related_works":["https://openalex.org/W643038845","https://openalex.org/W2143761673","https://openalex.org/W4317738234","https://openalex.org/W2060963430","https://openalex.org/W2020542318","https://openalex.org/W1978379809","https://openalex.org/W4388209346","https://openalex.org/W3095130276","https://openalex.org/W2410068627","https://openalex.org/W2375625581"],"abstract_inverted_index":{"The":[0,32,74,106],"software":[1],"is":[2,15,35,80,94,113],"growing":[3],"in":[4,122,129],"size":[5],"and":[6,49,61,100],"complexity":[7],"every":[8],"day":[9],"due":[10],"to":[11,21,131],"which":[12,26],"strong":[13],"need":[14],"felt":[16],"by":[17,37],"the":[18,24,38,45,66,77,83,97,101,124,133],"research":[19],"community":[20],"search":[22],"for":[23,65],"techniques":[25],"can":[27],"optimize":[28],"test":[29,91,127],"cases":[30,128],"effectively.":[31],"current":[33],"study":[34],"inspired":[36],"collective":[39],"behavior":[40],"of":[41,47,53,68,76,85,89,103,126],"finding":[42,69],"paths":[43],"from":[44],"colony":[46],"food":[48],"uses":[50],"different":[51],"versions":[52],"Hill":[54],"Climbing":[55],"Algorithm":[56],"(HCA)":[57],"such":[58],"as":[59],"Stochastic,":[60],"Steepest":[62,119],"Ascent":[63,120],"HCA":[64,112,121],"purpose":[67],"a":[70],"good":[71],"optimal":[72],"solution.":[73],"performance":[75],"proposed":[78,110],"algorithm":[79],"verified":[81],"on":[82],"basis":[84],"three":[86],"parameters":[87],"comprising":[88],"optimized":[90],"cases,":[92],"time":[93],"taken":[95],"during":[96],"optimization":[98,104,134],"process,":[99],"percentage":[102,116],"achieved.":[105],"results":[107],"suggest":[108],"that":[109],"Stochastic":[111],"significantly":[114],"average":[115],"better":[117],"than":[118],"reducing":[123],"number":[125],"order":[130],"accomplish":[132],"target.":[135]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}