{"id":"https://openalex.org/W4318603612","doi":"https://doi.org/10.1109/ssci51031.2022.10022231","title":"Algorithm Selection across Algorithm Configurators A Case Study on Multi-objective Optimization","display_name":"Algorithm Selection across Algorithm Configurators A Case Study on Multi-objective Optimization","publication_year":2022,"publication_date":"2022-12-04","ids":{"openalex":"https://openalex.org/W4318603612","doi":"https://doi.org/10.1109/ssci51031.2022.10022231"},"language":"en","primary_location":{"id":"doi:10.1109/ssci51031.2022.10022231","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022231","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5024551178","display_name":"Mustafa M\u0131s\u0131r","orcid":"https://orcid.org/0000-0002-6885-6775"},"institutions":[{"id":"https://openalex.org/I4210159968","display_name":"Duke Kunshan University","ror":"https://ror.org/04sr5ys16","country_code":"CN","type":"education","lineage":["https://openalex.org/I170897317","https://openalex.org/I37461747","https://openalex.org/I4210159968"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mustafa Misir","raw_affiliation_strings":["Duke Kunshan University,Division of Natural and Applied Sciences,Kunshan,China","Division of Natural and Applied Sciences, Duke Kunshan University, Kunshan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke Kunshan University,Division of Natural and Applied Sciences,Kunshan,China","institution_ids":["https://openalex.org/I4210159968"]},{"raw_affiliation_string":"Division of Natural and Applied Sciences, Duke Kunshan University, Kunshan, China","institution_ids":["https://openalex.org/I4210159968"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024551178"],"corresponding_institution_ids":["https://openalex.org/I4210159968"],"apc_list":null,"apc_paid":null,"fwci":0.7488,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70918473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"22","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9846000075340271,"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/computer-science","display_name":"Computer science","score":0.6915667057037354},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.643335223197937},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6076108813285828},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.48619717359542847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4382791817188263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4210849404335022},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.31408220529556274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14949315786361694},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09042087197303772}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6915667057037354},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.643335223197937},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6076108813285828},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.48619717359542847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4382791817188263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4210849404335022},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.31408220529556274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14949315786361694},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09042087197303772},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci51031.2022.10022231","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022231","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W60686164","https://openalex.org/W1495775210","https://openalex.org/W1502328913","https://openalex.org/W2047003964","https://openalex.org/W2054141820","https://openalex.org/W2078841894","https://openalex.org/W2097998348","https://openalex.org/W2100235918","https://openalex.org/W2106334424","https://openalex.org/W2141119792","https://openalex.org/W2151554678","https://openalex.org/W2167159964","https://openalex.org/W2395284556","https://openalex.org/W2556522401","https://openalex.org/W2563364594","https://openalex.org/W2761554819","https://openalex.org/W2886362482","https://openalex.org/W2895357514","https://openalex.org/W2914875666","https://openalex.org/W2941281702","https://openalex.org/W2950680102","https://openalex.org/W2961614712","https://openalex.org/W3189094410","https://openalex.org/W4206164708","https://openalex.org/W4206931155","https://openalex.org/W4207077899","https://openalex.org/W4225683452","https://openalex.org/W4226474398","https://openalex.org/W6633277854","https://openalex.org/W6674385629","https://openalex.org/W6730169791"],"related_works":["https://openalex.org/W3084863322","https://openalex.org/W2093683727","https://openalex.org/W2465616004","https://openalex.org/W2057087473","https://openalex.org/W2392714184","https://openalex.org/W2081647779","https://openalex.org/W2389015757","https://openalex.org/W1607472309","https://openalex.org/W2606073172","https://openalex.org/W4237750775"],"abstract_inverted_index":{"The":[0,18,38,128,181],"present":[1],"work":[2],"utilizes":[3,118],"Algorithm":[4,121,186],"Selection":[5,122,187],"for":[6,13,84,112,139,169],"automatically":[7],"specifying":[8],"the":[9,26,42,45,53,56,59,71,80,107,134,163,203,208,216,220,228,233],"parameter":[10,21,35,46,82,99,157,191,229],"tuning":[11,16,22,73,100,110,137,192,230],"method":[12,138],"a":[14,65,96,113,140,147,153,171,178,199,223],"given":[15,50,141],"task.":[17],"idea":[19,129],"of":[20,55,68,144,155,173,219],"is":[23,94,130,196],"motivated":[24],"by":[25],"premature":[27],"algorithm":[28,111],"designs":[29,43],"and":[30,44],"their":[31],"sub-optimal":[32],"or":[33,58],"poor":[34],"value":[36],"choices.":[37],"decisions":[39],"both":[40],"on":[41,52,146,207,215,227],"values":[47,83],"are":[48,160],"largely":[49],"based":[51],"experiences":[54],"developers":[57],"target":[60],"problem":[61,209],"domain":[62],"experts":[63],"after":[64],"limited":[66],"number":[67],"trials.":[69],"While":[70],"existing":[72,120],"approaches":[74,159],"tend":[75],"to":[76,105,124,131,166],"offer":[77],"improvements":[78],"over":[79],"default":[81],"varying":[85],"algorithms,":[86],"they":[87],"can":[88],"be":[89],"computationally":[90],"expensive.":[91],"Additionally,":[92,202],"there":[93],"no":[95],"single,":[97],"ultimate":[98],"strategy.":[101],"These":[102],"facts":[103],"suggest":[104],"choose":[106],"most":[108,135],"effective":[109,136],"specific":[114],"scenario.":[115],"This":[116],"study":[117],"an":[119],"system":[123],"address":[125],"this":[126],"problem.":[127],"allocate":[132],"potentially":[133],"task":[142],"instead":[143],"relying":[145],"single":[148],"tuner.":[149],"On":[150],"that":[151,185],"note,":[152],"group":[154],"well-known":[156],"configuration":[158],"accommodated":[161],"as":[162,198],"candidate":[164],"methods":[165,193],"tune":[167],"NSGA-II":[168],"solving":[170],"suite":[172],"multi-objective":[174],"optimization":[175],"benchmarks,":[176],"refer-encing":[177],"recent":[179],"article.":[180],"computational":[182],"analysis":[183,205],"revealed":[184],"outperforms":[188],"those":[189],"constituent":[190],"when":[194],"each":[195],"used":[197],"standalone":[200],"manner.":[201],"dis/-similarity":[204],"carried":[206],"instances":[210],"/":[211],"benchmarks":[212],"give":[213],"hints":[214],"diversity":[217],"level":[218],"benchmarks.":[221],"Furthermore,":[222],"similar":[224],"inspection":[225],"reported":[226],"procedures":[231],"show":[232],"behavioural":[234],"resemblance":[235],"between":[236],"them.":[237]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}