{"id":"https://openalex.org/W4313061940","doi":"https://doi.org/10.1109/asyu56188.2022.9925491","title":"Improving Equlibrium Optimization Algorithm Performance with Optimization to Optimization Approach","display_name":"Improving Equlibrium Optimization Algorithm Performance with Optimization to Optimization Approach","publication_year":2022,"publication_date":"2022-09-07","ids":{"openalex":"https://openalex.org/W4313061940","doi":"https://doi.org/10.1109/asyu56188.2022.9925491"},"language":"en","primary_location":{"id":"doi:10.1109/asyu56188.2022.9925491","doi":"https://doi.org/10.1109/asyu56188.2022.9925491","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asyu56188.2022.9925491","pdf_url":null,"source":{"id":"https://openalex.org/S4363608363","display_name":"Innovations in Intelligent Systems and Applications Conference (ASYU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Innovations in Intelligent Systems and Applications Conference (ASYU)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5073579857","display_name":"Mehmet Akpamuk\u00e7u","orcid":"https://orcid.org/0000-0002-3763-5048","observed_orcids":["https://orcid.org/0000-0002-3763-5048"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mehmet Akpamuk\u00e7u","raw_affiliation_strings":["\u00ddn\u00f6n\u00fc \u00dcniversitesi M\u00fchendislik, Fak\u00fcltesi, Bilgisayar M\u00fchendisli\u011fi, B\u00f6l\u00fcm\u00fc,Malatya,T\u00fcrkiye"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00ddn\u00f6n\u00fc \u00dcniversitesi M\u00fchendislik, Fak\u00fcltesi, Bilgisayar M\u00fchendisli\u011fi, B\u00f6l\u00fcm\u00fc,Malatya,T\u00fcrkiye","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050360392","display_name":"Abdullah Ate","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdullah Ate","raw_affiliation_strings":["\u00ddn\u00f6n\u00fc \u00dcniversitesi M\u00fchendislik, Fak\u00fcltesi, Bilgisayar M\u00fchendisli\u011fi, B\u00f6l\u00fcm\u00fc,Malatya,T\u00fcrkiye"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00ddn\u00f6n\u00fc \u00dcniversitesi M\u00fchendislik, Fak\u00fcltesi, Bilgisayar M\u00fchendisli\u011fi, B\u00f6l\u00fcm\u00fc,Malatya,T\u00fcrkiye","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic-parameter-tuning","display_name":"metaheuristic parameter tuning","score":0.7459999918937683},{"id":"https://openalex.org/keywords/algorithm-parameter-optimization","display_name":"algorithm parameter optimization","score":0.5720000267028809},{"id":"https://openalex.org/keywords/benchmark-functions","display_name":"benchmark functions","score":0.7870000004768372},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.7570000290870667}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8041640520095825},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.6830077171325684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6018435955047607},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.5714046359062195},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5655717253684998},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.563342273235321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5594512820243835},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.5525592565536499},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.5269770622253418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5223121047019958},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.35455745458602905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34012681245803833},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asyu56188.2022.9925491","doi":"https://doi.org/10.1109/asyu56188.2022.9925491","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asyu56188.2022.9925491","pdf_url":null,"source":{"id":"https://openalex.org/S4363608363","display_name":"Innovations in Intelligent Systems and Applications Conference (ASYU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Innovations in Intelligent Systems and Applications Conference (ASYU)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4405720517","https://openalex.org/W3108407064","https://openalex.org/W4386714901","https://openalex.org/W2985845430","https://openalex.org/W3118607127","https://openalex.org/W4390578309","https://openalex.org/W4389783834","https://openalex.org/W4282824875","https://openalex.org/W4251759781","https://openalex.org/W4306897026"],"abstract_inverted_index":{"In":[0,58],"this":[1,59,132],"study,":[2,60],"the":[3,6,15,22,29,33,36,46,65,74,79,83,94,110,119,147,157,165,172,178,181,190,193],"performance":[4,122],"of":[5,64,113,192],"Equilibrium":[7,66,195],"Optimization":[8,40,67,196],"(EO)":[9],"algorithm":[10,24,31,42,68,107,137,167],"has":[11,25,52,150,168],"been":[12,26,53,70,99,151,169,185],"improved":[13],"with":[14,104,156,171,189],"optimization":[16,18,121,158,160],"to":[17,101,117,153,159],"(OO)":[19],"approach.":[20,161],"While":[21],"EO":[23,114],"used":[27,44,77],"as":[28,45],"basic":[30,62,111],"in":[32,78,93,115,131,177,187],"OO":[34],"approach,":[35],"Stochastics":[37],"Multi-parameters":[38],"Divergence":[39],"(SMDO)":[41],"is":[43],"auxiliary":[47],"algorithm.":[48,197],"The":[49],"proposed":[50],"structure":[51],"tested":[54,170],"on":[55],"benchmark":[56,75,175],"functions.":[57],"three":[61,88],"parameters":[63,89],"have":[69,98,184],"optimized":[71,103],"separately":[72],"for":[73,146],"functions":[76,176],"study":[80],"by":[81,123],"using":[82],"SMDO":[84],"method.":[85],"Although":[86],"these":[87],"were":[90],"kept":[91],"constant":[92],"original":[95,194],"algorithm,":[96],"they":[97,126],"tried":[100,152],"be":[102,154],"an":[105],"upper":[106],"without":[108],"changing":[109],"philosophy":[112],"order":[116],"increase":[118],"current":[120],"ensuring":[124],"that":[125,138],"take":[127],"more":[128,141],"appropriate":[129],"values":[130],"study.":[133],"Thus":[134],"a":[135,163],"strong":[136],"can":[139],"produce":[140],"efficient":[142],"and":[143,180],"better":[144],"results":[145,182,191],"existing":[148],"problem":[149],"created":[155],"As":[162],"result,":[164],"obtained":[166,183],"most":[173],"well-known":[174],"literature":[179],"presented":[186],"comparison":[188]},"counts_by_year":[],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2023-01-06T00:00:00"}