{"id":"https://openalex.org/W2968116532","doi":"https://doi.org/10.1109/cec.2019.8790114","title":"A Surrogate-Assisted Cooperative Co-evolutionary Algorithm Using Recursive Differential Grouping as Decomposition Strategy","display_name":"A Surrogate-Assisted Cooperative Co-evolutionary Algorithm Using Recursive Differential Grouping as Decomposition Strategy","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2968116532","doi":"https://doi.org/10.1109/cec.2019.8790114","mag":"2968116532"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8790114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","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/A5070743730","display_name":"Julien Blanchard","orcid":"https://orcid.org/0000-0002-3423-4521"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Julien Blanchard","raw_affiliation_strings":["Department of Mathematics and naXys institute, University of Namur, Namur, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and naXys institute, University of Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078606667","display_name":"Charlotte Beauthier","orcid":"https://orcid.org/0000-0001-6413-0080"},"institutions":[{"id":"https://openalex.org/I4210125859","display_name":"Cenaero (Belgium)","ror":"https://ror.org/02acz2505","country_code":"BE","type":"company","lineage":["https://openalex.org/I4210125859"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Charlotte Beauthier","raw_affiliation_strings":["Cenaero Research Center, Gosselies, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cenaero Research Center, Gosselies, Belgium","institution_ids":["https://openalex.org/I4210125859"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001066958","display_name":"Timot\u00e9o Carletti","orcid":"https://orcid.org/0000-0003-2596-4503"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Timoteo Carletti","raw_affiliation_strings":["Department of Mathematics and naXys institute, University of Namur, Namur, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and naXys institute, University of Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2514,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.77215868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"689","last_page":"696"},"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.9988999962806702,"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.9919999837875366,"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/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.755489706993103},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6660597324371338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6592106223106384},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6180076003074646},{"id":"https://openalex.org/keywords/surrogate-model","display_name":"Surrogate model","score":0.5440901517868042},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.5250632166862488},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5050254464149475},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.49786925315856934},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47446852922439575},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4240935444831848},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4137202501296997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38346248865127563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2440701127052307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2319428026676178}],"concepts":[{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.755489706993103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6660597324371338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6592106223106384},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6180076003074646},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.5440901517868042},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.5250632166862488},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5050254464149475},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.49786925315856934},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47446852922439575},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4240935444831848},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4137202501296997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38346248865127563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2440701127052307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2319428026676178},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2019.8790114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/14d30228-1b99-4136-9517-bb43cf15ae3d","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/14d30228-1b99-4136-9517-bb43cf15ae3d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Blanchard, J, Beauthier, C & Carletti, T 2019, A Surrogate-Assisted Cooperative Co-evolutionary Algorithm Using Recursive Differential Grouping as Decomposition Strategy. in 2019 IEEE Congress on Evolutionary Computation (CEC)., 8790114, 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings, IEEE, pp. 674-681, 2019 IEEE Congress On Evolutionary Computation, Wellington, New Zealand, 10/06/19. https://doi.org/10.1109/CEC.2019.8790114","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1555689267","https://openalex.org/W2081709852","https://openalex.org/W2093229042","https://openalex.org/W2109472859","https://openalex.org/W2121429049","https://openalex.org/W2138002307","https://openalex.org/W2145418868","https://openalex.org/W2156773695","https://openalex.org/W2186133676","https://openalex.org/W2608705546","https://openalex.org/W2730151218","https://openalex.org/W2735847872","https://openalex.org/W2769744156","https://openalex.org/W2774185825","https://openalex.org/W2887028527","https://openalex.org/W2891389374","https://openalex.org/W2963239676","https://openalex.org/W3015571647","https://openalex.org/W4237171445","https://openalex.org/W6676230053","https://openalex.org/W6681578160"],"related_works":["https://openalex.org/W2394392475","https://openalex.org/W2069937987","https://openalex.org/W2997761200","https://openalex.org/W1571424162","https://openalex.org/W2015132550","https://openalex.org/W3006802988","https://openalex.org/W2235797280","https://openalex.org/W3199390665","https://openalex.org/W2126943800","https://openalex.org/W2060670447"],"abstract_inverted_index":{"Cooperative":[0],"co-evolutionary":[1],"algorithms,":[2],"especially":[3],"those":[4],"able":[5],"to":[6,48,67,95,100,121,136],"uncover":[7],"interaction":[8],"structure":[9],"between":[10],"variables,":[11],"have":[12],"a":[13,108,147],"great":[14],"potential":[15],"in":[16,24,54],"optimizing":[17],"large-scale":[18,97],"problems.":[19,44,128],"Nevertheless,":[20],"they":[21],"are":[22,144],"expensive":[23,42,69,125],"terms":[25],"of":[26,28,57,103,149],"number":[27],"function":[29,70],"evaluations":[30],"and":[31,116,126,152],"this":[32,106],"issue":[33],"can":[34],"be":[35],"quite":[36],"problematic":[37],"when":[38],"dealing":[39],"with":[40,50],"computationally":[41],"optimization":[43],"An":[45],"effective":[46,87],"approach":[47],"deal":[49],"such":[51],"problems":[52,90,98,151],"lies":[53],"the":[55,68,72,101],"exploitation":[56],"surrogate":[58,117],"models.":[59],"The":[60,129],"latter":[61],"ones":[62],"work":[63],"as":[64],"cheap-to-evaluate":[65],"alternatives":[66],"reducing":[71],"computational":[73],"cost,":[74],"while":[75],"still":[76],"providing":[77],"improved":[78],"designs.":[79],"This":[80],"process,":[81],"called":[82],"surrogate-assisted":[83],"optimization,":[84],"is":[85,92,119],"very":[86],"on":[88,146],"small-dimensional":[89],"but":[91],"not":[93],"suitable":[94],"solve":[96,123],"due":[99],"curse":[102],"dimensionality.":[104],"In":[105],"paper,":[107],"new":[109],"algorithm,":[110],"taking":[111],"benefit":[112],"from":[113],"cooperative":[114],"coevolution":[115],"models,":[118],"introduced":[120],"efficiently":[122],"high-dimensional,":[124],"black-box":[127],"proposed":[130],"algorithm":[131],"uses":[132],"recursive":[133],"differential":[134],"grouping":[135],"perform":[137],"an":[138],"accurate":[139],"problem":[140],"decomposition.":[141],"Experimental":[142],"results":[143],"provided":[145],"set":[148],"1000-dimensional":[150],"show":[153],"promising":[154],"results.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}