{"id":"https://openalex.org/W2083764792","doi":"https://doi.org/10.1109/cec.2009.4982979","title":"A clustering particle swarm optimizer for dynamic optimization","display_name":"A clustering particle swarm optimizer for dynamic optimization","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2083764792","doi":"https://doi.org/10.1109/cec.2009.4982979","mag":"2083764792"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4982979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4982979","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":true,"oa_status":"green","oa_url":"http://bura.brunel.ac.uk/bitstream/2438/5821/2/Fulltext.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021519344","display_name":"Changhe Li","orcid":"https://orcid.org/0000-0003-4409-956X"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Changhe Li","raw_affiliation_strings":["Department of Computer Science, University of Leicester, Leicester, UK","Department of Computer Science, University of Leicester, University Road, LE1 7RH, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"Department of Computer Science, University of Leicester, University Road, LE1 7RH, United Kingdom#TAB#","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040583251","display_name":"Shengxiang Yang","orcid":"https://orcid.org/0000-0001-7222-4917"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shengxiang Yang","raw_affiliation_strings":["Department of Computer Science, University of Leicester, Leicester, UK","Department of Computer Science, University of Leicester, University Road, LE1 7RH, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"Department of Computer Science, University of Leicester, University Road, LE1 7RH, United Kingdom#TAB#","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021519344"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":null,"apc_paid":null,"fwci":10.3875,"has_fulltext":true,"cited_by_count":116,"citation_normalized_percentile":{"value":0.98275711,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"439","last_page":"446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9977999925613403,"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.9962000250816345,"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/cluster-analysis","display_name":"Cluster analysis","score":0.6960315704345703},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6833990216255188},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6485419869422913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6383407115936279},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.627582848072052},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.6231256127357483},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6189616918563843},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4277932941913605},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.4196526110172272},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41218051314353943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38756605982780457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19297340512275696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1654892861843109},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.06972923874855042}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6960315704345703},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6833990216255188},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6485419869422913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6383407115936279},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.627582848072052},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.6231256127357483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6189616918563843},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4277932941913605},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.4196526110172272},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41218051314353943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38756605982780457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19297340512275696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1654892861843109},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.06972923874855042},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cec.2009.4982979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4982979","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:bura.brunel.ac.uk:2438/5821","is_oa":true,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/5821","pdf_url":"http://bura.brunel.ac.uk/bitstream/2438/5821/2/Fulltext.pdf","source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.4699","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.4699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mcs.le.ac.uk/~syang/Papers/CEC09_2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.6900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.6900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bura.brunel.ac.uk/bitstream/2438/5821/2/Fulltext.pdf","raw_type":"text"},{"id":"pmh:oai:dora.dmu.ac.uk:2086/8723","is_oa":false,"landing_page_url":"http://hdl.handle.net/2086/8723","pdf_url":null,"source":{"id":"https://openalex.org/S4306400394","display_name":"DMU Open Research Archive (De Montfort University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66943878","host_organization_name":"De Montfort University","host_organization_lineage":["https://openalex.org/I66943878"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:bura.brunel.ac.uk:2438/5821","is_oa":true,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/5821","pdf_url":"http://bura.brunel.ac.uk/bitstream/2438/5821/2/Fulltext.pdf","source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2083764792.pdf","grobid_xml":"https://content.openalex.org/works/W2083764792.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W9691476","https://openalex.org/W132155930","https://openalex.org/W1535622669","https://openalex.org/W1543559221","https://openalex.org/W1563447057","https://openalex.org/W1579827480","https://openalex.org/W1608551892","https://openalex.org/W1855408646","https://openalex.org/W2109364787","https://openalex.org/W2115350182","https://openalex.org/W2117595234","https://openalex.org/W2118840131","https://openalex.org/W2142146594","https://openalex.org/W2148458253","https://openalex.org/W2152195021","https://openalex.org/W2169245194","https://openalex.org/W2171107890","https://openalex.org/W2388776976","https://openalex.org/W2543580944","https://openalex.org/W6632389782","https://openalex.org/W6633645693","https://openalex.org/W6638984247"],"related_works":["https://openalex.org/W2006324351","https://openalex.org/W2965421953","https://openalex.org/W2349895019","https://openalex.org/W2116074880","https://openalex.org/W2070977815","https://openalex.org/W2950423922","https://openalex.org/W2121780490","https://openalex.org/W2137136732","https://openalex.org/W2972744589","https://openalex.org/W2132113279"],"abstract_inverted_index":{"In":[0],"the":[1,20,27,30,82,92,110,113,121,124],"real":[2],"world,":[3],"many":[4],"applications":[5],"are":[6,106],"nonstationary":[7],"optimization":[8,13,53],"problems.":[9,54],"This":[10],"requires":[11],"that":[12],"algorithms":[14],"need":[15],"to":[16,61,80,108],"not":[17],"only":[18],"find":[19,81],"global":[21,32],"optimal":[22,84],"solution":[23,34],"but":[24],"also":[25,78],"track":[26,62],"trajectory":[28],"of":[29,112,123],"changing":[31],"best":[33],"in":[35,86,91,133],"a":[36,45,67,87,100],"dynamic":[37,52,102,134],"environment.":[38],"To":[39],"achieve":[40],"this,":[41],"this":[42],"paper":[43],"proposes":[44],"clustering":[46,59],"particle":[47],"swarm":[48],"optimizer":[49],"(CPSO)":[50],"for":[51,127],"The":[55,116],"algorithm":[56,126],"employs":[57],"hierarchical":[58],"method":[60,76],"multiple":[63,131],"peaks":[64],"based":[65],"on":[66],"nearest":[68],"neighbor":[69],"search":[70,75,93],"strategy.":[71],"A":[72],"fast":[73],"local":[74,88],"is":[77],"proposed":[79,114,125],"near":[83],"solutions":[85],"promising":[89],"region":[90],"space.":[94],"Six":[95],"test":[96,109],"problems":[97],"generated":[98],"from":[99],"generalized":[101],"benchmark":[103],"generator":[104],"(GDBG)":[105],"used":[107],"performance":[111],"algorithm.":[115],"numerical":[117],"experimental":[118],"results":[119],"show":[120],"efficiency":[122],"locating":[128],"and":[129],"tracking":[130],"optima":[132],"environments.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}