{"id":"https://openalex.org/W2062050542","doi":"https://doi.org/10.1109/cec.2009.4983052","title":"A cooperative coevolutionary algorithm with Correlation based Adaptive Variable Partitioning","display_name":"A cooperative coevolutionary algorithm with Correlation based Adaptive Variable Partitioning","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2062050542","doi":"https://doi.org/10.1109/cec.2009.4983052","mag":"2062050542"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983052","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983052","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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/A5061883146","display_name":"Tapabrata Ray","orcid":"https://orcid.org/0000-0003-1950-5917"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Tapabrata Ray","raw_affiliation_strings":["School of Aerospace, Civil and Mechanical Engineering, University of New South Wales, Canberra, Australia","School of Aerospace, Civil and Mechanical Engineering, University of New South Wales at Australian Defence Force Academy, Canberra ACT, Australia"],"affiliations":[{"raw_affiliation_string":"School of Aerospace, Civil and Mechanical Engineering, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]},{"raw_affiliation_string":"School of Aerospace, Civil and Mechanical Engineering, University of New South Wales at Australian Defence Force Academy, Canberra ACT, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["The Centre of Excellence of Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Binningham, Birmingham, UK","Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The Centre of Excellence of Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":[]},{"raw_affiliation_string":"Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061883146"],"corresponding_institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":6.3228,"has_fulltext":false,"cited_by_count":115,"citation_normalized_percentile":{"value":0.96369045,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"983","last_page":"989"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6711757183074951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6551373600959778},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5867723822593689},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4734518229961395},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4620280861854553},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44636744260787964},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4163903295993805},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.4150581359863281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38696321845054626},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28190404176712036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21104943752288818},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.0838594138622284}],"concepts":[{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6711757183074951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6551373600959778},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5867723822593689},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4734518229961395},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4620280861854553},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44636744260787964},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4163903295993805},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4150581359863281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38696321845054626},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28190404176712036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21104943752288818},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.0838594138622284},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cec.2009.4983052","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983052","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.4554","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.4554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~xin/papers/RayYaoCEC09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.343.2980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.343.2980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/14cd9409-e824-4456-a123-628476aea318","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/14cd9409-e824-4456-a123-628476aea318","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ray, T & Yao, X 2009, 'A Cooperative Coevolutionary Algorithm with Correlation Based Adaptive Variable Partitioning', Paper presented at Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC2009), 18/05/09 pp. 983-989. https://doi.org/10.1109/CEC.2009.4983052","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W12307245","https://openalex.org/W177097005","https://openalex.org/W1555689267","https://openalex.org/W1586736769","https://openalex.org/W1979634789","https://openalex.org/W2074064918","https://openalex.org/W2094453630","https://openalex.org/W2109940662","https://openalex.org/W2121429049","https://openalex.org/W2126105956","https://openalex.org/W2129822022","https://openalex.org/W2132181343","https://openalex.org/W2134098137","https://openalex.org/W2160279822","https://openalex.org/W2164655924","https://openalex.org/W6607242664","https://openalex.org/W6633323278"],"related_works":["https://openalex.org/W2352794675","https://openalex.org/W1539994214","https://openalex.org/W2051228988","https://openalex.org/W4247094814","https://openalex.org/W108531593","https://openalex.org/W2111712077","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2162911572","https://openalex.org/W2022485595"],"abstract_inverted_index":{"A":[0],"cooperative":[1,99],"coevolutionary":[2,100],"algorithm":[3,11,101],"(CCEA)":[4],"is":[5,54,90,118],"an":[6,9,22,35,59],"extension":[7],"to":[8,20,68,109,124,132],"evolutionary":[10],"(EA);":[12],"it":[13],"employs":[14],"a":[15,29,52,98],"divide":[16],"and":[17,42,61,96,122],"conquer":[18],"strategy":[19],"solve":[21],"optimization":[23,36,76],"problem.":[24,77],"In":[25],"its":[26,62,87,126],"basic":[27,88],"form,":[28],"CCEA":[30,53,85,121],"splits":[31],"the":[32,72,75,130,146],"variables":[33,139],"of":[34,51,74,116,145],"problem":[37],"into":[38,83],"multiple":[39],"smaller":[40],"subsets":[41],"evolves":[43],"them":[44],"independently":[45],"in":[46,86,142],"different":[47,143],"subpopulations.":[48],"The":[49,114],"dynamics":[50],"far":[55],"more":[56],"complex":[57],"than":[58],"EA":[60,123],"performance":[63,115],"can":[64],"vary":[65,141],"from":[66],"good":[67],"bad":[69],"depending":[70],"on":[71],"separability":[73,137],"This":[78],"paper":[79],"provides":[80],"some":[81],"insights":[82],"why":[84],"form":[89],"not":[91],"suitable":[92],"for":[93],"nonseparable":[94],"problems":[95,135],"introduces":[97],"with":[102,111,120,134],"correlation":[103],"based":[104],"adaptive":[105],"variable":[106],"partitioning":[107],"(CCEA-AVP)":[108],"deal":[110,133],"such":[112],"problems.":[113],"CCEA-AVP":[117,128],"compared":[119],"highlight":[125],"benefits.":[127],"offers":[129],"possibility":[131],"where":[136],"among":[138],"might":[140],"regions":[144],"search":[147],"space.":[148]},"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":11},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}