{"id":"https://openalex.org/W4390483850","doi":"https://doi.org/10.1109/ssci52147.2023.10372043","title":"Characterization of CEC Single-Objective Optimization Competition Benchmarks and Algorithms","display_name":"Characterization of CEC Single-Objective Optimization Competition Benchmarks and Algorithms","publication_year":2023,"publication_date":"2023-12-05","ids":{"openalex":"https://openalex.org/W4390483850","doi":"https://doi.org/10.1109/ssci52147.2023.10372043"},"language":"en","primary_location":{"id":"doi:10.1109/ssci52147.2023.10372043","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci52147.2023.10372043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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 M\u0131s\u0131r","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29572203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"369","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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":1.0,"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.9994000196456909,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.8146305680274963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7179351449012756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6405359506607056},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.535230815410614},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.49813008308410645},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4759925603866577},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4545336365699768},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45276251435279846},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.44696685671806335},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.43666404485702515},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.4285503029823303},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41787058115005493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32002949714660645},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20311135053634644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13906905055046082}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8146305680274963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7179351449012756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6405359506607056},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.535230815410614},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.49813008308410645},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4759925603866577},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4545336365699768},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45276251435279846},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.44696685671806335},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.43666404485702515},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.4285503029823303},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41787058115005493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32002949714660645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20311135053634644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13906905055046082},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci52147.2023.10372043","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci52147.2023.10372043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","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":31,"referenced_works":["https://openalex.org/W1179686678","https://openalex.org/W1595159159","https://openalex.org/W1834439319","https://openalex.org/W1987234899","https://openalex.org/W2016114852","https://openalex.org/W2078841894","https://openalex.org/W2079581672","https://openalex.org/W2131613989","https://openalex.org/W2137340504","https://openalex.org/W2151554678","https://openalex.org/W2165299997","https://openalex.org/W2187089797","https://openalex.org/W2187537484","https://openalex.org/W2460516914","https://openalex.org/W2468302128","https://openalex.org/W2563364594","https://openalex.org/W2586121636","https://openalex.org/W2729414995","https://openalex.org/W2761554819","https://openalex.org/W2802720320","https://openalex.org/W2898873842","https://openalex.org/W2908549093","https://openalex.org/W2963862728","https://openalex.org/W2979736100","https://openalex.org/W3001859104","https://openalex.org/W3189094410","https://openalex.org/W4200065486","https://openalex.org/W4211116959","https://openalex.org/W4220866533","https://openalex.org/W4323922629","https://openalex.org/W6632686014"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2073248645","https://openalex.org/W3212179065","https://openalex.org/W2184070258","https://openalex.org/W2348923905","https://openalex.org/W4396917903","https://openalex.org/W4402187056","https://openalex.org/W1995335680","https://openalex.org/W3100729394","https://openalex.org/W2060431457"],"abstract_inverted_index":{"The":[0,23,104],"present":[1],"study":[2],"provides":[3],"an":[4],"analysis":[5,75,116],"on":[6,101,117],"the":[7,17,28,39,42,47,57,59,64,67,71,82,89,92,95,102,115,118,120,130],"characteristics":[8],"of":[9,35,94,122],"single-objective":[10],"optimization":[11,25,40],"benchmark":[12],"problems":[13],"as":[14,16],"well":[15],"algorithms":[18,68],"used":[19],"to":[20,45,62,70,128],"solve":[21],"them.":[22],"target":[24],"domain":[26],"involves":[27],"CEC":[29,72],"competitions,":[30],"each":[31,99],"consisting":[32],"a":[33,136],"set":[34],"mathematical":[36],"functions.":[37],"Concerning":[38],"tasks,":[41],"idea":[43],"is":[44,61,108],"investigate":[46],"dis/-similarities":[48,65],"between":[49,66],"different":[50],"competition":[51],"scenarios":[52],"and":[53,85],"individual":[54],"benchmarks.":[55,73,103],"For":[56],"solvers,":[58],"goal":[60],"detect":[63],"applied":[69],"Those":[74],"missions":[76],"are":[77],"carried":[78],"out":[79],"by":[80,98],"using":[81],"features":[83],"directly":[84],"automatically":[86],"extracted":[87],"from":[88],"performance":[90,131],"data,":[91],"quality":[93],"solutions":[96],"achieved":[97],"algorithm":[100,123],"feature":[105],"extraction":[106],"process":[107],"realized":[109],"through":[110],"Singular":[111],"Value":[112],"Decomposition.":[113],"Following":[114],"algorithms,":[119],"potential":[121],"selection":[124],"has":[125],"been":[126],"evaluated":[127],"see":[129],"improvement":[132],"without":[133],"actually":[134],"developing":[135],"new":[137],"algorithm,":[138],"against":[139],"those":[140],"20":[141],"algorithms.":[142]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}