{"id":"https://openalex.org/W2558254776","doi":"https://doi.org/10.1109/cec.2016.7744041","title":"Comparison of differential grouping and random grouping methods on sCCPSO for large-scale constrained optimization","display_name":"Comparison of differential grouping and random grouping methods on sCCPSO for large-scale constrained optimization","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2558254776","doi":"https://doi.org/10.1109/cec.2016.7744041","mag":"2558254776"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","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/A5100338429","display_name":"Peng Chen","orcid":"https://orcid.org/0000-0001-5221-3655"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chen Peng","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103175086","display_name":"Qing Hui","orcid":"https://orcid.org/0000-0001-9488-5257"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qing Hui","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100338429"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.4285,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79808544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2057","last_page":"2063"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9940000176429749,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7028543949127197},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6554129123687744},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6176409721374512},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5381181836128235},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5348013639450073},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.4971952736377716},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4952913820743561},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38042983412742615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32872384786605835}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7028543949127197},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6554129123687744},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6176409721374512},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5381181836128235},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5348013639450073},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.4971952736377716},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4952913820743561},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38042983412742615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32872384786605835},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W120185646","https://openalex.org/W181374404","https://openalex.org/W1555689267","https://openalex.org/W1996936486","https://openalex.org/W2013497292","https://openalex.org/W2048810930","https://openalex.org/W2110368321","https://openalex.org/W2118840131","https://openalex.org/W2145418868","https://openalex.org/W2155005783","https://openalex.org/W2156566884","https://openalex.org/W2288517616","https://openalex.org/W2294612249","https://openalex.org/W6683195961","https://openalex.org/W6696251670"],"related_works":["https://openalex.org/W3019402777","https://openalex.org/W2031835531","https://openalex.org/W2388590088","https://openalex.org/W4386596916","https://openalex.org/W1969166468","https://openalex.org/W2097519318","https://openalex.org/W2116377213","https://openalex.org/W2122371747","https://openalex.org/W2003904901","https://openalex.org/W2767141225"],"abstract_inverted_index":{"Differential":[0],"grouping":[1,15,21,28],"(DG)":[2],"is":[3,17,23,141],"a":[4,24],"pregrouping":[5],"method":[6,25,41,140],"in":[7],"some":[8,35,127],"unconstrained":[9],"cooperative":[10,48],"coevolutionary":[11,49],"algorithms":[12],"where":[13,26],"the":[14,27,38,46,73,82,107,112,138,144,149],"scheme":[16],"predetermined,":[18],"while":[19,104],"random":[20],"(RG)":[22],"schemes":[29],"are":[30],"dynamically":[31],"changed":[32],"according":[33],"to":[34,71,146],"criteria.":[36],"As":[37],"first":[39],"nature-inspired":[40],"for":[42,96],"large-scale":[43,97],"constrained":[44,98],"optimization,":[45],"\u03b5-constrained":[47],"particle":[50],"swarm":[51],"optimization":[52],"\u03b5CCPSO)":[53],"algorithmic":[54],"framework":[55],"has":[56,119],"been":[57],"recently":[58],"proposed":[59,89],"and":[60,77,87,94],"studied":[61],"with":[62,129],"different":[63],"RG":[64,78],"techniques,":[65],"e.g.,":[66],"\u03b5CCPSOw2.":[67],"This":[68],"paper":[69],"aims":[70],"compare":[72],"effectiveness":[74],"of":[75,115,137],"DG":[76,90,139],"methods":[79],"applied":[80],"on":[81,111],"\u03b5CCPSO":[83],"framework,":[84],"using":[85],"\u03b5CCPSOw2":[86,105],"two":[88],"implementations,":[91],"i.e.,":[92],"\u03b5CCPSOdg":[93],"\u03b5CCPSOdg2,":[95],"problems.":[99],"The":[100],"results":[101],"show":[102],"that,":[103],"possesses":[106],"fastest":[108],"convergence":[109],"rate":[110],"fitness":[113],"values":[114],"most":[116],"problems,":[117],"\u03b5CCPSOdg2":[118],"better":[120],"constraint":[121],"violations":[122],"minimization":[123],"ability":[124],"when":[125],"solving":[126],"problems":[128],"nonseparable":[130],"equality":[131],"constraints.":[132],"In":[133],"addition,":[134],"an":[135],"improvement":[136],"proposed,":[142],"increasing":[143],"speed":[145],"approximately":[147],"twice":[148],"original.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
