{"id":"https://openalex.org/W2910121258","doi":"https://doi.org/10.1109/aiccsa.2018.8612880","title":"Likelihood-Based Random Search Technique for Solving Unconstrained Optimization Problems","display_name":"Likelihood-Based Random Search Technique for Solving Unconstrained Optimization Problems","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2910121258","doi":"https://doi.org/10.1109/aiccsa.2018.8612880","mag":"2910121258"},"language":"en","primary_location":{"id":"doi:10.1109/aiccsa.2018.8612880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2018.8612880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACS 15th International Conference on Computer Systems and Applications (AICCSA)","raw_type":"proceedings-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/A5020113089","display_name":"Muhammed J. Al-Muhammed","orcid":"https://orcid.org/0000-0002-1845-4364"},"institutions":[{"id":"https://openalex.org/I161387315","display_name":"American University of Madaba","ror":"https://ror.org/04tgeej53","country_code":"JO","type":"education","lineage":["https://openalex.org/I161387315"]}],"countries":["JO"],"is_corresponding":true,"raw_author_name":"Muhammed J. Al-Muhammed","raw_affiliation_strings":["Faculty of Information Technology, American University of Madaba, Madaba, Jordan"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, American University of Madaba, Madaba, Jordan","institution_ids":["https://openalex.org/I161387315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020113089"],"corresponding_institution_ids":["https://openalex.org/I161387315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16759766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6678634881973267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6009321212768555},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5703322887420654},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.5393540263175964},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5240376591682434},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.44475600123405457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32233577966690063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26959067583084106}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6678634881973267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6009321212768555},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5703322887420654},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.5393540263175964},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5240376591682434},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.44475600123405457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32233577966690063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26959067583084106}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aiccsa.2018.8612880","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2018.8612880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACS 15th International Conference on Computer Systems and Applications (AICCSA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1859314164","https://openalex.org/W1867216943","https://openalex.org/W2006907039","https://openalex.org/W2034126864","https://openalex.org/W2091785502","https://openalex.org/W2119401655","https://openalex.org/W2171246246","https://openalex.org/W2512379863","https://openalex.org/W2549617326","https://openalex.org/W2736831631","https://openalex.org/W2757438657","https://openalex.org/W2782465233","https://openalex.org/W2914275007","https://openalex.org/W4211249017","https://openalex.org/W6729329756"],"related_works":["https://openalex.org/W4299455866","https://openalex.org/W2995097707","https://openalex.org/W2997067626","https://openalex.org/W3034393045","https://openalex.org/W2045438354","https://openalex.org/W1579561123","https://openalex.org/W1603259840","https://openalex.org/W167034497","https://openalex.org/W3123386130","https://openalex.org/W2003581559"],"abstract_inverted_index":{"Although":[0],"many":[1],"methods":[2],"have":[3],"been":[4],"devised":[5],"for":[6,15,54,68,118],"solving":[7,29],"optimization":[8,31,55],"problems,":[9],"there":[10],"still":[11],"a":[12],"pressing":[13],"need":[14],"more":[16],"effective":[17,27,105],"and":[18,65,77],"efficient":[19],"techniques.":[20],"Most":[21],"of":[22,73,113],"the":[23,30,62,70,74,82,91,114],"proposed":[24,58],"techniques":[25,67,79],"are":[26],"in":[28,106],"problems.":[32,56],"They,":[33],"however,":[34],"fall":[35],"short":[36],"when":[37],"dealing":[38],"with":[39,44,96],"specific":[40],"problems":[41,43],"(e.g.":[42],"multiple":[45],"local":[46],"optima).":[47],"This":[48],"paper":[49],"offers":[50],"an":[51],"innovative":[52],"technique":[53],"The":[57],"method":[59,103,131],"combines":[60],"between":[61],"random-guided":[63],"search":[64,75,83],"both":[66],"identifying":[69],"promising":[71,86],"regions":[72],"space":[76],"mapping":[78],"that":[80,101,129],"bias":[81],"to":[84,134],"these":[85],"regions;":[87],"thereby":[88],"quickly":[89],"finding":[90,107],"global":[92,115],"minimum":[93,116],"values.":[94],"Experiments":[95],"our":[97,102,130],"prototype":[98],"implementation":[99],"showed":[100,128],"is":[104,132],"exact":[108],"or":[109],"very":[110],"close":[111],"approximation":[112],"values":[117],"challenging":[119],"functions":[120],"obtained":[121],"from":[122],"well-known":[123],"benchmarks.":[124],"Our":[125],"comparative":[126],"study":[127],"superior":[133],"other":[135],"state-of-art":[136],"methods.":[137]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}